Characterizations for optimality conditions of general robust optimization problems
From MaRDI portal
Recommendations
- Characterizations of robust optimality conditions via image space analysis
- Robustness characterizations for uncertain optimization problems via image space analysis
- Robust optimization revisited via robust vector Farkas lemmas
- Necessary optimality conditions for nonsmooth robust optimization problems
- On optimality conditions for robust weak sharp solution in uncertain optimizations
Cites work
- A unified characterization of multiobjective robustness via separation
- Characterizing robust solution sets of convex programs under data uncertainty
- Constrained optimization and image space analysis. Vol. 1: Separation of sets and optimality conditions
- Decision uncertainty in multiobjective optimization
- Degrees of Efficiency and Degrees of Minimality
- Duality in robust optimization: Primal worst equals dual best
- Image convexity of generalized systems with infinite-dimensional image and applications
- Image space analysis for variational inequalities with cone constraints and applications to traffic equilibria
- Lipschitz behavior of the robust regularization
- Minmax robustness for multi-objective optimization problems
- Nonlinear separation approach to constrained extremum problems
- Nonlinear separation functions, optimality conditions and error bounds for Ky Fan quasi-inequalities
- Nonlinear separation in the image space with applications to penalty methods
- On nonsmooth optimality theorems for robust optimization problems
- On robust multiobjective optimization
- Robust convex optimization
- Robust discrete optimization and its applications
- Robust optimization
- Robust solutions of linear programming problems contaminated with uncertain data
- Robustness for uncertain multi-objective optimization: a survey and analysis of different concepts
- Separation approach for augmented lagrangians in Constrained nonconvex optimization
- Separation of sets and Wolfe duality
- Set-valued optimization. An introduction with applications
- Some applications of the image space analysis to the duality theory for constrained extremum problems
- Strong duality in robust convex programming: complete characterizations
- Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- Technical note: Deriving robust and globalized robust solutions of uncertain linear programs with general convex uncertainty sets
- Unified duality theory for constrained extremum problems. I: Image space analysis
Cited in
(29)- Characterizations of robust optimality conditions via image space analysis
- Robustness characterizations for uncertain optimization problems via image space analysis
- Characterizations of multiobjective robustness on vectorization counterparts
- Dual approaches to characterize robust optimal solution sets for a class of uncertain optimization problems
- A unified approach through image space analysis to robustness in uncertain optimization problems
- Some characterizations of approximate solutions for robust semi-infinite optimization problems
- Robust saddle‐point criterion in second‐order partial differential equation and partial differential inequation constrained control problems
- Robust approximate optimal solutions for nonlinear semi-infinite programming with uncertainty
- Necessary and sufficient optimality conditions for some robust variational problems
- On highly robust approximate solutions for nonsmooth convex optimizations with data uncertainty
- Some properties of nonconvex oriented distance function and applications to vector optimization problems
- Robust optimality in constrained optimization problems with application in mechanics
- Necessary optimality conditions for nonsmooth robust optimization problems
- Robust saddle-point criteria for multi-dimensional control optimisation problems with data uncertainty
- Characterizing a class of robust vector polynomial optimization via sum of squares conditions
- Characterization of norm-based robust solutions in vector optimization
- Robust penalty function method for an uncertain multi-time control optimization problems
- Dynamic analysis of fractional-order quaternion-valued fuzzy memristive neural networks: vector ordering approach
- Robust optimization revisited via robust vector Farkas lemmas
- On second-order conic programming duals for robust convex quadratic optimization problems
- Generalized robust duality in constrained nonconvex optimization
- Path connectedness of the efficient solution set for generalized vector quasi-equilibrium problems
- Exact SDP reformulations for adjustable robust quadratic optimization with affine decision rules
- Optimization and robustness
- Characterizations of robust \(\varepsilon\)-quasi optimal solutions for nonsmooth optimization problems with uncertain data
- On approximate solutions and saddle point theorems for robust convex optimization
- Image space analysis for uncertain multiobjective optimization problems: robust optimality conditions
- Scalarization of multiobjective robust optimization problems
- Characterizations of multi-objective robustness solutions defined by Minkowski set difference
This page was built for publication: Characterizations for optimality conditions of general robust optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1670134)
