On Cones of Nonnegative Quadratic Functions

References

• Barvinok A. I. Problems of distance geometry and convex properties of quadratic maps. Discrete and Comput. Geometry (1995) 13:189–202Crossref, Google Scholar
• Ben-Tal A., Nemirovsky A. S. Robust convex optimization. Math. Oper. Res. (1998) 23(4):769–805Link, Google Scholar
• Carathéodory C. Über den Variabilitätsbereich der Koeffizienten von Potenzreihen die gegebene Werte nicht annehmen. Mathematische Annalen (1907) 64:95–115Crossref, Google Scholar
• de Klerk E., Pasechnik D. V. Approximating the stability number of a graph via copositive programming. (2000) . Technical report, TU Delft, Faculty of Information Technology and Systems, Delft, The NetherlandsGoogle Scholar
• Dines L. L. On the mapping of quadratic forms. Bull. Amer. Math. Soc. (1941) 47:494–498Crossref, Google Scholar
• El Ghaoui L., Lebret H. Robust solutions to least-squares problems with uncertain data. SIAM J. Matrix Anal. and Appl. (1997) 18(4):1035–1064Crossref, Google Scholar
• Fradkov A. L., Yakubovich V. A. The S-procedure and duality relations in nonconvex problems of quadratic programming. (1979) 6(Vestnik Leningrad University, Leningrad, Russia) 101–109English translation; original Russian publication in Vestnik Leningradskogo Universiteta, Seriya Matematika, No. 1, 1973Google Scholar
• Fu M., Luo Z-Q., Ye Y. Approximation algorithms for quadratic programming. J. Combin. Optim. (1998) 2(1):29–50Crossref, Google Scholar
• Hiriart-Urruty J-B., Torki M. Pemanently going back and forth between the “quadratic world” and the “convexity world” in optimization. (2001) . Technical report, Université Paul Sabatier, Toulouse Cedex, FranceGoogle Scholar
• Lasserre J. B. Global optimization with polynomials and the problem of moments. SIAM J. Optim. (2001) 11(3):796–817Crossref, Google Scholar
• Luo Z-Q., Sturm J. F., Frenk J. B. G., Roos C., Terlaky T., Zhang S. Error bounds for quadratic systems. High Performance Optimization (2000) (Kluwer Academic Publishers, Dordrecht, The Netherlands) 383–404Crossref, Google Scholar
• Murty K. G., Kabadi S. N. Some NP-complete problems in quadratic and nonlinear programming. Math. Programming (1987) 39:117–129Crossref, Google Scholar
• Nesterov Y., Frenk J. B. G., Roos C., Terlaky T., Zhang S. Squared functional systems and optimization problems. High Performance Optimization (2000) (Kluwer Academic Publishers, Dordrecht, The Netherlands) 405–440Crossref, Google Scholar
• Nesterov Y., Nemirovsky A.Interior Point Polynomial Methods in Convex Programming, Vol. 13 Studies in Applied Mathematics (1994) (SIAM, Philadelphia, PA) Crossref, Google Scholar
• Parrilo P. A. On a decomposition of multivariable forms via LMI methods. (2000) . Technical report, California Institute of Technology, Pasadena, CAGoogle Scholar
• Pataki G. On the rank of extreme matrices in semidefinite programs and the multiplicity of optimal eigenvalues. Math. Oper. Res. (1998) 23(2):339–358Link, Google Scholar
• Polyak B. T. Convexity of nonlinear image of a small ball with applications to optimization. Set-Valued Analysis (2001) . ForthcomingGoogle Scholar
• Quist A. J., de Klerk E., Roos C., Terlaky T. Copositive relaxation for general quadratic programming. Optim. Methods and Software (1998) 9:185–208(Special Issue Celebrating the 60th Birthday of Professor Naum Shor.)Crossref, Google Scholar
• Rendl F., Wolkowicz H. A semidefinite framework for trust region subproblems with applications to large scale minimization. Math. Programming (1997) 77(2):273–299Google Scholar
• Rockafellar R. T.Convex Analysis (1970) (Princeton University Press, Princeton, NJ) Crossref, Google Scholar
• Sturm J. F., Frenk J. B. G., Roos C., Terlaky T., Zhang S. Theory and algorithms for semidefinite programming. High Performance Optimization (2000) (Kluwer Academic Publishers, Dordrecht, The Netherlands) 3–196Google Scholar
• Vavavis S. A.Nonlinear Optimization: Complexity Issues (1991) (Oxford Science, New York) Google Scholar
• Wolkowicz H., Saigal R., Vandenberghe L.Handbook on Semidefinite Programming (2001) (Kluwer Academic Publishers, Dordrecht, The Netherlands) Google Scholar
• Yakubovich V. A. S-procedure in nonlinear control theory. (1977) 4(1(Vestnik Leningrad University)73–93English translation; original Russian publication in Vestnik Leningradskogo Universiteta, Seriya Matematika, Leningrad, Russia, 1971, 62-77Google Scholar
• Ye Y.Interior Point Algorithms: Theory and Analysis (1997) (John Wiley & Sons, New York) Crossref, Google Scholar