Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization.
Wei BianXiaojun ChenYinyu YePublished in: Math. Program. (2015)
Keyphrases
- complexity analysis
- interior point
- theoretical analysis
- convex optimization
- linear programming
- learning algorithm
- interior point methods
- optimization problems
- computational complexity
- sufficient conditions
- nonnegative matrix factorization
- worst case
- first order logic
- primal dual
- semidefinite
- convergence analysis
- lower bound