Constraint qualifications for uncertain convex optimization without convexity of constraint data uncertainty
zbMATH Open1474.90343MaRDI QIDQ5121102FDOQ5121102
Authors: Nithirat Sisarat, Rabian Wangkeeree 
Publication date: 17 September 2020
Full work available at URL: http://thaijmath.in.cmu.ac.th/index.php/thaijmath/article/view/3379
Recommendations
- Approximate optimality conditions for robust convex optimization without convexity of constraints
- Sequential characterizations of robust optimal solutions in uncertain convex programs via perturbation approach
- Constraint qualifications for convex optimization without convexity of constraints: new connections and applications to best approximation
- Optimality of robust approximation solutions for uncertain convex optimization problems
- Robust constrained best approximation with nonconvex constraints
best approximationconstraint qualificationsnecessary and sufficient optimality conditionsnonconvex constraintsstrong conical hull intersection propertyrobust convex optimization
Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Nonconvex programming, global optimization (90C26) Robustness in mathematical programming (90C17)
Cites Work
- Convex Analysis
- Theory and applications of robust optimization
- Robust optimization
- Optimization and nonsmooth analysis
- Duality in robust optimization: Primal worst equals dual best
- Strong duality in robust convex programming: complete characterizations
- New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
- Best approximation in inner product spaces
- Robust optimization-methodology and applications
- Generalized Gradients and Applications
- Generalized gradients of Lipschitz functionals
- Characterizing robust solution sets of convex programs under data uncertainty
- Some characterizations of robust optimal solutions for uncertain convex optimization problems
- Lagrange multiplier characterizations of robust best approximations under constraint data uncertainty
- Robust duality in parametric convex optimization
- On nonsmooth optimality theorems for robust optimization problems
- On robust convex multiobjective optimization
- Robust conjugate duality for convex optimization under uncertainty with application to data classification
- The strong conical hull intersection property for convex programming
- Title not available (Why is that?)
- Best Approximation from the Intersection of a Closed Convex Set and a Polyhedron in Hilbert Space, Weak Slater Conditions, and the Strong Conical Hull Intersection Property
- Optimality conditions in convex optimization revisited
- On representations of the feasible set in convex optimization
- Some robust convex programs without a duality gap
- Constraint qualifications for convex optimization without convexity of constraints: new connections and applications to best approximation
- Optimality conditions for pseudoconvex minimization over convex sets defined by tangentially convex constraints
- Title not available (Why is that?)
- Characterizations of robust solution set of convex programs with uncertain data
- Necessary and sufficient KKT optimality conditions in non-convex optimization
- Constraint qualifications for KKT optimality condition in convex optimization with locally Lipschitz inequality constraints
Cited In (6)
- Constraint qualifications for convex optimization without convexity of constraints: new connections and applications to best approximation
- Robust constrained best approximation with nonconvex constraints
- Approximate optimality conditions for robust convex optimization without convexity of constraints
- Lagrange multiplier characterizations of robust best approximations under constraint data uncertainty
- Sequential characterizations of robust optimal solutions in uncertain convex programs via perturbation approach
- Robust Farkas-Minkowski constraint qualification for convex inequality system under data uncertainty
This page was built for publication: Constraint qualifications for uncertain convex optimization without convexity of constraint data uncertainty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5121102)
