Robust linear semi-infinite programming duality under uncertainty
From MaRDI portal
Publication:353146
DOI10.1007/s10107-013-0668-6zbMath1282.90204OpenAlexW2049801480WikidataQ59241506 ScholiaQ59241506MaRDI QIDQ353146
Guoyin Li, Vaithilingam Jeyakumar, Marco A. López, Miguel Angel Goberna
Publication date: 12 July 2013
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10045/36010
convex programminglinear semi-infinite programmingrobust optimizationparameter uncertaintyrobust dualityFarkas lemma
Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05) Semi-infinite programming (90C34)
Related Items (34)
Robust optimization revisited via robust vector Farkas lemmas ⋮ Robust solutions to multi-objective linear programs with uncertain data ⋮ Complete characterizations of robust strong duality for robust vector optimization problems ⋮ Conic linear programming duals for classes of quadratic semi-infinite programs with applications ⋮ SOS-convex semialgebraic programs and its applications to robust optimization: a tractable class of nonsmooth convex optimization ⋮ Characterizations of robust solution set of convex programs with uncertain data ⋮ A note on the radius of robust feasibility for uncertain convex programs ⋮ A unifying approach to robust convex infinite optimization duality ⋮ Radius of robust global error bound for piecewise linear inequality systems ⋮ Recent contributions to linear semi-infinite optimization ⋮ Characterizing robust local error bounds for linear inequality systems under data uncertainty ⋮ Robust optimality conditions and duality for nonsmooth multiobjective fractional semi-infinite programming problems with uncertain data ⋮ Approximate optimality conditions and approximate duality theorems for nonlinear semi-infinite programming problems with uncertainty data ⋮ On robust Karush-Kuhn-Tucker multipliers rules for semi-infinite multiobjective optimization with data uncertainty ⋮ Constraint qualifications and optimality conditions for robust nonsmooth semi-infinite multiobjective optimization problems ⋮ Robust global error bounds for uncertain linear inequality systems with applications ⋮ On isolated/properly efficient solutions in nonsmooth robust semi-infinite multiobjective optimization ⋮ Robust approximate optimal solutions for nonlinear semi-infinite programming with uncertainty ⋮ Farkas' lemma: three decades of generalizations for mathematical optimization ⋮ On optimality conditions and duality theorems for robust semi-infinite multiobjective optimization problems ⋮ Recent contributions to linear semi-infinite optimization: an update ⋮ Robustness in deterministic vector optimization ⋮ Robust SOS-convex polynomial optimization problems: exact SDP relaxations ⋮ Characterizing robust solution sets of convex programs under data uncertainty ⋮ Convexifiability of continuous and discrete nonnegative quadratic programs for gap-free duality ⋮ Duality for robust linear infinite programming problems revisited ⋮ Generalized robust duality in constrained nonconvex optimization ⋮ Robustness in deterministic multi-objective linear programming with respect to the relative interior and angle deviation ⋮ On \(\epsilon\)-solutions for robust semi-infinite optimization problems ⋮ Sectional convexity of epigraphs of conjugate mappings with applications to robust vector duality ⋮ On approximate solutions for robust semi-infinite multi-objective convex symmetric cone optimization ⋮ Some characterizations of robust solution sets for uncertain convex optimization problems with locally Lipschitz inequality constraints ⋮ A Unified Approach to Robust Farkas-Type Results with Applications to Robust Optimization Problems ⋮ Strong duality for robust minimax fractional programming problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Robust Farkas' lemma for uncertain linear systems with applications
- Complete characterizations of stable Farkas' lemma and cone-convex programming duality
- Characterizing robust set containments and solutions of uncertain linear programs without qualifications
- Selected topics in robust convex optimization
- Duality in robust optimization: Primal worst equals dual best
- Generalizations of Slater's constraint qualification for infinite convex programs
- Robust solutions of linear programming problems contaminated with uncertain data
- A robust von Neumann minimax theorem for zero-sum games under bounded payoff uncertainty
- Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities
- An alternative formulation for a new closed cone constraint qualification
- Extending scope of robust optimization: comprehensive robust counterparts of uncertain problems
- A new geometric condition for Fenchel's duality in infinite dimensional spaces
- Strong Duality in Robust Convex Programming: Complete Characterizations
- Constructing Uncertainty Sets for Robust Linear Optimization
- Uniform duality in semi-infinite convex optimization
- On Extension of Fenchel Duality and its Application
- Lectures on Stochastic Programming
- Introduction to Stochastic Programming
- Robust Solutions to Least-Squares Problems with Uncertain Data
- New Farkas-type constraint qualifications in convex infinite programming
This page was built for publication: Robust linear semi-infinite programming duality under uncertainty
