New sequential quadratically-constrained quadratic programming method of feasible directions and its convergence rate

Journal of Optimization Theory and Applications

Volumn 129, Issue 1, 2006, Pages 109-130

  Jian, J B ^a  

^a GUANGXI UNIVERSITY   (China)

Author keywords

Convergence rate; Inequality constraints; Optimization; Quadratic constraints; Quadratic programming

Indexed keywords

CONSTRAINED OPTIMIZATION; ITERATIVE METHODS;

CONVERGENCE RATES; INEQUALITY CONSTRAINT; METHOD OF FEASIBLE DIRECTION; NONLINEAR INEQUALITY CONSTRAINTS; OPTIMISATIONS; OPTIMIZATION PROBLEMS; QUADRATIC CONSTRAINT; QUADRATIC PROGRAMMING METHOD; SEQUENTIAL QUADRATICALLY CONSTRAINED QUADRATIC PROGRAMMING; SUB-PROBLEMS;

QUADRATIC PROGRAMMING;

EID: 33845442391     PISSN: 00223239     EISSN: 15732878     Source Type: Journal    
DOI: 10.1007/s10957-006-9042-7     Document Type: Article

References (22)

1. WILSON, R. B., A Simplicial Algorithm for Concave Programming, PhD Thesis, Graduate School of Business Administration, Harvard University, 1963.
2. MARATOS, N., Exact Penalty Function Algorithms for Finite-Dimensional and Control Optimization Problems, PhD Thesis, Imperial College of Science and Technology, University of London, 1978.
3. MAYNE, D. Q., and POLAR, E., A Superlinearly Convergent Algorithm for Constrained Optimization Problems, Mathematical Programming Study, Vol. 16, pp. 45-61, 1982.
4. FUKUSHIMA, M., A Successive Quadratic Programming Algorithm for Constraint Optimization Problems, Mathematical Programming, Vol. 35, pp. 253-264, 1986.
5. XU, X., and WANG, W., A Mixed Superlinearly Convergent Algorithm with Nonmonotone Search for Constrained Optimizations, Applied Mathematics: A Journal of Chinese Universities, Vol. 15B, pp. 211-219, 2000.
6. PANIER, E. R., and TITS, A.L., A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems, SIAM Journal on Control and Optimization, Vol. 25, pp. 934-950, 1987.
7. GAO, Z. Y., and WU, F., A Superlinearly Feasible Method for Nonlinear Constraints, Acta Mathematica Sinica, Vol. 40A, pp. 895-900, 1997.
8. JIAN, J. B., and XUE, S.J., A Class of Superlinearly Convergent Feasible Methods for Nonlinear Constraint Optimization, Journal of Mathematical Research and Exposition, Vol. 19, pp. 135-140, 1999.
9. JIAN, J. B., ZHANG, K.C., and XUE, S.J., A Superlinearly and Quadratic ally Convergent SQP Type Feasible Method for Constrained Optimization, Applied Mathematics: A Journal of Chinese Universities, Vol. 15B, pp. 319-331, 2000.
10. KRUK, S., and WOLKOWICZ, H., Sequential Quadratic Constrained Quadratic Programming for General Nonlinear Programming, Handbook of Semidefmite Programming, Edited by H. Wolkowicz, R. Saigal, and L. Vandenberghe, Kluwer Academic Publishers, Boston, Massachusetts, pp. 563-575, 2000.
11. WIEST, E. J., and POLAK, E., A Generalized Quadratic Programming-Based Phase-I-Phase-II Method for Inequality Constrained Optimization, Applied Mathematics and Optimization, Vol. 26, pp. 223-252, 1992.
12. FUKUSHIMA, M., LUO, Z.Q., and PAUL, T., A Sequential Quadratically Constrained Quadratic Programming Method for Differentiable Convex Minimization, SIAM Journal on Optimization, Vol. 13, No. 4, pp. 1089-1119, 2003.
13. ZOUTENDIJK, G., Methods of Feasible Directions, Elsevier, Admsterdam, and D. Van Nostrand, Princeton, N.J., 1960.
14. TOPKIS, D. M., and VEINOTT, A.F., On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming, SIAM Journal on Control, Vol. 5, pp. 268-279, 1967.
15. PIRONNEAU, O., and POLAK, E., Rate of the Convergence of a Class of Methods of Feasible Directions, SIAM Journal on Numerical Analysis, Vol. 10, pp. 161-173, 1973.
16. CAWOOD, M. E., and Kostreva, M.M., Norm-Relaxed Method of Feasible Directions for Solving Nonlinear Programming Problems, Journal of Optimization Theory and Applications, Vol. 83, pp. 311-320, 1994.
17. CHEN, X., and KOSTREVA, M.M., A Generalization of the Norm-Relaxed Method of Feasible Directions, Applied Mathematics and Computation, Vol. 102, pp. 257-273, 1999.
18. KOSTREVA, M. M., and CHEN, X., A Superlinearly Convergent Method of Feasible Directions, Applied Mathematics and Computation, Vol. 116, pp. 231-244, 2000.
19. LAWRENCE, C. T., and TITS, A.L., A Computationally Efficient Feasible Sequential Quadratic Programming Algorithm, SIAM Journal on Optimization, Vol. 11, pp. 1092-1118, 2001.
20. ZU, Z., and ZANG, K.C., A New SQP Method of Feasible Directions for Nonlinear Programming, Applied Mathematics and Computation, Vol. 148, pp. 121-134, 2004.
21. MONTEIOR, R. D. C., and TSUCHYIA, T., Polynomial Convergence of Primal-Dual Algorithms for the Second-Order Cone Programs Based on the MZ-Family of Directions, Mathematical Programming, Vol. 88, pp. 61-83, 2000.
22. JIAN, J. B., Researches on Superlinearly and Quadratically Convergent Algorithms for Nonlinearly Constrained Optimization, PhD Thesis, Xian Jiaotong University, Xian, China, 2000.