A Value-Function-based Interior-point Method for Non-convex Bi-level Optimization.
Risheng LiuXuan LiuXiaoming YuanShangzhi ZengJin ZhangPublished in: CoRR (2021)
Keyphrases
- bi level
- interior point methods
- convex programming
- convex optimization
- convex optimization problems
- inequality constraints
- semidefinite
- gray scale
- quadratic programming
- primal dual
- linear program
- linear programming
- convex relaxation
- semidefinite programming
- constrained optimization
- convex functions
- cutting plane method
- image processing
- coefficient matrix
- singular value decomposition
- image compression
- linear programming problems
- optimization problems
- multiresolution
- multiscale
- computer vision