An infeasible interior-point algorithm for solving primal and dual geometric programs

Mathematical Programming, Series B

Volumn 76, Issue 1, 1997, Pages 155-181

  Kortanek, K O ^a   Xu, Xiaojie ^b   Ye, Yinyu ^a  

^a UNIVERSITY OF IOWA   (United States)

^b INSTITUTE OF SYSTEMS SCIENCE   (China)

Author keywords

Convex analysis; Duality; Geometric programming; Infeasible primal dual algorithm; Numerical implementation; Subfeasible solutions

Indexed keywords

EID: 0043048462     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02614382     Document Type: Article

References (43)

1. K. Anstreicher and J.-Ph. Vial, "On the convergence of an infeasible primal-dual interior-point method for convex programming", Optimization Methods and Software 4 (1994) 273-283.
2. O. Bahn, J.L. Goffin, J.-Ph. Vial and O. Du Merle, "Experimental behavior of an interior point cutting plane algorithm for convex programming: An application to geometric programming," Discrete Applied Mathematics 49 (1994) 2-23.
3. H. El Barmi, and R.L. Dykstra, "Restricted multinomial maximum likelihood estimation based upon Fenchel duality," Statistics and Probability Letters 21 (1994) 121-130.
4. P.A. Beck and J.G. Ecker, "A modified concave simplex algorithm for geometric programming", Journal of Optimization Theory and Applications 15 (1975) 189-202.
5. C.S. Beightler and D.T. Phillips, Applied Geometric Programming (Wiley, New York, 1976).
6. D.L. Bricker, K.O. Kortanek and L. Xu, "Maximum likelihood estimates with order restrictions on probabilities and odds ratios: A geometric programming approach," Applied Mathematical and Computational Sciences, The University of IA, Iowa City, IA 52242 (1995).
7. A. Charnes, W.W. Cooper, B. Golany and J. Masters, "Optimal design modification by geometric programming and constrained stochastic network models," International Journal of Systems Science 19 (1988) 825-844.
8. A. Charnes, W.W. Cooper and K.O. Kortanek, "Semi-infinite programming, differentiability and geometric programming," Journal of Mathematical Sciences 6 (1971) 19-40.
9. R.S. Dembo, "A set of geometric programming test problems and their solutions," Mathematical Programming 10 (1976) 192-213.
10. R.S. Dembo, "Dual to primal conversion in geometric programming," Journal of Optimization Theory and Applications 26 (1978) 243-252.
11. R.J. Duffin, E.L. Peterson and C. Zener, Geometric Programming - Theory and Application (Wiley, New York, 1967).
12. R.J. Duffin, "Infinite programs," in: H.W. Kuhn and A.W. Tucker, eds., Linear Inequalities and Related Systems (Princeton University Press, Princeton, NJ, 1956) pp. 157-170.
13. J. Dupacǒvá, P. Charamza and J. Mádl, "On stochastic aspects of a metal cutting problem," Department of Statistics, Charles University, Sokolovská 83, 18 600 Prague, Czech Republic (1993).
14. A.S. El-Bakry, R.A. Tapia, T. Tsuchiya and Y. Zhang, "On the formulation and theory of the primal-dual Newton interior-point method for nonlinear programming," Department of Computational and Applied Mathematics, Rice University, Houston, TX (1993).
15. S.C. Fang, E.L. Peterson and J.R. Rajasekera, "Controlled dual perturbations for posynomial programs," European Journal of Operational Research 35 (1988) 111-117.
16. A.V. Fiacco, "Objective function and logarithmic barrier function properties in convex programming: level sets, solution attainment and strict convexity," Optimization 34 (1995) 213-222.
17. A.V. Fiacco and A. Ghaemi, "Sensitivity analysis of a nonlinear water pollution control model using an upper Hudson river data base," The George Washington University, Washington, D.C. (1981).
18. A.V. Fiacco and A. Ghaemi, "Sensitivity and parametric bound analysis of an electric power generator GP model: Optimal steam turbine-exhaust annulus and condensor sizes, serial T-437," The George Washington University, Washington, D.C. (1981).
19. W. Gochet, K.O. Kortanek and Y. Smeers, "Using semi-infinite programming in geometric programming," in: E. Shlifer, ed., Proceedings of the 20th International TIMS: On Management Sciences, Developing Countries and National Priorities 2 (Jerusalem Academic Press, Jerusalem, and North-Holland, Amsterdam, 1973) pp. 430-438.
20. W. Gochet, K.O. Kortanek, and Y. Smeers, "On a classification scheme for geometric programming and complementarity theorems," Applicable Analysis 6 (1976) 47-59.
21. E.G. Goldstein, Theory of Convex Programming, Translations of Mathematical Monographs, (American Mathematical Society, Providence, RI, 1972).
22. D. den Hertog, J. Kaliski, C. Roos and T. Terlaky, "A logarithmic barrier cutting plane method for convex programming," Annals of Operations Research 58 (1995) 69-90.
23. R. Jagannathan, "A stochastic geometric programming problem with multiplicative recourse," Operations Research Letters 9 (1990) 99-104.
24. S. Jha, K.O. Kortanek and H. No, "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 City (1988).
25. M. Kojima, T. Noma and A. Yoshise, "Global convergence in infeasible-interior-point algorithms," Mathematical Programming 65 (1994) 43-72.
26. K.O. Kortanek, "Classifying convex extremum problems over linear topologies having separation properties," Journal of Mathematical Analysis and Applications 46 (1974) 725-755.
27. K.O. Kortanek and H. No, "A second order affine scaling algorithm for the geometric programming dual with logarithmic barrier," Optimization 23 (1992) 303-322.
28. K.O. Kortanek, F. Potra and Y. Ye, "On some efficient interior point methods for nonlinear convex programming," Linear Algebra and its Applications 152 (1991) 169-189.
29. K.O. Kortanek and X. Xu, "Numerical experiments with XGP - An optimizer for geometric programming and some comparisons to other solvers," College of Business Administration, The University of Iowa, Iowa City, IA 52242 (1995).
30. K.O. Kortanek and J. Zhu, "On controlling the parameter in the logarithmic barrier term for convex programming problems," Journal of Optimization Theory and Applications 84 (1995) 117-143.
31. S. Mizuno, M.J. Todd and Y. Ye "A surface of analytic centers and infeasible-interior-point algorithms for linear programming," Mathematics of Operations Research 20 (1995) 135-162.
32. J.L. Nazareth, "A framework for interior methods of linear programming," Department of Pure and Applied Mathematics, Washington State University (1994).
33. Yu. Nesterov and A. Nemirovskii, Interior-Point Polynomial Algorithms in Convex Programming: Theory and Application (Society for Industrial and Applied Mathematics, Philadelphia, PA, 1993).
34. M.J. Rijckaert and X.M. Martens, "Bibliographical note on geometric programming," Journal of Optimization Theory and Applications 26 (1978) 325-337.
35. M.J. Rijckaert and X.M. Martens, "Comparison of generalized geometric programming algorithms," Journal of Optimization Theory and Applications 26 (1978) 205-242.
36. T. Robertson, F.T. Wright and R.L. Dykstra, Order Restricted Statistical Inference (Wiley, New York, 1988).
37. R.T. Rockafellar, Convex Analysis (Princeton University Press, Princeton, NJ, 1970).
38. C.H. Scott and T.R. Jefferson, "Allocation of resources in project management," International Journal on Systems Science 26 (1995) 413-420.
39. R.J. Vanderbei, "Symmetric quasi-definite matrices," SIAM Journal on Optimization 5 (1995) 100-113.
40. J.-P. Vial, "Computational experience with a primal-dual interior-point method for smooth convex programming," Optimization Methods and Software 3 (1994) 285-316.
41. X. Xu, "On the implementation of a homogeneous and self-dual linear programming algorithm," College of Business Administration, The University of Iowa, Iowa City, IA 52242 (1994).
42. X. Xu, "An script O sign(√n L)-iteration large-step infeasible path-following algorithm for linear programming," College of Business Administration, The University of Iowa, Iowa City, IA 52242 (1994).
43. J. Zhu, K.O. Kortanek and S. Huang, "Controlled dual perturbations for central path trajectories in geometric programming," European Journal of Operational Research 73 (1992) 524-531.