Characterizations of robust solution set of convex programs with uncertain data
From MaRDI portal
Publication:1670545
DOI10.1007/S11590-017-1187-9zbMATH Open1396.90060OpenAlexW2752987943MaRDI QIDQ1670545FDOQ1670545
Publication date: 5 September 2018
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-017-1187-9
Recommendations
- Characterizing robust solution sets of convex programs under data uncertainty
- 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
- Characterizing robust weak sharp solution sets of convex optimization problems with uncertainty
constraint qualificationssubdifferentialLagrangian multipliersconvex programs under uncertaintyepigraphs of conjugate functionsrobust solution sets
Cites Work
- Robust optimization
- Duality in robust optimization: Primal worst equals dual best
- Asymptotic dual conditions characterizing optimality for infinite convex programs
- Characterizations of solution sets of convex vector minimization problems
- Some characterizations of robust optimal solutions for uncertain fractional optimization and applications
- Strong duality in robust convex programming: complete characterizations
- New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
- Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
- Stable and Total Fenchel Duality for DC Optimization Problems in Locally Convex Spaces
- Characterizations of the solution sets of convex programs and variational inequality problems
- A simple characterization of solutions sets of convex programs
- Characterizing robust solution sets of convex programs under data uncertainty
- Some characterizations of robust optimal solutions for uncertain convex optimization problems
- On characterizing the solution sets of pseudolinear programs
- A weaker regularity condition for subdifferential calculus and Fenchel duality in infinite dimensional spaces.
- Robust linear semi-infinite programming duality under uncertainty
- Characterizing robust set containments and solutions of uncertain linear programs without qualifications
- Characterization of solution sets of quasiconvex 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
- On characterizing the solution sets of pseudoinvex extremum problems
- A new approach to characterize the solution set of a pseudoconvex programming problem
- Characterizations of the solution set for a class of nonsmooth optimization problems
- Some robust convex programs without a duality gap
- A characterization of the solution set of pseudoconvex extremum problems
- On characterizing solution set of non-differentiable \(\eta \)-pseudolinear extremum problem
Cited In (21)
- Characterizing robust solution sets of convex programs under data uncertainty
- Dual approaches to characterize robust optimal solution sets for a class of uncertain optimization problems
- On solution sets for robust optimization problems
- Optimality conditions of robust convex multiobjective optimization via \(\epsilon\)-constraint scalarization and image space analysis
- Robust approximate optimal solutions for nonlinear semi-infinite programming with uncertainty
- Optimality and duality for robust optimization problems involving intersection of closed sets
- On highly robust approximate solutions for nonsmooth convex optimizations with data uncertainty
- Characterizing robust optimal solution sets for nonconvex uncertain semi-infinite programming problems involving tangential subdifferentials
- Necessary optimality conditions for nonsmooth robust optimization problems
- Characterizing robust weak sharp solution sets of convex optimization problems with 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
- Constraint qualifications for uncertain convex optimization without convexity of constraint data uncertainty
- Global optimality conditions and duality theorems for robust optimal solutions of optimization problems with data uncertainty, using underestimators
- Characterizing robust set containments and solutions of uncertain linear programs without qualifications
- On Radius of Robust Feasibility for Convex Conic Programs with Data Uncertainty
- Unified robust necessary optimality conditions for nonconvex nonsmooth uncertain multiobjective optimization
- Characterizations of robust solution for convex optimization problems with data uncertainty
- On approximate solutions and saddle point theorems for robust convex optimization
- Some characterizations of robust solution sets for uncertain convex optimization problems with locally Lipschitz inequality constraints
- Weighted robust optimality of convex optimization problems with data uncertainty
This page was built for publication: Characterizations of robust solution set of convex programs with uncertain data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1670545)
