An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization.
Heng YangLing LiangLuca CarloneKim-Chuan TohPublished in: Math. Program. (2023)
Keyphrases
- nonlinear programming
- semidefinite
- semidefinite programming
- linear programming
- interior point methods
- primal dual
- optimization problems
- linear program
- convex relaxation
- variational inequalities
- convex sets
- convergence rate
- quadratic programming
- optimization methods
- column generation
- dynamic programming
- optimal solution
- kernel matrix
- linear constraints
- objective function
- higher dimensional
- sufficient conditions
- negative matrix factorization
- wavelet transform
- evolutionary algorithm