A Value-Function-based Interior-point Method for Non-convex Bi-level Optimization.
Risheng LiuXuan LiuXiaoming YuanShangzhi ZengJin ZhangPublished in: ICML (2021)
Keyphrases
- bi level
- interior point methods
- convex programming
- convex optimization
- convex optimization problems
- semidefinite
- inequality constraints
- gray scale
- convex relaxation
- quadratic programming
- linear programming
- primal dual
- cutting plane method
- solving problems
- linear program
- semidefinite programming
- convex functions
- nonlinear programming
- linear programming problems
- multiresolution
- computationally intensive
- constrained optimization
- low rank
- convex hull
- linear combination
- model selection
- sufficient conditions
- feature extraction