Quadratically constraint quadratical algorithm model for nonlinear minimax problems

Applied Mathematics and Computation

Volumn 205, Issue 1, 2008, Pages 247-262

  Chao, Mian Tao ^a,b   Wang, Zhong Xing ^a   Liang, Yu Mei ^c   Hu, Qing Jie ^d  

^a GUANGXI UNIVERSITY   (China)

^b Guangxi College of Education   (China)

^c SHANGHAI LIXIN UNIVERSITY OF ACCOUNTING AND FINANCE   (China)

^d HUNAN UNIVERSITY OF COMMERCE   (China)

Author keywords

Convergence rate; General constraints; Global convergence; Minimax programs; Quadratically approximate algorithm

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; MATHEMATICAL MODELS; NONLINEAR PROGRAMMING;

CONVERGENCE RATE; GENERAL CONSTRAINTS; GLOBAL CONVERGENCE; MINIMAX PROGRAMS; QUADRATICALLY APPROXIMATE ALGORITHM;

QUADRATIC PROGRAMMING;

EID: 54049114573     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.amc.2008.08.033     Document Type: Review

References (39)

1. S.P. Han, Superlinear convergence of a minimax method, Report TR-78-336, Department of Computer Science, Cornell University, Ithaca, New York, 1978.
2. Murray A.W., and Overton M.L. A projected lagrangian algorithm for nonlinear minimax optimization. SIAM Journal on Science and Statistical Computing 1 (1980) 345-370
3. Zhou J.L., and Tits A.L. Nonmonotone line search for minimax problems. Journal of Optimization Theory and Applications 76 (1993) 455-476
4. Rustem B. A constrained minimax algorithm for rival models of the same economic system. Mathematical Programming 53 (1992) 279-295
5. Rustem B., and Nguyen Q. An algorithm for the inequality-constrained discrete minimax problem. SIAM Journal on Optimization 8 (1998) 265-283
6. Yu Y.-H., and Gao L. Nonmonotone line search algorithm for constrained minimax problems. Journal of Optimization Theory and Applications 115 2 (2002) 419-446
7. Jian J.-B., Quan R., and Zhang X.-L. Feasible generalized monotone line search SQP algorithm for nonlinear minimax problems with inequality constraints. Journal of Computational and Applied Mathematics 205 1 (2006) 406-429
8. Jian J.-B., Quan R., and Zhang X.-L. Generalized monotone line search algorithm for degenerate nonlinear minimax problems. Bulletin of the Australian Mathematical Society 73 (2006) 117-127
9. Jian J.-B., Quan R., and Hu Q.-J. A new superlinearly convergent SQP algorithm for nonlinear minimax problems. Acta Mathematicae Applicatae Sinica, English Series 23 3 (2007) 395-410
10. Cawood M.E., and Kostreva M.M. Norm-relaxed method of feasible direction for solving the nonlinear programming problems. Journal of Optimization Theory and Applications 83 (1994) 311-329
11. Jian J.-B. Two extension models of SQP and SSLE algorithms for optimization and their superlinear and quadrtical convergence. Applied Mathematics: A Journal of Chinese Universities, Series A 16 4 (2001) 435-444
12. J.-B. Jian, Researches on superlinearly and quadratically convergent algorithms for nonlinearly constrained optimization, Ph.D. Thesis, School of Xi'an Jiaotong University, Xi'an, China, 2000.
13. Jian J.-B. A new feasible descent algorithm combining SQP with generalized projection for optimization problems without strict complementarity. Applied Mathematical and Computation 162 (2005) 1065-1081
14. Jian J.-B., and Tang C.-M. An SQP feasible descent algorithm for nonlinear inequality constrained optimization without strict complementarity. Computers and Mathematics with Applications 49 (2005) 223-238
15. Jian J.-B. A superlinearly convergent implicit smooth SQP algorithm for mathematical problems with nonlinear complementarity constraints. Computational Optimization and Applications 31 (2005) 335-361
16. Jian J.-B., Tang C.-M., Zheng H.-Y., and Hu Q.-J. A feasible descent SQP algorithm for general constrained optimization without strict complementarity. Journal of Computational and Applied Mathematics 180 (2005) 391-412
17. Jian J.-B., Zheng H.-Y., Hu Q.-J., and Tang C.-M. A new norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization. Applied Mathematics and Computation 168 (2005) 1-28
18. Jian J.-B., Zheng H.-Y., Tang C.-M., and Hu Q.-J. A new superlinearly convergent norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization. Applied Mathematics and Computation 182 (2006) 955-976
19. Jian J.-B., Tang Ch.-M., Hu Q.-J., and Zheng H.-Y. A new superlinearly convergent strongly subfeasible sequential quadratic programming algorithm for inequality-constrained optimization. Numerical Functional Analysis and Optimization 29 3 (2008) 376-409
20. Jian J.-B., Ke X.-Y., Zheng H.-Y., and Tang Ch.-M. A method combining norm-relaxed QP subproblems with systems of linear equations for constrained optimization. Journal of Computational and Applied Mathematics (2008) 10.1016/j.cam.2008.03.048
21. Panin V.M. A second-order method for the discrete min-max problem. USSR Computational Mathematics and Mathematical Physics 19 1 (1979) 90-100
22. Polak E., Mayne D.Q., and Higgins J.E. On extension of Newton's method to semiinfinite minmax problems. SIAM Journal on Control and Optimization 30 (1992) 367-389
23. Wiest E.J., and Polak E. A generalized quadratic programming-based phase-I-phase-II method for inequality-constrained optimization. Applied Mathematics and Optimization 26 (1992) 223-252
24. Kruk S., and Wolkowicz H. SQ2P, sequential quadratic constrained quadratic programming. In: Yuan Y.X. (Ed). Advances in Nonlinear Programming (1998), Kluwer Academic Publishers, Dordrecht 177-204
25. Kruk S., and Wolkowicz H. Sequential, quadratic constrained quadratic programming for general nonlinear programming. In: Wolkowicz H., Saigal R., and Vandenberghe L. (Eds). Handbook of Semidefinite Programming (2000), Kluwer Academic Publishers, Boston, MA 563-575
26. Fukushima M., Luo Z.Q., and Paul T. A sequential quadratically constrained quadratic programming methods for differentiable convex minimization. SIAM Journal on Optimization 13 4 (2003) 1098-1119
27. Jian J.-B. New sequential quadratically constrained quadratic programming method of feasible directions and its convergence rate. Journal of Optimization Theory and Applications 129 1 (2006) 193-228
28. J.-B. Jian, C.-M. Tang, H.-Y. Zheng, Sequential quadratically constrained quadratic programming norm-relaxed methods of strongly sub-feasible directions, Manuscript, 2007.
29. Jian J.-B., Hu Q.-J., Tang Ch.-M., and Zheng H.-Y. A sequential quadratically constrained quadratic programming method of feasible directions. Applied Mathematics and Optimization 56 (2007) 343-363
30. Jian J.-B. A quadratically approximate framework for constrained optimization, global and local convergence. Acta Mathematica Sinica, English Series 24 5 (2008) 771-788
31. Nesterov Y.E., and Nemirovskii A.S. Interior Point Polynomial Methods in Convex Programming: Theory and Applications (1993), SIAM, Philadelphia, PA
32. Lobo M.S., Vandenberghe L., Boyd S., and Lebret H. Applications of second-order cone programming. Linear Algebra and its Applications 284 (1998) 193-228
33. Monteiro 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 88 (2000) 61-83
34. Jian J.-B. The search of sub-feasible and strong sub-feasible method. In: Yue M.-Y. (Ed). The Theory of Optimation and Application (1994), Xidian University Press, Xian 113-118
35. Jian J.B., Xu Q.J., and Han D.L. A strongly convergent norm-relaxed method of strongly sub-feasible direction for optimization with nonlinear equality and inequality constraints. Applied Mathematics and Computation 182 (2006) 854-870
36. Jian J.-B., Zeng Y.-F., and Tang Ch.-M. A generalized super-memory gradient projection method of strongly sub-feasible directions with strong convergence for nonlinear inequality constrained optimization. Computers and Mathematics with Applications 54 (2007) 507-524
37. Janin R. Direction derivation of the marginal function in nonlinear programming. Mathematical Programming Study 21 (1984) 127-138
38. Polak E., and Qi L. A globally and superlinearly convergent scheme for minimizing a normal merit function. SIAM Journal on Control and Optimization 36 (1998) 1005-1019
39. Yuan Y.-X., and Sun W.-Y. Optimization Theory and Methods (1997), Science Press, Beijing