Block Successive Convex Approximation Algorithms for Nonsmooth Nonconvex Optimization.
Yang YangMarius PesaventoZhi-Quan LuoBjörn E. OtterstenPublished in: ACSSC (2019)
Keyphrases
- approximation algorithms
- globally convergent
- quadratic program
- primal dual
- convex functions
- image restoration and reconstruction
- variational inequalities
- np hard
- convex optimization
- alternating direction method of multipliers
- special case
- autocalibration
- line search
- global optimization
- global convergence
- nonlinear programming
- convex programming
- vertex cover
- optimization problems
- set cover
- newton method
- minimum cost
- worst case
- exact algorithms
- saddle point
- open shop
- mathematical programming
- convex relaxation
- objective function
- randomized algorithms
- approximation ratio
- undirected graph
- constant factor
- markov random field
- augmented lagrangian
- polynomial time approximation
- convex hull
- combinatorial optimization
- linear program
- linear programming
- interior point methods
- disjoint paths
- stationary points
- precedence constraints
- linear constraints
- evolutionary algorithm