Optimality conditions for nonconvex problems over nearly convex feasible sets
From MaRDI portal
Publication:2048940
DOI10.1007/S40065-021-00315-3OpenAlexW3134441278MaRDI QIDQ2048940
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
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46) Semi-infinite programming (90C34)
Related Items (2)
Characterizations of the solution set for tangentially convex optimization problems ⋮ Lagrange multiplier characterizations of constrained best approximation with infinite constraints
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nearly convex sets: fine properties and domains or ranges of subdifferentials of convex functions
- On convex optimization without convex representation
- Convex analysis and nonlinear optimization. Theory and examples.
- Constraint qualifications for convex optimization without convexity of constraints: new connections and applications to best approximation
- Characterizing best approximation from a convex set without convex representation
- Optimality conditions in convex optimization revisited
- Optimality conditions for pseudoconvex minimization over convex sets defined by tangentially convex constraints
- Necessary and sufficient KKT optimality conditions in non-convex optimization
- Variational Analysis and Applications
- 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
- Nonsmooth Cone-Constrained Optimization with Applications to Semi-Infinite Programming
- A Global Approach to Nonlinearly Constrained Best Approximation
This page was built for publication: Optimality conditions for nonconvex problems over nearly convex feasible sets
