Projection methods for conic feasibility problems; applications to sum-of-squares decompositions - BIPOP Accéder directement au contenu
Article Dans Une Revue Optimization Methods and Software Année : 2009

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

Résumé

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.
Fichier principal
Vignette du fichier
sdlsos.pdf (233.3 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

inria-00389553 , version 1 (28-05-2009)

Identifiants

  • HAL Id : inria-00389553 , version 1

Citer

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

Partager

Gmail Facebook X LinkedIn More