Optimality conditions for nonconvex problems over nearly convex feasible sets
From MaRDI portal
Publication:2048940
Recommendations
- New qualification conditions for convex optimization without convex representation
- Optimality Conditions for Nonconvex Constrained Optimization Problems
- Optimality conditions in convex optimization revisited
- Necessary and sufficient KKT optimality conditions in non-convex optimization
- Constraint qualifications for convex optimization without convexity of constraints: new connections and applications to best approximation
Cites work
- A Global Approach to Nonlinearly Constrained Best Approximation
- 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
- Characterizing best approximation from a convex set without convex representation
- Constraint qualifications for convex optimization without convexity of constraints: new connections and applications to best approximation
- Convex analysis and nonlinear optimization. Theory and examples.
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 1807400 (Why is no real title available?)
- scientific article; zbMATH DE number 1266748 (Why is no real title available?)
- scientific article; zbMATH DE number 1502618 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 236540 (Why is no real title available?)
- Nearly convex sets: fine properties and domains or ranges of subdifferentials of convex functions
- Necessary and sufficient KKT optimality conditions in non-convex optimization
- Nonsmooth Cone-Constrained Optimization with Applications to Semi-Infinite Programming
- On convex optimization without convex representation
- Optimality conditions for pseudoconvex minimization over convex sets defined by tangentially convex constraints
- Optimality conditions in convex optimization revisited
- Variational analysis and applications
Cited in
(8)- Optimality conditions in non-convex set-valued optimization
- Lagrange multiplier characterizations of constrained best approximation with infinite constraints
- Optimality conditions in optimization problems with convex feasible set using convexificators
- scientific article; zbMATH DE number 1811716 (Why is no real title available?)
- Optimality characterizations for approximate nondominated and Fermat rules for nondominated solutions
- Characterizations of the solution set for tangentially convex optimization problems
- Optimality and duality for robust optimization problems involving intersection of closed sets
- New qualification conditions for convex optimization without convex representation
This page was built for publication: Optimality conditions for nonconvex problems over nearly convex feasible sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2048940)
