scientific article
From MaRDI portal
Publication:3384701
zbMath1476.90243MaRDI QIDQ3384701
Rabian Wangkeeree, Jutamas Kerdkaew, Gue Myung Lee
Publication date: 17 December 2021
Full work available at URL: http://thaijmath.in.cmu.ac.th/index.php/thaijmath/article/view/4315
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
approximate optimality conditionsapproximate duality theoremsrobust optimization problemsapproximate quasi solutionsconvex optimization problems with uncertain datahighly robust solutions
Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Duality theory (optimization) (49N15)
Cites Work
- Unnamed Item
- Unnamed Item
- Approximate solutions of multiobjective optimization problems
- On \(\epsilon\)-solutions for convex optimization problems with uncertainty data
- Bi-objective robust optimisation
- Robust duality in parametric convex optimization
- Robust conjugate duality for convex optimization under uncertainty with application to data classification
- Characterizing robust local error bounds for linear inequality systems under data uncertainty
- Selected topics in robust convex optimization
- Duality in robust optimization: Primal worst equals dual best
- Asymptotic dual conditions characterizing optimality for infinite convex programs
- Characterizations for optimality conditions of general robust optimization problems
- On approximate solutions for robust convex semidefinite optimization problems
- Characterizations of robust solution set of convex programs with uncertain data
- On quasi \(\epsilon\)-solution for robust convex optimization problems
- Guaranteeing highly robust weakly efficient solutions for uncertain multi-objective convex programs
- Radius of robust feasibility formulas for classes of convex programs with uncertain polynomial constraints
- Robust optimization-methodology and applications
- Characterizing robust solution sets of convex programs under data uncertainty
- Robust aspects of solutions in deterministic multiple objective linear programming
- Approximate KKT points and a proximity measure for termination
- An exact formula for radius of robust feasibility of uncertain linear programs
- 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
- Theory and Applications of Robust Optimization
- Linear Multiple Objective Problems with Interval Coefficients
- Necessary conditions for ε-optimality
- ON NONSMOOTH OPTIMALITY THEOREMS FOR ROBUST OPTIMIZATION PROBLEMS
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- Optimality and duality for robust multiobjective optimization problems
This page was built for publication: