# Quadratic growth and stability in convex programming problems

1 PROMATH - Mathematical Programming
Inria Paris-Rocquencourt
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.
Keywords :
Type de document :
Rapport
[Research Report] RR-2403, INRIA. 1994
Domaine :

Littérature citée [2 références]

https://hal.inria.fr/inria-00074272
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 14:54:32
Dernière modification le : vendredi 25 mai 2018 - 12:02:05
Document(s) archivé(s) le : lundi 5 avril 2010 - 00:07:33

### Identifiants

• HAL Id : inria-00074272, version 1

### Citation

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

### Métriques

Consultations de la notice

## 372

Téléchargements de fichiers