Necessary and sufficient KKT optimality conditions in non-convex optimization.
Quyen HoPublished in: Optim. Lett. (2017)
Keyphrases
- convex optimization
- optimality conditions
- karush kuhn tucker
- nonlinear programming
- lower level
- interior point methods
- semi infinite
- low rank
- total variation
- constraint qualification
- convex programming
- convex relaxation
- primal dual
- sample size
- linear programming
- convex sets
- high level
- equality constraints
- low level
- linear constraints
- learning problems
- higher level
- stationary points
- optimization problems
- supervised learning