Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems

Journal of Global Optimization

Volumn 49, Issue 1, 2011, Pages 1-14

  Jeyakumar, V ^a   Li, Guoyin ^a  

^a UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

Alternative theorems; Linear equality constraints; Quadratic constraints; Quadratic nonconvex optimization; Regularized Lagrangian; Strong duality; Trust region problems

Indexed keywords

ALTERNATIVE THEOREM; LAGRANGIAN; LINEAR EQUALITY CONSTRAINTS; NONCONVEX OPTIMIZATION; QUADRATIC CONSTRAINT; STRONG DUALITY; TRUST REGION;

CONSTRAINED OPTIMIZATION;

LAGRANGE MULTIPLIERS;

EID: 78650749541     PISSN: 09255001     EISSN: 15732916     Source Type: Journal    
DOI: 10.1007/s10898-009-9518-8     Document Type: Article

References (30)

1. W.B. Ai S.Z. Zhang 2009 Strong duality for the CDT subproblem: a necessary and sufficient sondition SIAM J. Optim. 19 1735 1756 10.1137/07070601X
2. A. Beck Y.C. Eldar 2006 Strong duality in nonconvex quadratic optimization with two quadratic constraints SIAM J. Optim. 17 844 860 10.1137/050644471 (Pubitemid 47265175)
3. Ben-Tal A., Nemirovski A.: Lectures on Modern Convex Optimization: Analysis, Algorithms and Engineering Applications. SIAM-MPS, Philadelphia (2000)
4. Boyd S., Vandenberghe L.: Convex Optimization. Cambridge University Press, Cambridge (2004)
5. Celis M.R., Dennis J.E., Tapia R.A.: A trust region strategy for nonlinear equality constrained optimization. In: Boggs, P.T., Byrd, R.H., Schnabel, R.B. (eds) Numerical Optimization, pp. 71-82. SIAM, Philadelphia (1985)
6. Y. Chabrillac J.-P. Crouzeix 1984 Definiteness and semidefiniteness of quadratic forms revisited Linear Algebra Appl. 63 283 294 10.1016/0024-3795(84) 90150-2
7. X.D. Chen Y.X. Yuan 2000 On local solutions of the Celis-Dennis-Tapia subproblem SIAM J. Optim. 10 359 383 10.1137/S1052623498335018
8. T.F. Coleman J. Liu W. Yuan 2002 A new trust-region algorithm for equality constrained optimization Comp. Optim. Appl. 21 2 177 199 10.1023/A:1013764800871 (Pubitemid 34168105)
9. L.L. Dines 1941 On the mapping of quadratic forms Bull. Am. Math. Soc. 47 494 498 10.1090/S0002-9904-1941-07494-X
10. A. Faye F. Roupin 2007 Partial Lagrangian relaxation for general quadratic programming 4OR Q. J. Oper. Res. 5 75 88 10.1007/s10288-006-0011-7
11. C. Fortin H. Wolkowicz 2004 The trust region subproblem and semidefinite programming Optim. Methods Softw. 19 41 67 10.1080/10556780410001647186
12. Hiriart-Urruty J.B., Lemaréchal C.: Convex Analysis and Minimization Algorithms, vol. I. Springer, Berlin (1993)
13. V. Jeyakumar 2008 Constraint qualifications characterizing Lagrangian duality in convex optimization J. Optim. Theory Appl. 136 31 41 10.1007/s10957-007-9294-x
14. V. Jeyakumar N.Q. Huy G. Li 2009 Necessary and sufficient conditions for S-lemma and nonconvex optimization Optim. Eng. 10 4 491 503 10.1007/s11081-008- 9076-9
15. V. Jeyakumar G.M. Lee G. Li 2009 Alternative theorems for quadratic inequality systems and global quadratic optimization SIAM J. Optim. 20 2 983 1001 10.1137/080736090
16. Jeyakumar V., Luc D.T.: Nonsmooth vector functions and continuous optimization. In: Pardalos, P.M. (eds) Springer Optimization and Its Applications, vol. 10, Springer, New York (2008)
17. V. Jeyakumar A.M. Rubinov Z.Y. Wu 2007 Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions Math. Program. Ser. A 110 521 541 10.1007/s10107-006-0012-5 (Pubitemid 46862319)
18. V. Jeyakumar S. Srisatkunarajah N.Q. Huy 2007 Kuhn-Tucker sufficiency for global minimum of multi-extremal mathematical programming problems J. Math. Anal. Appl. 335 779 788 10.1016/j.jmaa.2007.02.013
19. Lemarechal, C., Oustry, F.: SDP relaxations in combinatorial optimization from a Lagrangian viewpoint, in advances in convex analysis and global optimization (Pythagorion, 2000). Nonconvex Optim. Appl., vol. 54, pp. 119-134. Kluwer, Dordrecht (2001)
20. Nesterov Y., Wolkowicz H., Ye Y.Y.: Semidefinite programming relaxations of nonconvex quadratic optimization. In: Wolkowicz, H., Saigal, R., Vandenberghe, L. (eds) Handbook of Semidefinite Programming, pp. 361-419. Kluwer, Boston (2000)
21. P.M. Pardalos W. Chaovalitwongse L.D. Iasemidis J.C. Sackellares D.-S. Shiau P. Carney O. Prokopyev V. Yatsenko 2004 Seizure warning algorithm based on optimization and nonlinear dynamics Math. Program. 101 2, Ser. B 365 385 10.1007/s10107-004-0529-4
22. P.M. Pardalos O. Prokopyev W. Chaovalitwongse 2004 A new linearization technique for multi-quadratic 0-1 programming problems Oper. Res. Lett. 32 6 517 522 10.1016/j.orl.2004.03.005
23. Pardalos P., Romeijn H.: Handbook in Global Optimization, vol. 2. Kluwer, Dordrecht (2002)
24. J.M. Peng Y.X. Yuan 1997 Optimality conditions for the minimization of a quadratic with two quadratic constraints SIAM J. Optim. 7 579 594 10.1137/S1052623494261520
25. I. Polik T. Terlaky 2007 A survey of S-lemma SIAM Rev. 49 371 418 10.1137/S003614450444614X (Pubitemid 47377690)
26. M.J.D. Powell Y. Yuan 1991 A trust region algorithm for equality constrained optimization Math. Program. 49 189 211 10.1007/BF01588787
27. R.J. Stern H. Wolkowicz 1995 Indefinite trust region subproblems and nonsymmetric eigenvalue perturbations SIAM J. Optim. 5 286 313 10.1137/0805016
28. W.Y. Sun Y.X. Yuan 2001 A conic trust-region method for nonlinearly constrained optimization Ann. Oper. Res. 103 175 191 10.1023/A:1012955122229 (Pubitemid 33634407)
29. Y. Ye S.Z. Zhang 2003 New results of quadratic minimization SIAM J. Optim. 14 245 267 10.1137/S105262340139001X
30. Y.X. Yuan 1990 On a subproblem of trust region algorithms for constrained optimization Math. Program. 47 53 63 10.1007/BF01580852