A second order affine scaling algorithm for the geometric programming dual with logarithmic barrier

References

• Beck , P.A. and Ecker , J.G. 1975 . A modified concave simplex algorithm for geometric programming . Journal of Optimization Theory and Applications , 15 : 189 – 202 .
   Web of Science ®Google Scholar
• Beightler , C.S. and Phillips , D.T. 1976 . Applied Geometric Programming , New York : John Wiley & Sons .
   Google Scholar
• Ben-Tal , A. , Borwein , J.M. and Teboulle , M. 1988 . A dual approach to multidimensional Lp spectral estimation problems . SI AM J. of Control and Optimization , 26 : 985 – 996 .
   Web of Science ®Google Scholar
• Ben-Tal , A. , Charnes , A. and Teboulle , M. 1989 . Entropic means . J. of Mathematical Analyses and Applications , 139 : 537 – 551 .
   Web of Science ®Google Scholar
• Ben-Tal , A. , Teboulle , M. and Charnes , A. 1988 . The role of duality in optimization problems involving entropy functionals . J. of Optimization Theory and Applications , 58 : 209 – 223 .
   Web of Science ®Google Scholar
• Bertsekas , D.P. 1982 . Projected Newton methods for optimization problems with simple constraints . SIAM J. Control and Optimization , 20 ( 2 ) : 221 – 246 .
   Web of Science ®Google Scholar
• Bricker D. L. Rajgopal J. Eliminating the Need for Subsidiary Problems in Geometric Programming Technical Report Industrial and Management Engineering, The University of Iowa Iowa, IA June 1994
   Google Scholar
• Charnes , A. , Cooper , W.W. and Kortanek , K.O. 1971 . Semi-infinite programming,differentiability and geometric programming Part I: with examples and applications ineconomics and management science . Journal of Mathematical Sciences , 6 ( 2 ) (R. S. Varma Memorial Volume, India)
   Google Scholar
• Dembo , R.S. 1976 . A set of geometric programming test problems and their solutions . Mathematical Programming , 10 ( 2 ) : 192 – 213 .
   Web of Science ®Google Scholar
• Dembo , R.S. 1978 . Current state of the art of algorithms and computer software for geometricprogramming . Journal of Optimization Theory and Applications , 26 ( 2 ) : 149 – 183 .
   Web of Science ®Google Scholar
• Dembo , R.S. 1978 . Dual to primal conversion in geometric programming . Journal of Optimization Theory and Applications , 26 ( 2 ) : 243 – 252 .
   Web of Science ®Google Scholar
• Dembo , R.S. 1979 . Second order algorithms for the posynomial geometric programming dual, Part I: Analysis . Mathematical Programming , 17 ( 2 ) : 156 – 175 .
   Web of Science ®Google Scholar
• den Hertog D. Roos C. Terlaky T. A Potential Reduction Method for a Class of Smooth Convex Programming Problems Technical Report Faculty of Technical Mathematics and Computer Science, Delft University of Technology Netherlands 1990
   Google Scholar
• Duffin , R.J. , Peterson , E.L. and Zener , C. 1967 . Geometric Programming —Theory and Application , New York : John Wiley & Sons .
   Google Scholar
• Fiacco , A.V. and Ghaemi , A. 1981 . Sensitivity Analysis of a Nonlinear Water Pollution Control Model Using an Upper Hudson River Data Base , Washington, D.C : The George Washington University .
   Google Scholar
• Fiacco , A.V. and Ghaemi , A. August 1981 . Sensitivity and Parametric Bound Analysis of an Electric Power Generator GP Model: Optimal Steam Turbine Exhaust Annulus and Condensor Sizes , August , Washington, D.C : The George Washington University . Serial T-437
   Google Scholar
• Fiacco , A.V. and McCormick , G.P. 1968 . Nonlinear Programming: Sequential Unconstrained Minimization Techniques , New York : J. Wiley and Sons . re-issued in Classics in Applied Mathematics SIAM, Philadelphia, 1990
   Google Scholar
• Gill , P.E. , Murray , W. , Saunders , M.A. , Tomlin , J.A. and Wright , M.H. 1986 . On projected Newton barrier methods for linear programming . Mathematical Programming , 36 : 183 – 209 .
   Web of Science ®Google Scholar
• Gochet , W. , Kortanek , K.O. and Smeers , Y. 1976 . On a classification scheme for geometric programming and complementarity theorems . Applicable Analysis , 6 : 47 – 59 .
   Google Scholar
