A Primal-Dual Trust-Region Algorithmfor Minimizing a Non-convex FunctionSubject to General Inequalityand Linear Equality
暂无分享,去创建一个
N. I. M. Gould | D. Orban | Ph. L. Toint | P. Toint | N. Gould | A. Conn | D. Orban | A. R. Conn | Constraintsby
[1] T. Tsuchiya,et al. On the formulation and theory of the Newton interior-point method for nonlinear programming , 1996 .
[2] Nicholas I. M. Gould,et al. CUTE: constrained and unconstrained testing environment , 1995, TOMS.
[3] Nicholas I. M. Gould,et al. Solving the Trust-Region Subproblem using the Lanczos Method , 1999, SIAM J. Optim..
[4] P. Toint,et al. A primal-dual algorithm for minimizing a non-convex function subject to bound and linear equality constraints , 2000 .
[5] Robert J. Vanderbei,et al. An Interior-Point Algorithm for Nonconvex Nonlinear Programming , 1999, Comput. Optim. Appl..
[6] Michael L. Overton,et al. A Primal-dual Interior Method for Nonconvex Nonlinear Programming , 1998 .
[7] J. Dussault. Numerical stability and efficiency of penalty algorithms , 1995 .
[8] N. Gould. On the convegence of a sequential penalty function method for constrained minimization , 1989 .
[9] Jorge Nocedal,et al. An Interior Point Algorithm for Large-Scale Nonlinear Programming , 1999, SIAM J. Optim..
[10] Jacek Gondzio,et al. Implementation of Interior Point Methods for Large Scale Linear Programming , 1996 .
[11] Robert Mifflin. Convergence bounds for nonlinear programming algorithms , 1975, Math. Program..
[12] P. Toint,et al. A note on the second-order convergence of optimization algorithms using barrier functions , 1997 .
[13] Philip E. Gill,et al. Practical optimization , 1981 .
[14] N. Gould. An Algorithm for Large-Scale Quadratic Programming , 1991 .
[15] Nicholas I. M. Gould,et al. On practical conditions for the existence and uniqueness of solutions to the general equality quadratic programming problem , 1985, Math. Program..
[16] Anders Forsgren,et al. Primal-Dual Interior Methods for Nonconvex Nonlinear Programming , 1998, SIAM J. Optim..