Optimality conditions for nonconvex problems over nearly convex feasible sets
From MaRDI portal
Publication:2048940
DOI10.1007/S40065-021-00315-3OpenAlexW3134441278MaRDI QIDQ2048940FDOQ2048940
Authors: N. Ghafari, H. Mohebi 
Publication date: 24 August 2021
Published in: Arabian Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40065-021-00315-3
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
Optimality conditions and duality in mathematical programming (90C46) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Semi-infinite programming (90C34)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Convex analysis and nonlinear optimization. Theory and examples.
- Nonsmooth Cone-Constrained Optimization with Applications to Semi-Infinite Programming
- Nearly convex sets: fine properties and domains or ranges of subdifferentials of convex functions
- 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
- A Global Approach to Nonlinearly Constrained Best Approximation
- Optimality conditions in convex optimization revisited
- On convex optimization without convex representation
- Variational analysis and applications
- 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
- Optimality conditions for pseudoconvex minimization over convex sets defined by tangentially convex constraints
- Necessary and sufficient KKT optimality conditions in non-convex optimization
Cited In (7)
- Optimality and duality for robust optimization problems involving intersection of closed sets
- Characterizations of the solution set for tangentially convex optimization problems
- Lagrange multiplier characterizations of constrained best approximation with infinite constraints
- Optimality characterizations for approximate nondominated and Fermat rules for nondominated solutions
- Optimality conditions in optimization problems with convex feasible set using convexificators
- Optimality conditions in non-convex set-valued optimization
- Title not available (Why is that?)
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)
