On the sequential quadratically constrained quadratic programming methods

Mathematics of Operations Research

Volumn 29, Issue 1, 2004, Pages 64-79

  Solodov, M V ^a  

^a IMPA   (Brazil)

Author keywords

Maratos effect; Nonsmooth penalty function; Quadratically constrained quadratic programming

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; CONVERGENCE OF NUMERICAL METHODS; DIFFERENTIATION (CALCULUS); ITERATIVE METHODS; LAGRANGE MULTIPLIERS; MATRIX ALGEBRA; PROBLEM SOLVING; THEOREM PROVING;

CONVEX MINIMIZATION; MARATOS EFFECT; NONSMOOTH PENALTY FUNCTION; SEQUENTIAL QUADRATICALLY CONSTRAINED QUADRATIC PROGRAMMING METHOD;

QUADRATIC PROGRAMMING;

EID: 4043068448     PISSN: 0364765X     EISSN: None     Source Type: Journal    
DOI: 10.1287/moor.1030.0069     Document Type: Article

References (20)

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