Multivariate nonnegative quadratic mappings

SIAM Journal on Optimization

Volumn 14, Issue 4, 2004, Pages 1140-1162

  Luo, Zhi Quan ^a   Sturm, Jos F ^c   Zhang, Shuzhong ^b  

^a UNIVERSITY OF MINNESOTA   (United States)

^b CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^c NONE

Author keywords

Biquadratic functions; Convex cone; Linear matrix inequalities; Robust optimization

Indexed keywords

BIQUADRATIC FUNCTIONS; CONVEX CONES; LINEAR MATRIX INEQUALITIES; ROBUST OPTIMIZATION;

FUNCTIONS; LINEAR PROGRAMMING; MAPPING; MATRIX ALGEBRA; OPTIMIZATION; ROBUSTNESS (CONTROL SYSTEMS); SET THEORY;

CONES;

EID: 9944244703     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623403421498     Document Type: Article

References (19)

1. K. M. ANSTREICHER, X. CHEN, H. WOLKOWICZ, AND Y. YUAN, Strong duality for a trustregion type relaxation of the quadratic assignment problem, Linear Algebra Appl., 301 (1999), pp. 121-136.
2. K. ANSTREICHER AND H. WOLKOWICZ, On Lagrangian relaxation of quadratic matrix constraints, SIAM J. Matrix Anal. Appl., 22 (2000), pp. 41-55.
3. A. BEN-TAL, L. EL GHAOUI, AND A. NEMIROVSKII, Robustness, in Handbook of Semidefinite Programming, H. Wolkowicz, R. Saigal, and L. Vandenberghe, eds., Kluwer Academic Publishers, Boston, MA, 2000, pp. 139-162.
4. A. BEN-TAL AND A. NEMIROVSKI, Robust convex optimization, Math. Oper. Res., 23 (1998), pp. 769-805.
5. S. BOYD, L. EL GHAOUI, E. FERON, AND V. BALAKRISHNAN, Linear Matrix Inequalities in System and Control Theory, SIAM Stud. Appl. Math. 15, SIAM, Philadelphia, 1994.
6. T. N. DAVIDSON, Z.-Q. LUO, AND J. STURM, Linear matrix inequality formulation of spectral mask constraints, IEEE Trans. Signal Process., 50 (2002), pp. 2702-2715.
7. Y. GENIN, YU. NESTEROV, AND P. VAN DOOREN, Positive transfer functions and convex optimization, in Proceedings of the 5th European Control Conference (ECC '99), Karlsruhe, 1999, Paper F-143. Also available online at http://nyquist.us.es/conferencias/ECC99/papers/F0143.pdf
8. Y. GENIN, Y. HACHEZ, YU. NESTEROV, AND P. VAN DOOREN, Optimization problems over positive pseudopolynomial matrices, SIAM J. Matrix Anal. Appl., 25 (2003), pp. 57-79.
9. L. EL GHAOUI, F. OUSTRY, AND H. LEBRET, Robust solutions to uncertain semidefinite programs, SIAM J. Optim., 9 (1998), pp. 33-52.
10. L. EL GHAOUI AND H. LEBRET, Robust solutions to least-squares problems with uncertain data, SIAM J. Matrix Anal. Appl., 18 (1997), pp. 1035-1064.
11. M. GRÖTSCHEL, L. LOVÁSZ, AND A. SCHRIJVER, Geometric Algorithms and Combinatorial Optimization, Springer-Verlag, Berlin, New York, 1988.
12. Z.-Q. LUO, Applications of convex optimization in signal processing and digital communication, Math. Program. Ser. B, 97 (2003), pp. 177-207.
13. K. G. MURTY AND S. N. KABADI, Some NP-complete problems in quadratic and nonlinear programming, Math. Program., 39 (1987), pp. 117-129.
14. YU. NESTEROV, Squared functional systems and optimization problems, in High Performance Optimization, H. Frenk, K. Roos, T. Terlaky, and S. Zhang, eds., Kluwer Academic Publishers, Dordrecht, 2000, pp. 405-440.
15. YU. NESTEROV AND A. NEMIROVSKY, Interior-Point Polynomial Methods in Convex Programming, SIAM Stud. Appl. Math. 13, SIAM, Philadelphia, 1994.
16. B. T. POLYAK, Convexity of quadratic transformations and its use in control and optimization, J. Optim. Theory Appl., 99 (1998), pp. 553-583.
17. J. F. STURM AND S. ZHANG, On cones of nonnegative quadratic functions, Math. Oper. Res., 28 (2003), pp. 246-267.
18. H. WOLKOWICZ, A note on lack of strong duality for quadratic problems with orthogonal constraints, European J. Oper. Res., 143 (2002), pp. 356-364.
19. V. A. YAKUBOVICH, S-procedure in nonlinear control theory, Vest. Leningr., Univ. 4 (1977), pp. 73-93.