On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
暂无分享,去创建一个
[1] M. J. D. Powell,et al. Nonlinear Programming—Sequential Unconstrained Minimization Techniques , 1969 .
[2] C. Lemaréchal,et al. The watchdog technique for forcing convergence in algorithms for constrained optimization , 1982 .
[3] R. Fletcher. Practical Methods of Optimization , 1988 .
[4] P. Toint,et al. Lancelot: A FORTRAN Package for Large-Scale Nonlinear Optimization (Release A) , 1992 .
[5] T. Tsuchiya,et al. On the formulation and theory of the Newton interior-point method for nonlinear programming , 1996 .
[6] Jorge Nocedal,et al. On the Local Behavior of an Interior Point Method for Nonlinear Programming , 1997 .
[7] Hiroshi Yamashita. A globally convergent primal-dual interior point method for constrained optimization , 1998 .
[8] Robert J. Vanderbei,et al. An Interior-Point Algorithm for Nonconvex Nonlinear Programming , 1999, Comput. Optim. Appl..
[9] Jorge Nocedal,et al. An Interior Point Algorithm for Large-Scale Nonlinear Programming , 1999, SIAM J. Optim..
[10] L. Vicente,et al. A Globally Convergent Primal-Dual Interior-Point Filter Method for Nonconvex Nonlinear Programming , 2000 .
[11] Jorge Nocedal,et al. A trust region method based on interior point techniques for nonlinear programming , 2000, Math. Program..
[12] Lorenz T. Biegler,et al. Failure of global convergence for a class of interior point methods for nonlinear programming , 2000, Math. Program..
[13] Nicholas I. M. Gould,et al. A primal-dual trust-region algorithm for non-convex nonlinear programming , 2000, Math. Program..
[14] Nicholas I. M. Gould,et al. Trust Region Methods , 2000, MOS-SIAM Series on Optimization.
[15] Nicholas I. M. Gould,et al. Superlinear Convergence of Primal-Dual Interior Point Algorithms for Nonlinear Programming , 2000, SIAM J. Optim..
[16] D K Smith,et al. Numerical Optimization , 2001, J. Oper. Res. Soc..
[17] Robert J. Vanderbei,et al. Interior-Point Methods for Nonconvex Nonlinear Programming: Filter Methods and Merit Functions , 2002, Comput. Optim. Appl..
[18] Anders Forsgren,et al. Interior Methods for Nonlinear Optimization , 2002, SIAM Rev..
[19] Sven Leyffer,et al. Nonlinear programming without a penalty function , 2002, Math. Program..
[20] Sven Leyffer,et al. On the Global Convergence of a Filter--SQP Algorithm , 2002, SIAM J. Optim..
[21] Jorge J. Moré,et al. Benchmarking optimization software with performance profiles , 2001, Math. Program..
[22] Nicholas I. M. Gould,et al. Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming , 2002, SIAM J. Optim..
[23] Andreas Wächter,et al. A Primal-Dual Interior-Point Method for Nonlinear Programming with Strong Global and Local Convergence Properties , 2003, SIAM J. Optim..
[24] Nicholas I. M. Gould,et al. CUTEr and SifDec: A constrained and unconstrained testing environment, revisited , 2003, TOMS.
[25] Stefan Ulbrich,et al. A globally convergent primal-dual interior-point filter method for nonlinear programming , 2004, Math. Program..
[26] Lorenz T. Biegler,et al. Line Search Filter Methods for Nonlinear Programming: Motivation and Global Convergence , 2005, SIAM J. Optim..
[27] Hiroshi Yamashita,et al. A globally and superlinearly convergent primal-dual interior point trust region method for large scale constrained optimization , 2005, Math. Program..
[28] Jorge Nocedal,et al. An interior algorithm for nonlinear optimization that combines line search and trust region steps , 2006, Math. Program..
[29] Edite M. G. P. Fernandes,et al. On the implementation of an interior-point SQP filter line search algorithm , 2006 .