Projection methods for conic feasibility problems: Applications to polynomial sum-of-squares decompositions

Optimization Methods and Software

Volumn 26, Issue 1, 2011, Pages 23-46

  Henrion, Didier ^a,b   Malick, Jérôme ^c  

^a UNIVERSITÉ DE TOULOUSE   (France)

^b CZECH TECHNICAL UNIVERSITY IN PRAGUE   (Czech Republic)

^c UNIV GRENOBLE ALPES   (France)

Author keywords

convex cones; least squares problems; positive polynomials; projection algorithms; semidefinite programming

Indexed keywords

CONVEX CONE; LEAST SQUARE; POSITIVE POLYNOMIALS; PROJECTION ALGORITHMS; SEMI-DEFINITE PROGRAMMING;

ALGORITHMS; CONES; MATHEMATICAL PROGRAMMING;

POLYNOMIALS;

EID: 77957300831     PISSN: 10556788     EISSN: 10294937     Source Type: Journal    
DOI: 10.1080/10556780903191165     Document Type: Article

References (51)

1. M. Ait Rami, U. Helmke, and J.B. Moore, A finite step algorithm for solving convex feasibility problems, J. Global Optim. 38 (2007), pp. 143-160.
2. F. Alizadeh, Interior point methods in semidefinite programming with applications to combinatorial optimization, SIAM J. Optim. 5(1) (1995), pp. 13-51.
3. H.H. Bauschke and J.M. Borwein, On the convergence of von Neumann's alternating projection algorithm for two sets, Set Valued Anal. 1(2) (1993), pp. 185-212.
4. A. Ben-Tal and A. Nemirovski, Lectures on Modern Convex Optimization, SIAM, PA, 2001.
5. J.F. Bonnans, J.C. Gilbert, C. Lemaréchal, and C. Sagastizábal, Numerical Optimization, Springer-Verlag, Berlin, 2003.
6. R. Borsdorf and N.J. Higham, A preconditioned Newton algorithm for the nearest correlation matrix, IMAJ. Numer. Anal., DOI: 10.1093/imanum/drn085.
7. S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge University Press, Cambridge, UK, 2005.
8. S. Boyd and L. Xiao, Least-squares covariance matrix adjustment, SIAM J. Matrix Anal. Appl. 27(2) (2005), pp. 532-546.
9. S. Boyd, L. El Ghaoui, E. Feron, and V. Balakrishnan, Linear Matrix Inequalities in System and Control Theory, SIAM, PA, 1994.
10. J.V. Burke, A.S. Lewis, and M.L. Overton, HANSO: Hybrid algorithm for nonsmooth optimization, a Matlab package based on BFGS, bundle and gradient sampling methods, 2006; software available at www.cs.nyu.edu/overton/software/ hanso.
11. J.V. Burke, D. Henrion, A.S. Lewis, and M.L. Overton, HIFOO: A Matlab package for fixed-order controller design and H-infinity optimization, Proceedings of IFAC Symposium on Robust Control Design, Toulouse, France, 2006. Available at www.cs.nyu.edu/overton/software/hifoo.
12. M.D. Choi, T.Y. Lam, and B. Reznick, Sums of Squares of Real Polynomials. Proceedings of Symposia in Pure Mathematics, Vol.58, American Mathematical Society, Providence, RI, 1995, pp. 103-126.
13. B.D. Craven and J.J. Koliha, Generalization of Farkas' theorem, SIAM J. Math. Anal. 8(6) (1977), pp. 983-997.
14. F. Deutsch, Best Approximation in Inner Product Spaces, Springer-Verlag, Berlin, 2001.
15. B. Dumitrescu, Positive Trigonometric Polynomials and Signal Processing Applications, Springer-Verlag, Berlin, 2007.
16. R.L. Dykstra, An algorithm for restricted least-square regression, J. Amer. Statist. Assoc. 78(384) (1983), pp. 837-842.
17. L. El Ghaoui and P. Gahinet, Rank minimization under LMI constraints: A framework for output feedback problems, Proceedings of the European Control Conference, Groningen, The Netherlands, 1993.
18. M. Fazel, Matrix rank minimization with applications, Ph.D. thesis, Stanford University, 2002.
19. P. Gahinet and A. Nemirovski, The projective method for solving linear matrix inequalities, Math. Program 77 (1997), pp. 163-190.
20. J.W. Helton and M. Putinar, Positive polynomials in scalar and matrix variables, the spectral theorem and optimization, in Operator Theory, Structured Matrices and Dilations: Tiberiu Constantinescu MemorialVolume,M. Bakonyi, A. Gheondea, M. Putinar, and J. Rovnyak, eds., Theta Foundation, Bucharest, 2007, pp. 229-306.
21. D. Henrion and A. Garulli, eds., Positive Polynomials in Control, Lecture Notes in Control and Information Sciences Vol. 312, Springer-Verlag, Berlin, 2005.
22. D. Henrion and J.B. Lasserre, GloptiPoly: Global optimization over polynomials with Matlab and SeDuMi, ACM Trans. Math. Softw. 29(2) (2003), pp. 165-194. Available at www.laas.fr/̃henrion/software/gloptipoly2.
23. D. Henrion and J. Malick, SDLS: A Matlab package for solving conic least-squares problems, 2007; software available at www.laas.fr/̃henrion/ software/sdls.
24. D. Henrion, J.B. Lasserre, and J. Löfberg, GloptiPoly 3: Moments, optimization and semidefinite programming, Optim. Methods Softw. 24 (2009), pp. 761-779.
25. N. Higham, Computing a nearest symmetric positive semidefinite matrix, Linear Algebra Appl. 103 (1988), pp. 103-118.
26. N. Higham, Computing a nearest symmetric correlation matrix: A problem from finance, IMA J. Numer. Anal. 22(3) (2002), pp. 329-343.
27. J.B. Hiriart-Urruty and C. Lemaréchal, Convex Analysis and Minimization Algorithms,Vols. 1 and 2, Springer-Verlag, Berlin, 1993.
28. F. Jarre and F. Rendl, An augmented primal-dual method for linear conic problems, Research Report, Institut für Mathematik, Universität Düsseldorf, Germany, April 2007.
29. J.B. Lasserre, Global optimization with polynomials and the problem of moments, SIAM J. Optim. 11(3) (2001), pp. 796-817.
30. M. Laurent, Sums of squares, moment matrices and optimization over polynomials, in Emerging Applications of Algebraic Geometry, M. Putinar and S. Sullivant, eds., The IMA Volumes in Mathematics and its Applications Vol. 149, Springer-Verlag, Berlin, 2009, pp. 157-270.
31. A.S. Lewis and J. Malick, Alternating projections on manifolds, Math. Oper. Res. 33(1) (2008), pp. 216-234.
32. A.S. Lewis, D.R. Luke, and J. Malick, Local linear convergence for alternating and averaged nonconvex projections, Found. Comput. Math. 9(4) (2009), pp. 485-513.
33. J. Löfberg, Pre- and post-processing sum-of-squares programs in practice, IEEE Trans. Automat. Control 54(5) (2009), pp. 1007-1011.
34. J. Malick, A dual approach to semidefinite least-squares problems, SIAM J. Matrix Anal. Appl. 26(1) (2004), pp. 272-284.
35. H.D. Mittelmann, An independent benchmarking of SDP and SOCP solvers, Math. Program. 95(2) (2003), pp. 407-430.
36. B.N. Mordukhovich, Variational Analysis and Generalized Differentiation, Vols. 1 and 2, Springer-Verlag, Berlin, 2006.
37. Y. Nesterov, Squared functional systems and optimization problems, in High Performance Optimization, H. Frenk, C. Roos, T. Terlaky, and S. Zhang, eds., Kluwer Academic Publishers, Dordrecht, 2000, pp. 405-440.
38. Y. Nesterov, Smooth minimization of nonsmooth functions, Math. Program. 103(1) (2005), pp. 127-152.
39. J. Nocedal and S.J. Wright, Numerical Optimization, Springer-Verlag, Berlin, 1999.
40. R. Orsi, U. Helmke, and J.B. Moore, A Newton-like method for solving rank constrained linear matrix inequalities, Automatica 42(11) (2006), pp. 1875-1882.
41. P.A. Parrilo, Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization, Ph.D. thesis, California Institute of Technology, 2000.
42. H. Peyrl and P.A. Parrilo, Computing sum of squares decompositions with rational coefficients, Theoret. Comput. Sci. 409(2) (2008), pp. 269-281.
43. V. Powers and T.Wörmann, An algorithm for sums of squares of real polynomials, J. Pure Appl. Algebra 127 (1998), pp. 99-104.
44. H. Qi and D. Sun, Quadratic convergence and numerical experiments of Newton's method for computing the nearest correlation matrix, SIAM J. Matrix Anal. Appl. 28 (2006), pp. 360-385.
45. R.T. Rockafellar, Convex Analysis, Princeton University Press, Princeton, NJ, 1970.
46. A. Schrijver, Theory of Linear and Integer Programming, JohnWiley & Sons, Chichester, 1986.
47. J.F. Sturm, Using SeDuMi 1.02, a Matlab toolbox for optimization over symmetric cones, Optim. Methods Softw. 11-12 (1999), pp. 625-653.
48. L. Tunçel and H. Wolkowicz, Strong duality and minimal representation for cone optimization, Research Report CORR 2008-2107, Department of Combinatorics and Optimization, University ofWaterloo, Canada, August 2008.
49. R.H. Tütüncü, K.C. Toh, and M.J. Todd, Inexact primal-dual path-following algorithms for a special class of convex quadratic SDP and related problems, Pac. J. Optim. 3 (2007), pp. 135-164.
50. Z. Wang, S. Zheng, Y. Ye, and S. Boyd, Further relaxations of the SDP approach to sensor networks localization, SIAM J. Optim. 19(2) (2008), pp. 655-673.
51. H. Wolkowicz, R. Saigal, and L. Vandenberghe, Handbook of Semidefinite Programming, Kluwer Academic Publishers, Dordrecht, 2000.