Stability in convex semi-infinite programming and rates of convergence of optimal solutions of discretized finite subproblems
DOI10.1080/023319340310001637387zbMATH Open1072.90046OpenAlexW2063595679MaRDI QIDQ4470657FDOQ4470657
Authors: Verónica E. Gayá, Marco Antonio López Cerdá, V. N. Vera de Serio 
Publication date: 15 June 2004
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/023319340310001637387
Recommendations
- scientific article; zbMATH DE number 2158981
- On the stability of solutions for semi-infinite vector optimization problems
- scientific article; zbMATH DE number 37088
- scientific article; zbMATH DE number 1163075
- Stability of efficient solutions for semi-infinite vector optimization problems
- Stability and Well-Posedness in Linear Semi-Infinite Programming
- Stability in the Discretization of a Parametric Semi-Infinite Convex Inequality System
- On regularity and stability in semi-infinite optimization
- On the stability theory in nonconvex infinite optimization problems
rate of convergencestabilityoptimal value functionHadamard well-posednessoptimal set mappingconvex semi-infinite programming
Convex programming (90C25) Sensitivity, stability, parametric optimization (90C31) Semi-infinite programming (90C34)
Cites Work
- Variational Analysis
- Convex Analysis
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Well-posed optimization problems
- Weak Sharp Minima in Mathematical Programming
- Title not available (Why is that?)
- The lower semicontinuity of optimal solution sets
- Stability Theory for Linear Inequality Systems II: Upper Semicontinuity of the Solution Set Mapping
- Stability Theory for Linear Inequality Systems
- Stability and Well-Posedness in Linear Semi-Infinite Programming
- Stable parametric programming
- On the continuity of the minima for a family of constrained optimization problems∗
- Topological stability of linear semi-infinite inequality systems
- Stability in the Discretization of a Parametric Semi-Infinite Convex Inequality System
Cited In (12)
- Semi-infinite optimization under convex function perturbations: Lipschitz stability
- Title not available (Why is that?)
- Stability of semi-infinite vector optimization problems under functional perturbations
- Semi-infinite programming
- Stability in the Discretization of a Parametric Semi-Infinite Convex Inequality System
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Rejoinder on: Stability in linear optimization and related topics. A personal tour
- A note on the compactness of the index set in convex optimization. Application to metric regularity
- Primal-dual stability in continuous linear optimization
- Stability of the feasible set mapping in convex semi-infinite programming.
This page was built for publication: Stability in convex semi-infinite programming and rates of convergence of optimal solutions of discretized finite subproblems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4470657)