• Golstein , E G. 1972 . Theory of Convex Programming. Translations of Mathematical Monographs , RI : American Mathematical Society . Providence
   Google Scholar
• Gribik P. R. Huang S. Kortanek K.O. First and Second Order Convex Programming Scaling Algorithms Applied to Geometric Programming Working Paper Series No, 87-6 College of Business Administration, The University of Iowa Iowa 1987
   Google Scholar
• Gribik , P.R. and Lee , D.N. 1978 . A Comparison of Two Central Cutting Plane Algorithms for Prototype Geometric Programming Problems . Proceedings of the Third Symposium on Operations Research . September 6 1978 . Universitaät Mannheim .
   Google Scholar
• Güler O. Optimal algorithms for smooth convex programming in Banach spaces SIAM J. Control and Optimization to appear
   Google Scholar
• Jarre , F. 1990 . On the convergence of the method of analytic centers when applied to convex quadratic programs . Mathematical Programming , 49 : 341 – 358 . 1991
   Web of Science ®Google Scholar
• Jha S Kortanek K.O No H Lotsizing and Setup Time Reduction Under Stochastic Demand: A Geometric Programming Approach Working Paper Series No. 88-12 College of Business Administration, The University of Iowa Iowa 1998
   Google Scholar
• Kortanek , K.O. , Potra , F. and Ye , Y. 1991 . On some efficient interior point method for nonlinear convex programming . Linear Algebra and Its Applications , 152 : 169 – 189 .
   Web of Science ®Google Scholar
• Kortanek , K.O. and Shi , M. 1987 . Convergence results and numerical experiments on a linear programming hybrid algorithm . European Journal of Operational Research , 32 : 47 – 61 .
   Web of Science ®Google Scholar
• Kortanek , K.O. and Soyster , A.L. 1981 . On equating the difference between optimal and marginal values of general convex programs . J. Optimization Theory and Applications , 33 : 57 – 68 .
   Web of Science ®Google Scholar
• Mifflin , R. 1987 . An implementation of an algorithm for univariate minimization and an application to nested optimization . Mathematical Programming Study , 31 : 155 – 166 .
   Web of Science ®Google Scholar
• Nesterov Ju. E. Nemirovsky A.S. Self-Concordant Functions and Polynomial-Time Methods in Convex Programming Central Economics & Mathematical Institute, USSR Acad. Sci 1989
   Google Scholar
• Powell , M.J.D. 1988 . An algorithm for maximizing entropy subject to simple bounds . Mathematical Programming , 42 : 171 – 180 .
   Web of Science ®Google Scholar
• Rajgopal , J.A. 1985 . Duality Theory for Geometric Programming . Based on Generalized Linear Programming , The University of Iowa, Ph.D. Thesis
   Google Scholar
• Rijckaert , M.J. and Martens , X.M. 1978 . Bibliographical note on geometric programming . Journal of Optimization Theory and Applications , 26 : 325 – 337 .
   Web of Science ®Google Scholar
• Rijckaert , M.J. and Martens , X.M. 1978 . Comparison of generalized geometric programming algorithms . Journal of Optimization Theory and Applications , 26 : 205 – 242 .
   Web of Science ®Google Scholar
• Rockafellar , R.T. 1970 . Convex Analysis , Princeton, NJ : Princeton University Press .
   Google Scholar
• Rosenberg , E. 1981 . On solving a primal geometric program by partial dual optimization . Mathematical Programming , 21 : 319 – 330 .
   Web of Science ®Google Scholar
• Sarma , P.V.L.N. , Martens , X.M. , Reklaitis , G.V. and Rijckaert , M.J. 1978 . A comparison of computational strategies for geometric programs . Journal of Optimization Theory and Applications , 26 : 185 – 203 .
   Web of Science ®Google Scholar
• Shor , N.Z. 1982 . “ Generalized Gradient Methods of Non-differentiabie Optimization Employing Space Dilatation Operations ” . In Mathematical Programming, The State of the Art , Edited by: Bachem , A. , Grötschel , M. and Korte , B. New York : Springer-Verlag .
   Google Scholar
• Sonnevend , G. 1985 . An Analytical Centre for Polyhedrons and New Classes of Global Algorithms for Linear (Smooth, Convex) Programming , Edited by: Prekopa , A. Vol. 84 , 866 – 876 . Springer-Verlag . Lecture Notes in Control and Information Sciences
   Google Scholar
• Teboulle, M. A simple duality proof for quadratically constrained entropy functionals and extensions to convex constraints. (forthcoming: SIAM J. of Applied Mathematics).
   Google Scholar