Characterizing robust solution sets of convex programs under data uncertainty

DOI10.1007/S10957-014-0564-0zbMATH Open1307.90136DBLPjournals/jota/JeyakumarLL15OpenAlexW2014172855WikidataQ59241479 ScholiaQ59241479MaRDI QIDQ2260682FDOQ2260682

Authors: G. Li, V. Jeyakumar, Gue Myung Lee 

Publication date: 11 March 2015

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-014-0564-0

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

zbMATH Keywords

robust optimizationoptimal solution setconvex optimization problems with data uncertaintyuncertain convex quadratic programsuncertain sum-of-squares convex polynomial programs

Mathematics Subject Classification ID

Quadratic programming (90C20) Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46)

Cites Work

• Title not available (Why is that?)
• Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
• Convex Analysis
• Theory and applications of robust optimization
• Title not available (Why is that?)
• Robust optimization
• Duality in robust optimization: Primal worst equals dual best
• Characterizations of solution sets of convex vector minimization problems
• Strong duality in robust convex programming: complete characterizations
• A convex polynomial that is not sos-convex
• Dual semidefinite programs without duality gaps for a class of convex minimax programs
• Characterizations of the solution sets of convex programs and variational inequality problems
• Exact SDP relaxations for classes of nonlinear semidefinite programming problems
• Robust convex quadratically constrained programs
• A simple characterization of solutions sets of convex programs
• Lagrange multiplier characterizations of robust best approximations under constraint data uncertainty
• On characterizing the solution sets of pseudolinear programs
• Robust linear semi-infinite programming duality under uncertainty
• Semidefinite representation of convex sets
• Characterizing robust set containments and solutions of uncertain linear programs without qualifications
• Characterization of solution sets of quasiconvex programs
• Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs
• Characterization of solution sets of convex programs
• Characterizations of solution sets of mathematical programs in terms of Lagrange multipliers
• Characterizations of optimal solution sets of convex infinite programs
• Characterizations of the solution set for a class of nonsmooth optimization problems
• Robust SOS-convex polynomial optimization problems: exact SDP relaxations
• Some robust convex programs without a duality gap
• A characterization of the solution set of pseudoconvex extremum problems

Cited In (44)

• Title not available (Why is that?)
• Robustness characterizations for uncertain optimization problems via image space analysis
• 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
• Robustness in nonsmooth nonconvex optimization problems
• 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
• On optimality conditions and duality theorems for robust semi-infinite multiobjective optimization problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Robust error bounds for uncertain convex inequality systems with applications
• Optimality and duality for robust optimization problems involving intersection of closed sets
• A characterization of ill-posed data instances for convex programming.
• Radius of robust feasibility of system of convex inequalities with uncertain data
• Characterizing robust optimal solution sets for nonconvex uncertain semi-infinite programming problems involving tangential subdifferentials
• Necessary optimality conditions for nonsmooth robust optimization problems
• Robust nonsmooth optimality conditions for uncertain multiobjective programs involving stable functions
• Optimality conditions and duality for robust nonsmooth multiobjective optimization problems with constraints
• Optimality conditions for robust weak sharp efficient solutions of nonsmooth uncertain multiobjective optimization problems
• Robust optimality conditions for multiobjective programming problems under data uncertainty and its applications
• Characterizing robust weak sharp solution sets of convex optimization problems with uncertainty
• Three concepts of robust efficiency for uncertain multiobjective optimization problems via set order relations
• Robust optimality and duality for composite uncertain multiobjective optimization in Asplund spaces with its applications
• Some characterizations of robust optimal solutions for uncertain convex optimization problems
• 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
• Some characterizations of robust optimal solutions for uncertain fractional optimization and applications
• On second-order conic programming duals for robust convex quadratic optimization problems
• On semidefinite programming relaxations for a class of robust SOS-convex polynomial optimization problems
• On constraint qualifications and optimality conditions for robust optimization problems through pseudo-differential
• Applying convexificators in robust multiobjective optimization
• Robust convex optimization
• A new method for solving multiobjective bilevel programs
• Global optimality conditions and duality theorems for robust optimal solutions of optimization problems with data uncertainty, using underestimators
• Title not available (Why is that?)
• On Radius of Robust Feasibility for Convex Conic Programs with Data Uncertainty
• Unified robust necessary optimality conditions for nonconvex nonsmooth uncertain multiobjective optimization
• On approximate solutions and saddle point theorems for robust convex optimization
• Image space analysis for uncertain multiobjective optimization problems: robust optimality conditions
• Title not available (Why is that?)
• Some characterizations of robust solution sets for uncertain convex optimization problems with locally Lipschitz inequality constraints
• Characterizations of multi-objective robustness solutions defined by Minkowski set difference
• Weighted robust optimality of convex optimization problems with data uncertainty

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)