On \(\epsilon\)-solutions for robust semi-infinite optimization problems
From MaRDI portal
Publication:2321908
DOI10.1007/s11117-018-0630-1zbMath1421.90150OpenAlexW2899505678MaRDI QIDQ2321908
Publication date: 27 August 2019
Published in: Positivity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11117-018-0630-1
approximate solutionsemi-infinite programmingrobust optimizationapproximate optimality conditionsapproximate duality theorems
Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Semi-infinite programming (90C34)
Related Items (8)
Approximate solution in robust multi-objective optimization and its application in portfolio optimization ⋮ Optimality and duality analysis for multiobjective interval-valued semi-Infinite optimization problem having vanishing constraints ⋮ Approximate optimality conditions and approximate duality theorems for nonlinear semi-infinite programming problems with uncertainty data ⋮ On isolated/properly efficient solutions in nonsmooth robust semi-infinite multiobjective optimization ⋮ Robust approximate optimal solutions for nonlinear semi-infinite programming with uncertainty ⋮ Unnamed Item ⋮ On robust approximate optimal solutions for fractional semi-infinite optimization with uncertainty data ⋮ On approximate solutions for robust semi-infinite multi-objective convex symmetric cone optimization
Cites Work
- Unnamed Item
- On \(\epsilon\)-solutions for robust fractional optimization problems
- On \(\epsilon\)-solutions for convex optimization problems with uncertainty data
- Robust linear semi-infinite programming duality under uncertainty
- Selected topics in robust convex optimization
- Duality in robust optimization: Primal worst equals dual best
- \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints
- Asymptotic dual conditions characterizing optimality for infinite convex programs
- On approximate solutions for robust convex semidefinite optimization problems
- A unifying approach to robust convex infinite optimization duality
- Recent contributions to linear semi-infinite optimization
- On quasi \(\epsilon\)-solution for robust convex optimization problems
- On optimality conditions and duality theorems for robust semi-infinite multiobjective optimization problems
- Robust optimization-methodology and applications
- Approximate KKT points and a proximity measure for termination
- Existence and optimality conditions for approximate solutions to vector optimization problems
- Characterizations of solution sets of convex vector minimization problems
- Post-Optimal Analysis in Linear Semi-Infinite Optimization
- Strong Duality in Robust Convex Programming: Complete Characterizations
- Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
- Semi-infinite programming, duality, discretization and optimality conditions†
- New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
- ON NONSMOOTH OPTIMALITY THEOREMS FOR ROBUST OPTIMIZATION PROBLEMS
This page was built for publication: On \(\epsilon\)-solutions for robust semi-infinite optimization problems
