A feasible descent SQP algorithm for general constrained optimization without strict complementarity
暂无分享,去创建一个
[1] A. Tits,et al. Nonlinear Equality Constraints in Feasible Sequential Quadratic Programming , 1996 .
[2] Klaus Schittkowski,et al. Test examples for nonlinear programming codes , 1980 .
[3] Elijah Polak,et al. Computational methods in optimization , 1971 .
[4] N. Maratos,et al. Exact penalty function algorithms for finite dimensional and control optimization problems , 1978 .
[5] Paul T. Boggs,et al. Sequential Quadratic Programming , 1995, Acta Numerica.
[6] Zengxin Wei,et al. On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods , 1999, SIAM J. Optim..
[7] Hanif D. Sherali,et al. Methods of Feasible Directions , 2005 .
[8] Lamberto Cesari,et al. Optimization-Theory And Applications , 1983 .
[9] J. Frédéric Bonnans,et al. Sequential Quadratic Programming with Penalization of the Displacement , 1995, SIAM J. Optim..
[10] D. Mayne,et al. Exact penalty function algorithm with simple updating of the penalty parameter , 1991 .
[11] M. Sahba. Globally convergent algorithm for nonlinearly constrained optimization problems , 1987 .
[12] José Herskovits,et al. A two-stage feasible directions algorithm for nonlinear constrained optimization , 1981, Math. Program..
[13] André L. Tits,et al. On combining feasibility, descent and superlinear convergence in inequality constrained optimization , 1993, Math. Program..
[14] E. Panier,et al. A superlinearly convergent feasible method for the solution of inequality constrained optimization problems , 1987 .
[15] Craig T. Lawrence,et al. A Computationally Efficient Feasible Sequential Quadratic Programming Algorithm , 2000, SIAM J. Optim..
[16] J. Jinbao,et al. A superlinearly and quadratically convergent SQP type feasible method for constrained optimization , 2000 .
[17] J. F. Bonnans,et al. Avoiding the Maratos effect by means of a nonmonotone line search II. Inequality constrained problems—feasible iterates , 1992 .
[18] Shih-Ping Han. A globally convergent method for nonlinear programming , 1975 .
[19] Francisco Facchinei,et al. Robust Recursive Quadratic Programming Algorithm Model with Global and Superlinear Convergence Properties , 1997 .
[20] M. J. D. Powell,et al. A fast algorithm for nonlinearly constrained optimization calculations , 1978 .
[21] Jianjinbao,et al. A SUPERLINEARLY AND QUADRATICALLY CONVERGENT SQP TYPE FEASIBLE METHOD FOR CONSTRAINED OPTIMIZATION , 2000 .
[22] R. M. Chamberlain,et al. Some examples of cycling in variable metric methods for constrained minimization , 1979, Math. Program..
[23] G. Zoutendijk,et al. Methods of Feasible Directions , 1962, The Mathematical Gazette.
[24] E. Panier,et al. A QP-Free, globally convergent, locally superlinearly convergent algorithm for inequality constrained optimization , 1988 .
[25] C. Lemaréchal,et al. The watchdog technique for forcing convergence in algorithms for constrained optimization , 1982 .
[26] David Q. Mayne,et al. Feasible directions algorithms for optimization problems with equality and inequality constraints , 1976, Math. Program..
[27] D. Mayne,et al. A surperlinearly convergent algorithm for constrained optimization problems , 1982 .
[28] A. Tits,et al. Avoiding the Maratos effect by means of a nonmonotone line search I. general constrained problems , 1991 .
[29] Ya-Xiang Yuan,et al. A Robust Algorithm for Optimization with General Equality and Inequality Constraints , 2000, SIAM J. Sci. Comput..