Skip to Main content Skip to Navigation
Reports

Existence of Polynomial Solutions to Robust Convex Programming Problems

Abstract : We show in this note that, under general conditions, any convex programming problem depending continuously upon scalar parameters, and solvable for any value of the latter in a fixed compact set, admits a branch of solutions polynomial with respect to these parameters. This result may be useful to generate tractable approximations of robust convex programming problems with vanishing conservativeness.
Document type :
Reports
Complete list of metadata

https://hal.inria.fr/inria-00071670
Contributor : Rapport de Recherche Inria <>
Submitted on : Tuesday, May 23, 2006 - 6:28:23 PM
Last modification on : Friday, May 25, 2018 - 12:02:04 PM
Long-term archiving on: : Sunday, April 4, 2010 - 10:32:24 PM

Identifiers

  • HAL Id : inria-00071670, version 1

Collections

Citation

Pierre-Alexandre Bliman. Existence of Polynomial Solutions to Robust Convex Programming Problems. [Research Report] RR-4910, INRIA. 2003. ⟨inria-00071670⟩

Share

Metrics

Record views

91

Files downloads

117