A globally convergent primal-dual interior point method for constrained optimization
暂无分享,去创建一个
[1] Garth P. McCormick,et al. A Guide to SUMT-Version 4: The Computer Program Implementing the Sequential Unconstrained Minimization Technique for Nonlinear Programming, , 1965 .
[2] M. J. D. Powell,et al. A fast algorithm for nonlinearly constrained optimization calculations , 1978 .
[3] Klaus Schittkowski,et al. More test examples for nonlinear programming codes , 1981 .
[4] R. Fletcher. Practical Methods of Optimization , 1988 .
[5] J. Vial. Computational experience with a primal-dual interior-point method for smooth convex programming , 1994 .
[6] T. Tsuchiya,et al. On the formulation and theory of the Newton interior-point method for nonlinear programming , 1996 .
[7] Hiroshi Yamashita,et al. Q-SUPERLINEAR CONVERGENCE OF PRIMAL-DUAL INTERIOR POINT QUASI-NEWTON METHODS FOR CONSTRAINED OPTIMIZATION , 1997 .
[8] Jorge Nocedal,et al. On the Local Behavior of an Interior Point Method for Nonlinear Programming , 1997 .
[9] Jorge Nocedal,et al. A trust region method based on interior point techniques for nonlinear programming , 2000, Math. Program..