On the Sequential Quadratically Constrained Quadratic Programming Methods

References

• Anitescu M. On the rate of convergence of sequential quadratic programming with nondifferentiable exact penalty function in the presence of constraint degeneracy. Math. Programming (2002a) 92:359–386Crossref, Google Scholar
• Anitescu M. A superlinearly convergent sequential quadratically constrained quadratic programming algorithm for degenerate nonlinear programming. SIAM J. Optim. (2002b) 12:949–978Crossref, Google Scholar
• Bertsekas D. P.Nonlinear Programming (1995) (Athena Scientific, Belmont, MA) Google Scholar
• Boggs B. T., Tolle J. W. Sequential quadratic programming. Acta Numerica (1996) 4:1–51Crossref, Google Scholar
• Bonnans J. F. Asymptotic admissibility of the unit stepsize in exact penalty methods. SIAM J. Control Optim. (1989) 27:631–641Crossref, Google Scholar
• Bonnans J. F., Gilbert J. Ch., Lemaréchal C., Sagastizábal C.Numerical Optimization: Theoretical and Practical Aspects (2003) (Springer-Verlag, Berlin, Germany) Crossref, Google Scholar
• Fukushima M. A successive quadratic programming algorithm with global and superlinear convergence properties. Math. Programming (1986) 35:253–264Crossref, Google Scholar
• Fukushima M., Luo Z-Q., Tseng P. A sequential quadratically constrained quadratic programming method for differentiable convex minimization. SIAM J. Optim. (2003) 13:1098–1119Crossref, Google Scholar
• Kruk S., Wolkowicz H., Wolkowicz H., Saigal R., Vandenberghe L. Sequential, quadratically constrained, quadratic programming for general nonlinear programming. Handbook of Semidefinite Programming (2000) (Kluwer Academic Publishers, Boston, MA) 563–575Crossref, Google Scholar
• Lobo M. S., Vandenberghe L., Boyd S., Lebret H. Applications of second-order cone programming. Linear Algebra and Its Appl. (1998) 284:193–228Crossref, Google Scholar
• Mangasarian O. L.Nonlinear Programming (1969) (McGraw-Hill, New York) Google Scholar
• Maratos N. Exact penalty function algorithms for finite dimensional and control optimization problems. (1978) . Ph.D. thesis, Imperial College, University of London, London, U.K.Google Scholar
• Mayne D. Q., Polak E. A superlinearly convergent algorithm for constrained optimization problems. Math. Programming Stud. (1982) 16:45–61Crossref, Google Scholar
• Monteiro R. D. C., Tsuchiya T. Polynomial convergence of primal-dual algorithms for the second-order cone programs based on the MZ-family of directions. Math. Programming (2000) 88:61–83Crossref, Google Scholar
• Nesterov Y. E., Nemirovskii A. S.Interior Point Polynomial Methods in Convex Programming: Theory and Applications (1993) (SIAM Publications, Philadelphia, PA) Google Scholar
• Panin V. M. A second-order method for discrete min-max problem. USSR Comput. Math. and Math. Phys. (1979) 19:90–100Crossref, Google Scholar
• Panin V. M. Some methods of solving convex programming problems. USSR Comput. Math. and Math. Phys. (1981) 21:57–72Crossref, Google Scholar
• Powell M. J. D., Bachem A., Grötschel M., Korte B. Variable metric methods for constrained optimization. Mathematical Programming: The State of Art (1983) (Springer-Verlag, Berlin, Germany) 288–311Crossref, Google Scholar
• Tsuchiya T. A convergence analysis of the scale-invariant primal-dual path-following algorithms for second-order cone programming. Optim. Methods Software (1999) 11:141–182Crossref, Google Scholar
• Wiest E. J., Polak E. A generalized quadratic programming-based phase-I-phase-II method for inequality-constrained optimization. Appl. Math. Optim. (1992) 26:223–252Crossref, Google Scholar