HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

Quadratic growth and stability in convex programming problems

Abstract : Given a convex program with $C^2$ functions and a convex set $S$ of solutions to the problem, we give a second order condition which guarantees that the problem does not have solutions outside of $S$. This condition is interpreted as a characterization for the quadratic growth of the cost function. The crucial role in the proofs is played by a theorem describing a certain uniform regularity property of critical cones in smooth convex programs. We apply these results to the discussion of stability of solutions of a convex program under possibly nonconvex perturbations.
Complete list of metadata

Cited literature [2 references]  Display  Hide  Download

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 2:54:32 PM
Last modification on : Thursday, February 3, 2022 - 11:16:39 AM
Long-term archiving on: : Monday, April 5, 2010 - 12:07:33 AM


  • HAL Id : inria-00074272, version 1



J. Frederic Bonnans, Alexander D. Ioffe. Quadratic growth and stability in convex programming problems. [Research Report] RR-2403, INRIA. 1994. ⟨inria-00074272⟩



Record views


Files downloads