Computational experience with a primal-dual interior-point method for smooth convex programming
暂无分享,去创建一个
[1] Anthony V. Fiacco,et al. Nonlinear programming;: Sequential unconstrained minimization techniques , 1968 .
[2] 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 .
[3] Anthony V. Fiacco,et al. Sensitivity Analysis of a Nonlinear Water Pollution Control Model Using an Upper Hudson River Data Base , 1982, Oper. Res..
[4] Narendra Karmarkar,et al. A new polynomial-time algorithm for linear programming , 1984, Comb..
[5] Jean-Philippe Vial,et al. An extension of Karmarkar's algorithm for solving a system of linear homogeneous equations on the simplex , 1987, Math. Program..
[6] Kunio Tanabe,et al. Centered newton method for mathematical programming , 1988 .
[7] M. Kojima,et al. A primal-dual interior point algorithm for linear programming , 1988 .
[8] James Renegar,et al. A polynomial-time algorithm, based on Newton's method, for linear programming , 1988, Math. Program..
[9] F. Jarre. On the method of analytic centers for solving smooth convex programs , 1988 .
[10] Clyde L. Monma,et al. An Implementation of a Primal-Dual Interior Point Method for Linear Programming , 1989, INFORMS J. Comput..
[11] N. Megiddo. Pathways to the optimal set in linear programming , 1989 .
[12] Renato D. C. Monteiro,et al. Interior path following primal-dual algorithms. part I: Linear programming , 1989, Math. Program..
[13] Michael J. Todd,et al. A Centered Projective Algorithm for Linear Programming , 1990, Math. Oper. Res..
[14] I. Lustig,et al. Interior Point Methods for Linear Programming: Just Call Newton, Lagrange, and Fiacco and McCormick! , 1990 .
[15] Irvin Lustig,et al. Feasibility issues in a primal-dual interior-point method for linear programming , 1990, Math. Program..
[16] I. Lustig,et al. Computational experience with a primal-dual interior point method for linear programming , 1991 .
[17] Sanjay Mehrotra,et al. On computing the center of a convex quadratically constrained set , 1991, Math. Program..
[18] Sanjay Mehrotra,et al. On the Implementation of a Primal-Dual Interior Point Method , 1992, SIAM J. Optim..
[19] F. Jarre. Interior-point methods for convex programming , 1992 .
[20] K. Kortanek,et al. A second order affine scaling algorithm for the geometric programming dual with logarithmic barrier , 1992 .
[21] Shinji Mizuno,et al. On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming , 1993, Math. Oper. Res..
[22] K. Anstreicher,et al. On the convergence of an infeasible primal-dual interior-point method for convex programming , 1994 .
[23] Tamás Terlaky,et al. A logarithmic barrier cutting plane method for convex programming , 1995, Ann. Oper. Res..