References
- Boggs , PT and Tolle , JW . 1995 . “ Sequential Quadratic Programming ” . In Acta Numerica , Cambridge , , UK : Cambridge University Press .
- Cawood , ME and Kostreva , MM . 1994 . Norm-relaxed method of feasible direction for solving the nonlinear programming problems . J. Optim. Theory Appl. , 83 : 311 – 320 .
- Fukushima , M , Lou , ZQ and Paul , T . 2003 . A sequential quadratically constrained quadratic programming method for differentiable convex minimization . SIAM J. Optim. , 13 : 1098 – 1119 .
- Hock , W and Schittkowski , K . 1981 . Test Examples for Nonlinear Programming Codes, Lecture Notes in Economics and Mathematical Systems , Vol. 187 , Berlin : Springer .
- Jian , JB . 2006 . New sequential quadratically constrained quadratic programming method of feasible directions and its convergence rate . J. Optim. Theory Appl. , 129 : 109 – 130 .
- Jian , JB . 2010 . Fast Algorithms for Smooth Constrained Optimization and Theoretical Analysis and Numerical Experiments , Beijing : Science Press .
- Jian , JB , Hu , QJ , Tang , CM and Zheng , HY . 2007 . A sequential quadratically programming method of feasible directions . Appl. Math. Optim. , 56 : 343 – 363 .
- Jian , JB , Ke , XY , Zheng , HY and Tang , CM . 2009 . A method combing norm-relaxed QP subproblems with systems of linear equations for constrained optimization . J. Comput. Appl. Math. , 223 : 1013 – 1027 .
- Jian , JB , Tang , CM and Zheng , HY . 2010 . Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions . Eur. J. Oper. Res. , 200 : 645 – 657 .
- Jian , JB , Zheng , HY , Hu , QJ and Tang , CM . 2005 . A new norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization . Appl. Math. Comput. , 168 : 1 – 28 .
- Jin , Z and Wang , YQ . 2010 . A type of efficient feasible SQP algorithms for inequality constrained optimization . Appl. Math. Comput. , 215 : 3589 – 3598 .
- Korycki , JA and Kostreva , MM . 1996 . Convergence analysis of norm-relaxed method of feasible directions . J. Optim. Theory Appl. , 91 : 389 – 418 .
- Kostreva , MM and Chen , X . 2000 . A superlinearly convergent method of feasible directions . Appl. Math. Comput. , 116 : 245 – 255 .
- Lawarence , CT and Tits , AL . 2001 . A computationally efficient feasible sequential quadratic programming algorithm . SIAM J. Optim. , 11 : 1092 – 1118 .
- Maratos , N . 1978 . “ Exact penalty function algorithms for finite dimensional and control optimization problems ” . In Ph.D. Thesis , Imperial College Sci. Tech., University of London .
- Mayne , DQ and Polak , E . 1995 . A superlinearly convergent algorithm for constrained optimization problems . Math. Progr. Study , 16 : 45 – 61 .
- Pironneau , O and Polak , E . 1973 . Rate of convergence of a class of methods of feasible directions . Numer. Anal. , 10 : 161 – 173 .
- Schittkowski , K . 1987 . More Test Examples for Nonlinear Programming Codes, Lecture Notes in Economics and Mathematical Systems , Vol. 282 , Berlin : Springer .
- Solodov , MV . 2004 . On the sequential quadratically constrained quadratic programming method . Math. Oper. Res. , 20 : 64 – 79 .
- Tang , CM and Jian , JB . 2008 . A sequential quadratically constrained quadratic programming method with an augmented Lagrangian line search function . J. Comput. Appl. Math. , 220 : 525 – 547 .
- The , MOSEK . optimization toolbox for MATLAB manual, Version 5.0 (Revision 79)