Characterizing robust solution sets of convex programs under data uncertainty
From MaRDI portal
Publication:2260682
Recommendations
- Characterizations of robust solution set of convex programs with uncertain data
- Characterizations of robust solution for convex optimization problems with data uncertainty
- Some characterizations of robust optimal solutions for uncertain convex optimization problems
- Robust convex optimization
- Sequential characterizations of robust optimal solutions in uncertain convex programs via perturbation approach
Cites work
- scientific article; zbMATH DE number 1807400 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- A characterization of the solution set of pseudoconvex extremum problems
- A convex polynomial that is not sos-convex
- A simple characterization of solutions sets of convex programs
- Characterization of solution sets of convex programs
- Characterization of solution sets of quasiconvex programs
- Characterizations of optimal solution sets of convex infinite programs
- Characterizations of solution sets of convex vector minimization problems
- Characterizations of solution sets of mathematical programs in terms of Lagrange multipliers
- Characterizations of the solution set for a class of nonsmooth optimization problems
- Characterizations of the solution sets of convex programs and variational inequality problems
- Characterizing robust set containments and solutions of uncertain linear programs without qualifications
- Convex Analysis
- Dual semidefinite programs without duality gaps for a class of convex minimax programs
- Duality in robust optimization: Primal worst equals dual best
- Exact SDP relaxations for classes of nonlinear semidefinite programming problems
- Lagrange multiplier characterizations of robust best approximations under constraint data uncertainty
- Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- On characterizing the solution sets of pseudolinear programs
- Robust SOS-convex polynomial optimization problems: exact SDP relaxations
- Robust convex quadratically constrained programs
- Robust linear semi-infinite programming duality under uncertainty
- Robust optimization
- Semidefinite representation of convex sets
- Some robust convex programs without a duality gap
- Strong duality in robust convex programming: complete characterizations
- Theory and applications of robust optimization
Cited in
(47)- Characterizing robust optimal solution sets for nonconvex uncertain semi-infinite programming problems involving tangential subdifferentials
- On highly robust approximate solutions for nonsmooth convex optimizations with data uncertainty
- Necessary optimality conditions for nonsmooth robust optimization problems
- Dual approaches to characterize robust optimal solution sets for a class of uncertain optimization problems
- scientific article; zbMATH DE number 7633452 (Why is no real title available?)
- On Radius of Robust Feasibility for Convex Conic Programs with Data Uncertainty
- scientific article; zbMATH DE number 7450966 (Why is no real title available?)
- Robust nonsmooth optimality conditions for uncertain multiobjective programs involving stable functions
- Robustness in nonsmooth nonconvex optimization problems
- Weighted robust optimality of convex optimization problems with data uncertainty
- A new method for solving multiobjective bilevel programs
- Image space analysis for uncertain multiobjective optimization problems: robust optimality conditions
- Characterizing robust weak sharp solution sets of convex optimization problems with uncertainty
- A unified approach through image space analysis to robustness in uncertain optimization problems
- On semidefinite programming relaxations for a class of robust SOS-convex polynomial optimization problems
- The stability of robustness for conic linear programs with uncertain data
- Robustness characterizations for uncertain optimization problems via image space analysis
- On constraint qualifications and optimality conditions for robust optimization problems through pseudo-differential
- scientific article; zbMATH DE number 7527196 (Why is no real title available?)
- Optimality and duality for robust optimization problems involving intersection of closed sets
- Unified robust necessary optimality conditions for nonconvex nonsmooth uncertain multiobjective optimization
- Optimality conditions for robust weak sharp efficient solutions of nonsmooth uncertain multiobjective optimization problems
- Applying convexificators in robust multiobjective optimization
- Constraint qualifications for uncertain convex optimization without convexity of constraint data uncertainty
- Local isolated efficiency in non-smooth robust semi-infinite multi-objective fractional programming problems
- Robust duality for robust efficient solutions in uncertain vector optimization problems
- Some characterizations of robust optimal solutions for uncertain fractional optimization and applications
- Robust error bounds for uncertain convex inequality systems with applications
- Optimality conditions and duality for robust nonsmooth multiobjective optimization problems with constraints
- On approximate solutions and saddle point theorems for robust convex optimization
- Robust convex optimization
- Robust optimality and duality for composite uncertain multiobjective optimization in Asplund spaces with its applications
- Some characterizations of robust solution sets for uncertain convex optimization problems with locally Lipschitz inequality constraints
- Global optimality conditions and duality theorems for robust optimal solutions of optimization problems with data uncertainty, using underestimators
- Three concepts of robust efficiency for uncertain multiobjective optimization problems via set order relations
- Characterizations of robust solution for convex optimization problems with data uncertainty
- Some characterizations of robust optimal solutions for uncertain convex optimization problems
- Sequential characterizations of robust optimal solutions in uncertain convex programs via perturbation approach
- A characterization of ill-posed data instances for convex programming.
- Characterizations for optimality conditions of general robust optimization problems
- Characterizations of robust solution set of convex programs with uncertain data
- Stability of local efficiency in multiobjective optimization
- On optimality conditions and duality theorems for robust semi-infinite multiobjective optimization problems
- Radius of robust feasibility of system of convex inequalities with uncertain data
- On second-order conic programming duals for robust convex quadratic optimization problems
- Characterizations of multi-objective robustness solutions defined by Minkowski set difference
- Robust optimality conditions for multiobjective programming problems under data uncertainty and its applications
This page was built for publication: Characterizing robust solution sets of convex programs under data uncertainty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2260682)
