Login / Signup

Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets.

Vaithilingam JeyakumarS. KimG. M. LeeGuoyin Li
Published in: J. Glob. Optim. (2016)
Keyphrases
  • semidefinite programming
  • machine learning
  • genetic algorithm
  • multi objective
  • probabilistic model
  • least squares
  • semidefinite