Skip to Main content Skip to Navigation
Journal articles

Projection methods for conic feasibility problems; applications to sum-of-squares decompositions

Didier Henrion 1 Jérôme Malick 2
1 LAAS-MAC - Équipe Méthodes et Algorithmes en Commande
LAAS - Laboratoire d'analyse et d'architecture des systèmes
2 BIPOP - Modelling, Simulation, Control and Optimization of Non-Smooth Dynamical Systems
Inria Grenoble - Rhône-Alpes, LJK - Laboratoire Jean Kuntzmann, Grenoble INP - Institut polytechnique de Grenoble - Grenoble Institute of Technology
Abstract : This paper presents a projection-based approach for solving conic feasibility problems. To find a point in the intersection of a cone and an affine subspace, we simply project a point onto this intersection. This projection is computed by dual algorithms operating a sequence of projections onto the cone, and generalizing the alternating pro jection method. We release an easy-to-use Matlab package implementing an elementary dual projection algorithm. Numerical experiments show that, for solving some semidefinite feasibility problems, the package is competitive with sophisticated conic programming software. We also provide a particular treatment of semidefinite feasibility problems modeling polynomial sum-of-squares decomposition problems.
Document type :
Journal articles
Complete list of metadata

Cited literature [47 references]  Display  Hide  Download
Contributor : Jérôme Malick <>
Submitted on : Thursday, May 28, 2009 - 7:55:38 PM
Last modification on : Tuesday, February 9, 2021 - 3:20:07 PM
Long-term archiving on: : Thursday, June 10, 2010 - 9:57:18 PM


Files produced by the author(s)


  • HAL Id : inria-00389553, version 1


Didier Henrion, Jérôme Malick. Projection methods for conic feasibility problems; applications to sum-of-squares decompositions. Optimization Methods and Software, Taylor & Francis, 2009, 26 (1), p. 23-46. ⟨inria-00389553⟩



Record views


Files downloads