A matrix nonconvex relaxation approach to unconstrained binary polynomial programs.
Yitian QianShaohua PanShujun BiPublished in: Comput. Optim. Appl. (2023)
Keyphrases
- semidefinite
- positive semidefinite
- spectral relaxation
- objective function
- convex optimization
- low rank and sparse
- global optimization
- low rank matrices
- binary matrix
- matrix representation
- optimization problems
- computer programs
- nonlinear programming
- robust principal component analysis
- symmetric matrix
- sparse matrices
- probabilistic relaxation
- low order
- iterative algorithms
- linear algebra
- semidefinite programming
- non binary
- singular value decomposition
- lagrangian relaxation
- lognormal distribution
- quadratic optimization problems