Investigation of path-following algorithms for signomial geometric programming problems
暂无分享,去创建一个
[1] U. Passy,et al. Generalized Polynomial Optimization , 1967 .
[2] Mordecai Avriel,et al. Complementary Geometric Programming , 1970 .
[3] Adi Ben-Israel,et al. Constrained maximization of posynomials by geometric programming , 1970 .
[4] Douglass J. Wilde,et al. A Lagrangian algorithm for equality constrained generalized polynomial optimization , 1971 .
[5] U. Passy,et al. Generalized Weighted Mean Programming , 1971 .
[6] Richard James Duffin,et al. Reversed Geometric Programs Treated by Harmonic Means , 1972 .
[7] Don T. Phillips,et al. Geometric Programming with Slack Constraints and Degrees of Difficulty , 1973 .
[8] Don T. Phillips,et al. Geometric Programming: A Technical State-of-the-Art Survey , 1973 .
[9] Clarence Zener,et al. Geometric Programming , 1974 .
[10] R. S. Dembo. Current state of the art of algorithms and computer software for geometric programming , 1977 .
[11] Leon S. Lasdon,et al. Solving geometric programs using GRG: Results and comparisons , 1978 .
[12] X. M. Martens,et al. Comparison of generalized geometric programming algorithms , 1978 .
[13] R. S. Sacher,et al. Comparison of a special-purpose algorithm with general-purpose algorithms for solving geometric programming problems , 1984 .
[14] Narendra Karmarkar,et al. A new polynomial-time algorithm for linear programming , 1984, STOC '84.
[15] Renato D. C. Monteiro,et al. Interior path following primal-dual algorithms. part II: Convex quadratic programming , 1989, Math. Program..
[16] Mauricio G. C. Resende,et al. An interior point algorithm to solve computationally difficult set covering problems , 1991, Math. Program..
[17] Nimrod Megiddo,et al. An interior point potential reduction algorithm for the linear complementarity problem , 1992, Math. Program..
[18] Panos M. Pardalos,et al. Implementation of interior-point algorithms for some entropy optimization problems , 1992 .
[19] K. Kortanek,et al. A second order affine scaling algorithm for the geometric programming dual with logarithmic barrier , 1992 .
[20] Kenneth O. Kortanek,et al. A Polynomial Barrier Algorithm for Linearly Constrained Convex Programming Problems , 1993, Math. Oper. Res..