Optimality and duality for robust optimization problems involving intersection of closed sets
From MaRDI portal
Cites work
- Approximate optimality conditions for robust convex optimization without convexity of constraints
- Characterizations of robust solution set of convex programs with uncertain data
- Characterizing robust solution sets of convex programs under data uncertainty
- Characterizing the solution set of convex optimization problems without convexity of constraints
- Constraint qualifications for convex optimization without convexity of constraints: new connections and applications to best approximation
- Convergent hierarchy of SDP relaxations for a class of semi-infinite convex polynomial programs and applications
- Convex analysis and global optimization
- Convex optimization without convexity of constraints on non-necessarily convex sets and its applications in customer satisfaction in automotive industry
- Existence of minimizers and necessary conditions in set-valued optimization with equilibrium constraints.
- scientific article; zbMATH DE number 1113627 (Why is no real title available?)
- scientific article; zbMATH DE number 1502618 (Why is no real title available?)
- Necessary conditions in nonsmooth minimization via lower and upper subgradients
- On -solutions for convex optimization problems with uncertainty data
- On nonsmooth optimality theorems for robust optimization problems
- On quasi \(\epsilon\)-solution for robust convex optimization problems
- On robust approximate optimal solutions for uncertain convex optimization and applications to multi-objective optimization
- Optimality and duality for robust multiobjective optimization problems
- Optimality conditions for convex problems on intersections of non necessarily convex sets
- Optimality conditions for nonconvex problems over nearly convex feasible sets
- Robust Optimality and Duality in Multiobjective Optimization Problems under Data Uncertainty
- Robust optimization
- Robust solutions of quadratic optimization over single quadratic constraint under interval uncertainty
- Some characterizations of robust optimal solutions for uncertain convex optimization problems
- Some characterizations of robust solution sets for uncertain convex optimization problems with locally Lipschitz inequality constraints
- Strong duality in robust convex programming: complete characterizations
- Tangential extremal principles for finite and infinite systems of sets. I: Basic theory
- Tangential extremal principles for finite and infinite systems of sets. II: Applications to semi-infinite and multiobjective optimization
- Theory and applications of robust optimization
- Tight SDP relaxations for a class of robust SOS-convex polynomial programs without the Slater condition
- Variational analysis and applications
Cited in
(2)
This page was built for publication: Optimality and duality for robust optimization problems involving intersection of closed sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6608754)
