On quasi \(\epsilon\)-solution for robust convex optimization problems
From MaRDI portal
Publication:1686550
DOI10.1007/s11590-016-1067-8zbMath1410.90155OpenAlexW2485130085MaRDI QIDQ1686550
Publication date: 15 December 2017
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-016-1067-8
robust convex optimization problemapproximate optimality conditionsapproximate duality theoremsquasi \(\epsilon\)-solution
Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Duality theory (optimization) (49N15)
Related Items
Optimality conditions of quasi $(\alpha,\varepsilon)$-solutions and approximate mixed type duality for DC composite optimization problems, On approximate solutions for robust convex semidefinite optimization problems, Convexity and closedness in stable robust duality, Robust duality for robust efficient solutions in uncertain vector optimization problems, Approximate optimality conditions and approximate duality theorems for nonlinear semi-infinite programming problems with uncertainty data, A characterization of the $\varepsilon$-normal set and its application in robust convex optimization problems, Robust optimality and duality for composite uncertain multiobjective optimization in Asplund spaces with its applications, Approximate solutions for robust multiobjective optimization programming in Asplund spaces, On constraint qualifications and optimality conditions for robust optimization problems through pseudo-differential, Approximate optimality and approximate duality for quasi approximate solutions in robust convex semidefinite programs, Unnamed Item, Unnamed Item, On optimality conditions and duality theorems for robust semi-infinite multiobjective optimization problems, On approximate solutions and saddle point theorems for robust convex optimization, Optimality conditions for minimax optimization problems with an infinite number of constraints and related applications, Quasi \(\epsilon\)-solutions in a semi-infinite programming problem with locally Lipschitz data, Optimality conditions in convex optimization with locally Lipschitz constraints, Characterizations of robustε-quasi optimal solutions for nonsmooth optimization problems with uncertain data, On \(\epsilon\)-solutions for robust semi-infinite optimization problems, On a weakly C-$\epsilon$-vector saddle point approach in weak vector problems, On approximate solutions for robust semi-infinite multi-objective convex symmetric cone optimization
Cites Work
- Unnamed Item
- Approximate solutions of multiobjective optimization problems
- On \(\epsilon\)-solutions for convex optimization problems with uncertainty data
- Some characterizations of robust optimal solutions for uncertain convex optimization problems
- Selected topics in robust convex optimization
- \(\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 the variational principle
- Approximate KKT points and a proximity measure for termination
- Characterizations of solution sets of convex vector minimization problems
- Necessary optimality conditions and saddle points for approximate optimization in Banach space
- Strong Duality in Robust Convex Programming: Complete Characterizations
- Necessary conditions for ε-optimality
- Variational Analysis
- New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
- Convex Analysis
