Abstract
This paper presents a quadratically approximate algorithm framework (QAAF) for solving general constrained optimization problems, which solves, at each iteration, a subproblem with quadratic objective function and quadratic equality together with inequality constraints. The global convergence of the algorithm framework is presented under the Mangasarian-Fromovitz constraint qualification (MFCQ), and the conditions for superlinear and quadratic convergence of the algorithm framework are given under the MFCQ, the constant rank constraint qualification (CRCQ) as well as the strong second-order sufficiency conditions (SSOSC). As an incidental result, the definition of an approximate KKT point is brought forward, and the global convergence of a sequence of approximate KKT points is analysed.
Similar content being viewed by others
References
Wilson, R. B.: A simplical algorithm for concave programming, Ph.D. Thesis, Graduate School of Business Administration, Harvard University, 1963
Han, S. P.: A globally convergent method for nonlinear programming. Journal of Optimization Theory and Applications, 22, 297–309 (1977)
Powell, M. J. D.: A fast algorithm for nonlinearly constrained optimization caculations, In: Watson G. A. ed., Numerical Analysis, Springer-Verlag, Berlin, pp. 144–157, 1978
Fukushima, M.: A successive quadratic programming algorithm for constrained optimization problems. Mathematical Programming, 35, 253–264 (1986)
Jian, J. B.: Researches on superlinearly and quadratically convergent algorithms for nonlinearly constrained optimization, Ph.D. Thesis, School of Xi’an Jiaotong University, Xi’an, China, 2000
Jian, J. B.: Two extension models of SQP and SSLE algorithms for optimization and their superlinear and quadratical convergence. Applied Mathematics—A Journal of Chinese Universities, Ser. A, 16, 435–444 (2001)
Jian, J. B.: A superlinearly and quadratically convergent SQP algorithm for inequality constrained optimization. Acta Mathematica Scientia, Ser. A, 21, 268–277 (2001)
Jian, J. B.: A feasible trust region algorithm with fast convergence for nonlinear inequality constrained optimization. Mathematica Numerical Sinica, 24, 273–282 (2002)
Maratos, N.: Exact penalty function algorithm for finite dimensional and control optimization problems, Ph.D. thesis, Imperial College Science, Technology, University of London, 1978
Panier, E. R., Tits, A. L.: A superlinearly convergent feasible method for the solution of inequality constrained optimization problems. SIAM Journal on Control and Optimization, 25, 934–950 (1987)
Panier, E. R., Tits, A. L.: On combining feasibility, descent and superlinear convergence in inequality constrained optimization. Mathematical Programming, 59, 261–276 (1993)
Panier, E. R., Tits, A. L., Herskovits, J. N.: A QP-free, globally convergent, locally superlinearly convergent algorithm for inequality constrained optimization. SIAM J. Control and Optimization, 26, 788–811 (1988)
Gao, Z. Y.: A superlinearly convergent feasible method for nonlinear programming with nonlinear inequality constraints part I. Journal of Northern Jiaotong University, 20, 50–60 (1996)
Jian, J. B.: A modified algorithm of SQP type, Journal of Mathematical Research and Exposition. 15, 57–64 (1995) (suup)
Gao, Z. Y., Wu, F.: An SQP feasible method for nonlinear constraints. Acta Mathematicae Applicatae Sinica, 18, 579–590 (1995)
Kruk, S., Wolkowicz, H.: SQ2P, Sequential quadratic constrained quadratic programming, in Advances in Nonlinear Programming, Yuan, Y.X., Kluwer Academic Publishers, Dordrecht, pp. 177–204, 1998
Fukushima, M., Luo, Z. Q., Tseng, P.: A sequential quadratically constrained quadratic programming method for differentiable convex minimization. SIAM Journal on Optimization, 13, 1098–1119 (2003)
Anitescu, M.: A Superlinearly convergent sequential quadratically constrained quadratic programming algorithm for degenerate nonlinear programming. SIAM Journal on Optimization, 12, 949–978 (2002)
Solodov, M. V.: On the sequential quadratically constrained quadratic programming methods. Mathematics of Operations Research, 29, 64–79 (2004)
Fernández, D., Solodov, M.: On local convergence of the sequential quadratically constrained quadratic programming type methods, to appear in Computational Optimization and Applications
Jian, J. B.: New sequential quadratically constrained quadratic programming norm-relaxed method of feasible directions. Journal of Optimization Theory and Applications, to appear
Jian, J. B., Tang, C. M., Zheng, H. Y.: Sequential Quadratically Constrained Quadratic Programming Norm-Relaxed Algorithm of Strongly Sub-Feasible Directions, manuscript
Lobo, M. S., Vandenberghe, L., Boyd, S.: SOCP: Software for second-order cone programming, user’s guide (Beta version), April, 1997
Lobo, M. S., Vandenberghe, L., Boyd, S., Lebret, H. Applications of second-order cone programming. Linear Algebra and Its Appl., 284, 193–228 (1998)
Audet, C., Hansen, P., Jaumard, B., Savard, G.: A branch and cut algorithm for nonconvex quadratically constrained quadratic programming. Mathematical Programming, Ser. A 87, 131–152 (2000)
Cawood, M. E., Kostreva, M. M.: Norm-relaxed method of feasible directions for solving nonlinear programming problems. Journal of Optimization Theory and Applications, 83, 311–320 (1994)
Fletcher, R., Leyffer, S.: Nonlinear programming without a penalty function. Mathematical Programming, 91, 239–270 (2002)
Gill, P. E., Murray, W., Saunders, M. A.: User’s guide for SNOPT 5.3: A Fortran Package for Large-Scale Nonlinear Programming, Report NA 97-5, Department of Mathematics, University of California, San Diego, CA, 1997
Mangasarian, O. L., Fromovitz, S.: The Fritz John necessary Optimality conditions in the presence of equality and inequality constraints. Journal of Mathematical Analysis and Applications, 17, 37–47 (1967)
Janin, R.: Directional derivative of the marginal function in nonlinear programming. Mathematical Programming Study, 21, 110–126 (1984)
Polak, E., Qi, L.: A globally and superlinearly convergent scheme for minimizing a normal merit function. SIAM Journal on Control and Optimization, 36, 1005–1019 (1998)
Yuan, Y. X., Sun, W. Y.: Optimization Theory and Methods, Science Press, Beijing, 1997
Author information
Authors and Affiliations
Corresponding author
Additional information
Projects supported by NSFC (Nos. 10261001, 10771040) and Guangxi Province Science Foundation (No. 0640001)
Rights and permissions
About this article
Cite this article
Jian, J.B. A quadratically approximate framework for constrained optimization, global and local convergence. Acta. Math. Sin.-English Ser. 24, 771–788 (2008). https://doi.org/10.1007/s10114-007-4465-0
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10114-007-4465-0
Keywords
- constrained optimization
- quadratic approximation
- algorithm framework
- quadratic constraints
- global and local convergence