Exactness Conditions for Semidefinite Programming Relaxations of Generalization of the Extended Trust Region Subproblem.
Rujun JiangDuan LiPublished in: Math. Oper. Res. (2023)
Keyphrases
- semidefinite programming
- trust region
- semidefinite
- linear programming
- column generation
- integer programming
- primal dual
- unconstrained optimization
- dynamic programming
- global optimum
- optimization methods
- sufficient conditions
- line search
- interior point methods
- linear program
- newton method
- hessian matrix
- np hard
- nonlinear programming
- lower bound
- kernel matrix
- optimal solution
- maximum margin
- objective function
- artificial neural networks
- quadratic programming
- training set
- global convergence
- least squares
- simulated annealing
- graphical models
- graph cuts