Stability and Well-Posedness in Linear Semi-Infinite Programming
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1163075
- Stability in semilinear problems
- scientific article; zbMATH DE number 3965834
- On the stability of solutions for semi-infinite vector optimization problems
- scientific article; zbMATH DE number 1900967
- scientific article; zbMATH DE number 1186920
- On stable uniqueness in linear semi-infinite optimization
- Stability of efficient solutions for semi-infinite vector optimization problems
- On regularity and stability in semi-infinite optimization
- Stability of semi-infinite vector optimization problems under functional perturbations
Cited in
(48)- ON THE STABILITY OF STATIONARY SOLUTIONS OF NONLINEAR POSITIVE SEMIDEFINITE PROGRAMS
- A note on the radius of robust feasibility for uncertain convex programs
- Stability of the feasible set for linear inequality systems: A carrier index set approach
- Semi-infinite optimization under convex function perturbations: Lipschitz stability
- Distance to ill-posedness and the consistency value of linear semi-infinite inequality systems
- Measuring the stability. A paradigmatic problem in optimization
- Lower semi-continuity of the Pareto solution map in quasiconvex semi-infinite vector optimization
- Quantitative analysis for perturbed abstract inequality systems in Banach spaces
- Stability of semi-infinite vector optimization problems under functional perturbations
- Pseudo-Lipschitz property of linear semi-infinite vector optimization problems
- Sufficient conditions for pseudo-Lipschitz property in convex semi-infinite vector optimization problems
- Semi-infinite programming
- An Algebraic Condition Equivalent to Strong Stability of Stationary Solutions of Nonlinear Positive Semidefinite Programs
- A viscosity solution approach to regularity properties of the optimal value function
- STABILITY OF SEMI-INFINITE INEQUALITY SYSTEMS INVOLVING MIN-TYPE FUNCTIONS
- Selected applications of linear semi-infinite systems theory
- A note on primal-dual stability in infinite linear programming
- Extreme points of well-posed polytopes
- Solving strategies and well-posedness in linear semi-infinite programming
- On the Lipschitz modulus of the argmin mapping in linear semi-infinite optimization
- On stable uniqueness in linear semi-infinite optimization
- Sufficient conditions for total ill-posedness in linear semi-infinite optimization
- A factorization on the semi-infinite interval. II: Applications to stable regulator problems
- Linear semi-infinite programming theory: an updated survey
- scientific article; zbMATH DE number 1163075 (Why is no real title available?)
- On the continuity of the optimal value in parametric linear optimization: Stable discretization of the Lagrangian dual of nonlinear problems
- Stability of the primal-dual partition in linear semi-infinite programming
- Radius of Robust Feasibility for Mixed-Integer Problems
- Variational analysis in semi-infinite and infinite programming. I: Stability of linear inequality systems of feasible solutions
- Characterizing stability of parametric nonconvex polynomial optimization problems under total perturbations
- Marco A. López, a pioneer of continuous optimization in Spain
- Radius of robust feasibility formulas for classes of convex programs with uncertain polynomial constraints
- Stability and continuity in robust optimization
- Conditionally stable linear problems and the Carleman formula
- Stability and sensitivity of uncertain linear programs
- On coderivatives and Lipschitzian properties of the dual pair in optimization
- Stability in linear optimization and related topics. A personal tour
- Characterization of total ill-posedness in linear semi-infinite optimization
- On the equivalence of parametric contexts for linear inequality systems
- Stability of the intersection of solution sets of semi-infinite systems
- Ill-posedness with respect to the solvability in linear optimization
- Stability in the \(L_p\) Shephard problem
- Stability properties for parametric linear programs under data ambiguities
- Stability in convex semi-infinite programming and rates of convergence of optimal solutions of discretized finite subproblems
- An exact formula for radius of robust feasibility of uncertain linear programs
- Directional Levitin-Polyak well-posedness for optimization problems and variational inequalities
- Regularity modulus of arbitrarily perturbed linear inequality systems
- Stability of linear inequality systems in a parametric setting
This page was built for publication: Stability and Well-Posedness in Linear Semi-Infinite Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4702338)
