Strong duality in robust convex programming: complete characterizations
From MaRDI portal
Recommendations
- Robust duality for generalized convex programming problems under data uncertainty
- Strong and total Fenchel dualities for robust convex optimization problems
- Some robust convex programs without a duality gap
- Strong duality in robust semi-definite linear programming under data uncertainty
- Strong duality for robust minimax fractional programming problems
Cited in
(only showing first 100 items - show all)- Complete characterizations of robust strong duality for robust vector optimization problems
- SOS-convex semialgebraic programs and its applications to robust optimization: a tractable class of nonsmooth convex optimization
- Characterizations for optimality conditions of general robust optimization problems
- Characterizations of robust solution set of convex programs with uncertain data
- A unifying approach to robust convex infinite optimization duality
- 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
- Radius of robust feasibility formulas for classes of convex programs with uncertain polynomial constraints
- Duality for robust linear infinite programming problems revisited
- Adjustable robust balanced hub location problem with uncertain transportation cost
- Exact dual bounds for some nonconvex minimax quadratic optimization problems
- Exact SDP reformulations of adjustable robust linear programs with box uncertainties under separable quadratic decision rules via SOS representations of non-negativity
- Karush-Kuhn-Tucker optimality conditions for a class of robust optimization problems with an interval-valued objective function
- Global optimality conditions and duality theorems for robust optimal solutions of optimization problems with data uncertainty, using underestimators
- Robust Pareto solutions for convex quadratic multiobjective optimization problems under data uncertainty
- An efficient algorithm for the extended trust-region subproblem with two linear constraints
- Optimality conditions for robust nonsmooth multiobjective optimization problems in asplund spaces
- Robust strong duality for nonconvex optimization problem under data uncertainty in constraint
- On approximate efficiency for nonsmooth robust vector optimization problems
- Conic linear programming duals for classes of quadratic semi-infinite programs with applications
- Optimality conditions for robust weak sharp efficient solutions of nonsmooth uncertain multiobjective optimization problems
- Robust Farkas-Minkowski constraint qualification for convex inequality system under data uncertainty
- Weighted robust optimality of convex optimization problems with data uncertainty
- Duality theorems for convex and quasiconvex set functions
- On approximate solutions and saddle point theorems for robust convex optimization
- On solving a class of fractional semi-infinite polynomial programming problems
- Robust SOS-convex polynomial optimization problems: exact SDP relaxations
- Characterizing robust solution sets of convex programs under data uncertainty
- Strong and total Fenchel dualities for robust convex optimization problems
- Convexifiability of continuous and discrete nonnegative quadratic programs for gap-free duality
- A robust von Neumann minimax theorem for zero-sum games under bounded payoff uncertainty
- A unified approach through image space analysis to robustness in uncertain optimization problems
- On \(\epsilon\)-solutions for robust semi-infinite optimization problems
- Dual approaches to characterize robust optimal solution sets for a class of uncertain optimization problems
- Some characterizations of robust solution sets for uncertain convex optimization problems with locally Lipschitz inequality constraints
- Strong duality for robust minimax fractional programming problems
- Robust nonlinear optimization with conic representable uncertainty set
- Surrogate duality for robust optimization
- Optimality conditions and duality for robust nonsmooth multiobjective optimization problems with constraints
- On -solutions for robust fractional optimization problems
- Robust solutions to multi-objective linear programs with uncertain data
- Sums of squares polynomial program reformulations for adjustable robust linear optimization problems with separable polynomial decision rules
- On robust Karush-Kuhn-Tucker multipliers rules for semi-infinite multiobjective optimization with data uncertainty
- Constraint qualifications and optimality conditions for robust nonsmooth semi-infinite multiobjective optimization problems
- On -solutions for convex optimization problems with uncertainty data
- Stable Lagrange dualities for robust conical programming
- Some robust convex programs without a duality gap
- Robust duality for generalized invex programming problems
- Robust canonical duality theory for solving nonconvex programming problems under data uncertainty
- Characterizations of robust and stable duality for linearly perturbed uncertain optimization problems
- Some characterizations of robust optimal solutions for uncertain convex optimization problems
- On highly robust approximate solutions for nonsmooth convex optimizations with data uncertainty
- Robust linear semi-infinite programming duality under uncertainty
- Robust convex conic optimization in D-induced duality framework
- Lagrange multiplier characterizations of robust best approximations under constraint data uncertainty
- Farkas' lemma: three decades of generalizations for mathematical optimization
- Exact second-order cone programming relaxations for some nonconvex minimax quadratic optimization problems
- A block Lanczos method for the extended trust-region subproblem
- Dual semidefinite programs without duality gaps for a class of convex minimax programs
- Robust duality in parametric convex optimization
- Duality and robust duality for special nonconvex homogeneous quadratic programming under certainty and uncertainty environment
- Generalized robust duality in constrained nonconvex optimization
- Robust sufficient optimality conditions and duality in semi-infinite multiobjective programming with data uncertainty
- Approximate optimality conditions and approximate duality conditions for robust multiobjective optimization problems
- Robust Optimality and Duality in Multiobjective Optimization Problems under Data Uncertainty
- Constraint qualifications for uncertain convex optimization without convexity of constraint data uncertainty
- Optimality conditions of robust convex multiobjective optimization via -constraint scalarization and image space analysis
- On uncertain conical convex optimization problems
- Strong duality in robust semi-definite linear programming under data uncertainty
- A new class of alternative theorems for SOS-convex inequalities and robust optimization
- Characterizations of approximate duality and saddle point theorems for nonsmooth robust vector optimization
- A unified approach to robust Farkas-type results with applications to robust optimization problems
- Robust optimization revisited via robust vector Farkas lemmas
- Support vector machine classifiers with uncertain knowledge sets via robust optimization
- Optimality theorems for linear fractional optimization problems involving integral functions defined on Cn [0,1]
- Optimality and duality for robust multiobjective optimization problems
- Sufficient Optimality Conditions for a Robust Multiobjective Problem
- Strong duality in parametric robust semi-definite linear programming and exact relaxations
- Robust duality for nonconvex uncertain vector optimization via a general scalarization
- Conic relaxations with stable exactness conditions for parametric robust convex polynomial problems
- Robust duality for robust efficient solutions in uncertain vector optimization problems
- On second-order conic programming duals for robust convex quadratic optimization problems
- Characterizing a class of robust vector polynomial optimization via sum of squares conditions
- On approximate optimality conditions for robust multi-objective convex optimization problems
- A characterization of the $\varepsilon$-normal set and its application in robust convex optimization problems
- Robust optimality conditions for multiobjective programming problems under data uncertainty and its applications
- Robust optimality and duality for composite uncertain multiobjective optimization in Asplund spaces with its applications
- On constraint qualifications and optimality conditions for robust optimization problems through pseudo-differential
- Robust conjugate duality for convex optimization under uncertainty with application to data classification
- Robust duality for generalized convex programming problems under data uncertainty
- Karush-Kuhn-Tucker conditions and duality for a class of convex adjustable robust optimization problem
- Local isolated efficiency in non-smooth robust semi-infinite multi-objective fractional programming problems
- Robust duality for fractional programming problems with constraint-wise data uncertainty
- Optimality and duality for robust optimization problems involving intersection of closed sets
- Robust nonsmooth optimality conditions for uncertain multiobjective programs involving stable functions
- A support function approach for characterizations of convex normal cone
- Strong and total Fenchel dualities for robust composed convex optimization problems in locally convex spaces
- Theoretical aspects of robust SVM optimization in Banach spaces and Nash equilibrium interpretation
- A duality-guided proximal splitting method for robust constrained best approximation via convex semi-definite program reformulations
This page was built for publication: Strong duality in robust convex programming: complete characterizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3083336)
