Stability and Well-Posedness in Linear Semi-Infinite Programming

From MaRDI portal
Publication:4702338

DOI10.1137/S1052623497319869zbMath0955.90141OpenAlexW1994883751MaRDI QIDQ4702338

Marco A. López, Juan Parra, Maxim Ivanov Todorov, Maria J. Cánovas

Publication date: 24 November 1999

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s1052623497319869




Related Items (32)

Extreme points of well-posed polytopesSemi-infinite programmingAn exact formula for radius of robust feasibility of uncertain linear programsRadius of Robust Feasibility for Mixed-Integer ProblemsA note on the radius of robust feasibility for uncertain convex programsSufficient conditions for total ill-posedness in linear semi-infinite optimizationStability and sensitivity of uncertain linear programsMarco A. López, a pioneer of continuous optimization in SpainStability in linear optimization and related topics. A personal tourRegularity modulus of arbitrarily perturbed linear inequality systemsOn coderivatives and Lipschitzian properties of the dual pair in optimizationCharacterization of total ill-posedness in linear semi-infinite optimizationOn the equivalence of parametric contexts for linear inequality systemsLower semi-continuity of the Pareto solution map in quasiconvex semi-infinite vector optimizationA viscosity solution approach to regularity properties of the optimal value functionSemi-infinite optimization under convex function perturbations: Lipschitz stabilityStability and Continuity in Robust OptimizationIll-posedness with respect to the solvability in linear optimizationDistance to ill-posedness and the consistency value of linear semi-infinite inequality systemsSTABILITY OF SEMI-INFINITE INEQUALITY SYSTEMS INVOLVING MIN-TYPE FUNCTIONSSelected applications of linear semi-infinite systems theoryStability of linear inequality systems in a parametric settingOn the continuity of the optimal value in parametric linear optimization: Stable discretization of the Lagrangian dual of nonlinear problemsRadius of robust feasibility formulas for classes of convex programs with uncertain polynomial constraintsQuantitative Analysis for Perturbed Abstract Inequality Systems in Banach SpacesOn the Lipschitz modulus of the argmin mapping in linear semi-infinite optimizationStability in convex semi-infinite programming and rates of convergence of optimal solutions of discretized finite subproblemsStability of semi-infinite vector optimization problems under functional perturbationsPseudo-Lipschitz property of linear semi-infinite vector optimization problemsSufficient conditions for pseudo-Lipschitz property in convex semi-infinite vector optimization problemsLinear semi-infinite programming theory: an updated surveyStability of the feasible set for linear inequality systems: A carrier index set approach




This page was built for publication: Stability and Well-Posedness in Linear Semi-Infinite Programming