Constraint qualifications for uncertain convex optimization without convexity of constraint data uncertainty
From MaRDI portal
Publication:5121102
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
Cites work
- scientific article; zbMATH DE number 1303653 (Why is no real title available?)
- scientific article; zbMATH DE number 6541193 (Why is no real title available?)
- 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
- Best approximation in inner product spaces
- Characterizations of robust solution set of convex programs with uncertain data
- Characterizing robust solution sets of convex programs under data uncertainty
- Constraint qualifications for KKT optimality condition in convex optimization with locally Lipschitz inequality constraints
- Constraint qualifications for convex optimization without convexity of constraints: new connections and applications to best approximation
- Convex Analysis
- Duality in robust optimization: Primal worst equals dual best
- Generalized Gradients and Applications
- Generalized gradients of Lipschitz functionals
- Lagrange multiplier characterizations of robust best approximations under constraint data uncertainty
- Necessary and sufficient KKT optimality conditions in non-convex optimization
- New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
- On nonsmooth optimality theorems for robust optimization problems
- On representations of the feasible set in convex optimization
- On robust convex multiobjective optimization
- Optimality conditions for pseudoconvex minimization over convex sets defined by tangentially convex constraints
- Optimality conditions in convex optimization revisited
- Optimization and nonsmooth analysis
- Robust conjugate duality for convex optimization under uncertainty with application to data classification
- Robust duality in parametric convex optimization
- Robust optimization
- Robust optimization-methodology and applications
- Some characterizations of robust optimal solutions for uncertain convex optimization problems
- Some robust convex programs without a duality gap
- Strong duality in robust convex programming: complete characterizations
- The strong conical hull intersection property for convex programming
- Theory and applications of robust optimization
Cited in
(6)- Approximate optimality conditions for robust convex optimization without convexity of constraints
- Robust constrained best approximation with nonconvex constraints
- Constraint qualifications for convex optimization without convexity of constraints: new connections and applications to best approximation
- Lagrange multiplier characterizations of robust best approximations under constraint data uncertainty
- Robust Farkas-Minkowski constraint qualification for convex inequality system under data uncertainty
- Sequential characterizations of robust optimal solutions in uncertain convex programs via perturbation approach
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)
