An infeasible interior-point algorithm for solving primal and dual geometric programs
暂无分享,去创建一个
[1] R. A. Cuninghame-Green,et al. Applied geometric programming , 1976 .
[2] K. Anstreicher,et al. On the convergence of an infeasible primal-dual interior-point method for convex programming , 1994 .
[3] E. Gol′šteĭn,et al. Theory of Convex Programming , 1972 .
[4] Yves Smeers,et al. Using semi-infinite programming in geometric programming , 1973 .
[5] Y. Ye,et al. On some efficient interior point methods for nonlinear convex programming , 1991 .
[6] Anthony V. Fiacco,et al. Sensitivity Analysis of a Nonlinear Water Pollution Control Model Using an Upper Hudson River Data Base , 1982, Oper. Res..
[7] Shinji Mizuno,et al. A Surface of Analytic Centers and Primal-Dual Infeasible-Interior-Point Algorithms for Linear Programming , 1995, Math. Oper. Res..
[8] R. S. Dembo. Dual to primal conversion in geometric programming , 1978 .
[9] A. V. Fiacco,et al. Sensitivity and parametric bound analysis of an electric power generation gp model: optimal steam turbine exhaust annulus and condenser sizes. Scientific report , 1981 .
[10] Clarence Zener,et al. Geometric Programming : Theory and Application , 1967 .
[11] Shu-Cherng Fang,et al. Controlled dual perturbations for posynomial programs , 1988 .
[12] Robert J. Vanderbei,et al. Symmetric Quasidefinite Matrices , 1995, SIAM J. Optim..
[13] Kenneth O. Kortanek,et al. Classifying convex extremum problems over linear topologies having separation properties , 1974 .
[14] Abraham Charnes,et al. SEMI-INFINITE PROGRAMMING, DIFFERENTIABILITY AND GEOMETRIC PROGRAMMING: PART II , 1966 .
[15] Tamás Terlaky,et al. A logarithmic barrier cutting plane method for convex programming , 1995, Ann. Oper. Res..
[16] John L. Nazareth,et al. A framework for interior methods of linear programming , 1995 .
[17] Ron S. Dembo,et al. A set of geometric programming test problems and their solutions , 1976, Math. Program..
[18] X. M. Martens,et al. Comparison of Generalized Geometric Programming Algorithms , 1978 .
[19] J. Vial. Computational experience with a primal-dual interior-point method for smooth convex programming , 1994 .
[20] Masakazu Kojima,et al. Global convergence in infeasible-interior-point algorithms , 1994, Math. Program..
[21] A. V. Fiacco. Objective function and logarithmic barrier function properties in convex programming: level sets, solution attainment and strict convexity * , 1995 .
[22] Zhengfeng Li,et al. Global convergence of three terms conjugate gradient methods , 1994 .
[23] X. M. Martens,et al. Bibliographical note on geometric programming , 1978 .
[24] Kenneth O. Kortanek,et al. Maximum likelihood estimates with order restrictions on probabilities and odds ratios: A geometric programming approach , 1997, Adv. Decis. Sci..
[25] K. Kortanek,et al. A second order affine scaling algorithm for the geometric programming dual with logarithmic barrier , 1992 .
[26] Jean-Philippe Vial,et al. Experimental Behavior of an Interior Point Cutting Plane Algorithm for Convex Programming: An Application to Geometric Programming , 1994, Discret. Appl. Math..
[27] Jitka Dupačová,et al. On Stochastic Aspects of a Metal Cutting Problem , 1995 .
[28] Clarence Zener,et al. Geometric Programming , 1974 .
[29] K. O. Kortanek,et al. Controlled dual perturbations for central path trajectories in geometric programming , 1994 .
[30] C. Scott,et al. Allocation of resources in project management , 1995 .
[31] Yves Smeers,et al. On a classification scheme for geometric programming and complementarity theorems , 1976 .
[32] Abraham Charnes,et al. Optimal design modifications by geometric programming and constrained stochastic network models , 1988 .
[33] Shinji Mizuno,et al. A Surface of Analytic Centers and Infeasible- Interior-Point Algorithms for Linear Programming , 1993 .
[34] J. Ecker,et al. A modified concave simplex algorithm for geometric programming , 1975 .
[35] R. Jagannathan,et al. A stochastic geometric programming problem with multiplicative recourse , 1990 .
[36] Hammou El Barmi,et al. Restricted multinomial maximum likelihood estimation based upon Fenchel duality , 1994 .
[37] K. O. Kortanek,et al. On controlling the parameter in the logarithmic barrier term for convex programming problems , 1995 .
[38] F. T. Wright,et al. Order restricted statistical inference , 1988 .