Necessary and sufficient KKT optimality conditions in non-convex optimization
From MaRDI portal
Publication:2361126
DOI10.1007/s11590-016-1054-0zbMath1378.90068OpenAlexW2466784529MaRDI QIDQ2361126
Publication date: 29 June 2017
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-016-1054-0
Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46)
Related Items
Non-convex regularization and accelerated gradient algorithm for sparse portfolio selection, Nonsmooth Constraint Qualifications for Nonconvex Inequality Systems, Lagrange multiplier characterizations of constrained best approximation with nonsmooth nonconvex constraints, Optimality conditions for convex problems on intersections of non necessarily convex sets, Constraint qualifications for convex optimization without convexity of constraints: new connections and applications to best approximation, Characterizations of the solution set for tangentially convex optimization problems, Unnamed Item, Characterizing best approximation from a convex set without convex representation, Robust constrained best approximation with nonconvex constraints, Necessary conditions for weak efficiency for nonsmooth degenerate multiobjective optimization problems, Lagrange multiplier characterizations of constrained best approximation with infinite constraints, Optimality conditions for nonconvex problems over nearly convex feasible sets, Unnamed Item, Optimality and duality for vector optimization problem with non-convex feasible set, Optimality Conditions for Nonconvex Constrained Optimization Problems, Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimality conditions under relaxed quasiconvexity assumptions using star and adjusted subdifferentials
- On convex optimization without convex representation
- On representations of the feasible set in convex optimization
- Optimality conditions in convex optimization revisited
- Optimality conditions for pseudoconvex minimization over convex sets defined by tangentially convex constraints
- Lectures on Modern Convex Optimization
- Quasi-Concave Programming
- Constraint qualifications in maximization problems
