On \(\epsilon\)-solutions for convex optimization problems with uncertainty data
From MaRDI portal
Publication:270047
DOI10.1007/s11117-012-0186-4zbMath1334.90126MaRDI QIDQ270047
Publication date: 7 April 2016
Published in: Positivity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11117-012-0186-4
\(\varepsilon\)-duality theorems; \(\varepsilon\)-optimality conditions; \(\varepsilon\)-solution; robust convex optimization problem; robust optimization approach
Related Items
Optimality conditions of quasi $(\alpha,\varepsilon)$-solutions and approximate mixed type duality for DC composite optimization problems, Robust approximate optimal solutions for nonlinear semi-infinite programming with uncertainty, On approximate solutions for nonsmooth robust multiobjective optimization problems, Unnamed Item, Characterizing robust optimal solution sets for nonconvex uncertain semi-infinite programming problems involving tangential subdifferentials, 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 \(\epsilon\)-solutions for robust fractional optimization problems, Some characterizations of robust optimal solutions for uncertain convex optimization problems, On robust duality for fractional programming with uncertainty data, Robustness in nonsmooth nonconvex optimization problems, On approximate solutions for robust convex semidefinite optimization problems, On quasi \(\epsilon\)-solution for robust convex optimization problems, Approximate optimality and approximate duality for quasi approximate solutions in robust convex semidefinite programs, On optimality conditions and duality theorems for robust semi-infinite multiobjective optimization problems, On approximate solutions for robust semi-infinite multi-objective convex symmetric cone optimization, On approximate efficiency for nonsmooth robust vector optimization problems, Robust Farkas-Minkowski constraint qualification for convex inequality system under data uncertainty, On approximate solutions and saddle point theorems for robust convex optimization, On \(\epsilon\)-solutions for robust semi-infinite optimization problems, Some characterizations of robust optimal solutions for uncertain fractional optimization and applications, An implementation of a reduced subgradient method via Luenberger-Mokhtar variant, Unnamed Item
Cites Work
- Robust linear optimization under general norms.
- Selected topics in robust convex optimization
- Duality in robust optimization: Primal worst equals dual best
- Asymptotic dual conditions characterizing optimality for infinite convex programs
- Epsilon approximate solutions for multiobjective programming problems
- Robust optimization-methodology and applications
- \(\varepsilon\)-optimality for multiobjective programming on a Banach space
- \(\epsilon\)-Pareto optimality for nondifferentiable multiobjective programming via penalty function
- \(\epsilon\)-duality of nondifferentiable nonconvex multiobjective programming
- Multiplier rules and saddle-point theorems for Helbig's approximate solutions in convex Pareto problems
- Characterizations of solution sets of convex vector minimization problems
- An ε-lagrange multiplier rule for a mathematical programming problem on banacch spaces∗
- Strong Duality in Robust Convex Programming: Complete Characterizations
- Constructing Uncertainty Sets for Robust Linear Optimization
- Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
- ε-Optimal solutions in nondifferentiable convex programming and some related questions
- New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
- Convex Analysis
- Unnamed Item
