Approximate optimality conditions for robust convex optimization without convexity of constraints
From MaRDI portal
Recommendations
- Optimality of robust approximation solutions for uncertain convex optimization problems
- Constraint qualifications for uncertain convex optimization without convexity of constraint data uncertainty
- Optimality conditions in convex optimization revisited
- On robust approximate optimal solutions for uncertain convex optimization and applications to multi-objective optimization
- Optimality conditions in convex optimization with locally Lipschitz constraints
Cited in
(12)- Optimality conditions in convex optimization revisited
- Improvement of Karush-Kuhn-Tucker conditions under uncertainties using robust decision making indexes
- Derivative-free robust optimization by outer approximations
- Optimality conditions in convex optimization with locally Lipschitz constraints
- Optimality of robust approximation solutions for uncertain convex optimization problems
- scientific article; zbMATH DE number 7620762 (Why is no real title available?)
- Constraint qualifications for uncertain convex optimization without convexity of constraint data uncertainty
- Approximate solutions in nonsmooth robust optimization with locally Lipschitz constraints
- Karush-Kuhn-Tucker conditions and duality for a class of convex adjustable robust optimization problem
- Optimality and duality for robust optimization problems involving intersection of closed sets
- Robust approximate optimality conditions for uncertain vector optimization problems and applications
- New qualification conditions for convex optimization without convex representation
This page was built for publication: Approximate optimality conditions for robust convex optimization without convexity of constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4963687)
