Quadratic growth and stability in convex programming problems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1994

Quadratic growth and stability in convex programming problems

J. Frederic Bonnans
  • Function : Author
  • PersonId : 833418
  • IdHAL : bonnans
Alexander D. Ioffe
  • Function : Author

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.
Fichier principal
Vignette du fichier
RR-2403.pdf (269.82 Ko) Télécharger le fichier
Loading...

Dates and versions

inria-00074272 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00074272 , version 1

Cite

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

Share

Gmail Facebook X LinkedIn More