Stability in convex semi-infinite programming and rates of convergence of optimal solutions of discretized finite subproblems

DOI10.1080/023319340310001637387zbMath1072.90046OpenAlexW2063595679MaRDI QIDQ4470657

Marco A. López, Verónica E. Gayá, Virginia 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

zbMATH Keywords

stabilityrate of convergenceoptimal value functionoptimal set mappingHadamard well-posednessconvex semi-infinite programming

Mathematics Subject Classification ID

Convex programming (90C25) Sensitivity, stability, parametric optimization (90C31) Semi-infinite programming (90C34)

Related Items (5)

Semi-infinite programming ⋮ Rejoinder on: Stability in linear optimization and related topics. A personal tour ⋮ Primal-dual stability in continuous linear optimization ⋮ Semi-infinite optimization under convex function perturbations: Lipschitz stability ⋮ Stability of semi-infinite vector optimization problems under functional perturbations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The lower semicontinuity of optimal solution sets
• Well-posed optimization problems
• Topological stability of linear semi-infinite inequality systems
• Weak Sharp Minima in Mathematical Programming
• On the continuity of the minima for a family of constrained optimization problems^∗
• Variational Analysis
• Stability Theory for Linear Inequality Systems II: Upper Semicontinuity of the Solution Set Mapping
• Stability and Well-Posedness in Linear Semi-Infinite Programming
• Stability Theory for Linear Inequality Systems
• Convex Analysis
• Stability in the Discretization of a Parametric Semi-Infinite Convex Inequality System
• Stable parametric programming

This page was built for publication: Stability in convex semi-infinite programming and rates of convergence of optimal solutions of discretized finite subproblems