On highly robust approximate solutions for nonsmooth convex optimizations with data uncertainty
From MaRDI portal
Recommendations
- On quasi \(\epsilon\)-solution for robust convex optimization problems
- On -solutions for convex optimization problems with uncertainty data
- Characterizations of robust -quasi optimal solutions for nonsmooth optimization problems with uncertain data
- On robust approximate optimal solutions for uncertain convex optimization and applications to multi-objective optimization
- On approximate solutions and saddle point theorems for robust convex optimization
Cites work
- An exact formula for radius of robust feasibility of uncertain linear programs
- Approximate KKT points and a proximity measure for termination
- Approximate solutions of multiobjective optimization problems
- Asymptotic dual conditions characterizing optimality for infinite convex programs
- Bi-objective robust optimisation
- Characterizations for optimality conditions of general robust optimization problems
- Characterizations of robust solution set of convex programs with uncertain data
- Characterizations of solution sets of convex vector minimization problems
- Characterizing robust local error bounds for linear inequality systems under data uncertainty
- Characterizing robust solution sets of convex programs under data uncertainty
- Duality in robust optimization: Primal worst equals dual best
- Guaranteeing highly robust weakly efficient solutions for uncertain multi-objective convex programs
- Linear Multiple Objective Problems with Interval Coefficients
- Necessary conditions for ε-optimality
- Necessary optimality conditions and saddle points for approximate optimization in Banach space
- On -solutions for convex optimization problems with uncertainty data
- On approximate solutions for robust convex semidefinite optimization problems
- On nonsmooth optimality theorems for robust optimization problems
- On quasi \(\epsilon\)-solution for robust convex optimization problems
- On robust approximate optimal solutions for uncertain convex optimization and applications to multi-objective optimization
- Optimality and duality for robust multiobjective optimization problems
- Radius of robust feasibility formulas for classes of convex programs with uncertain polynomial constraints
- Robust aspects of solutions in deterministic multiple objective linear programming
- Robust conjugate duality for convex optimization under uncertainty with application to data classification
- Robust duality in parametric convex optimization
- Robust optimization
- Robust optimization-methodology and applications
- Selected topics in robust convex optimization
- Strong duality in robust convex programming: complete characterizations
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- Theory and applications of robust optimization
Cited in
(6)- Robust best approximation with interpolation constraints under ellipsoidal uncertainty: strong duality and nonsmooth Newton methods
- On approximate solutions and saddle point theorems for robust convex optimization
- On -solutions for convex optimization problems with uncertainty data
- Characterizations of robust -quasi optimal solutions for nonsmooth optimization problems with uncertain data
- Mond-Weir type approximate duality for a class of robust convex optimization
- \(\varepsilon\)-Wolfe type duality for convex optimization problems under data uncertainty
This page was built for publication: On highly robust approximate solutions for nonsmooth convex optimizations with data uncertainty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3384701)
