An Augmented Lagrangian algorithm for nonlinear semidefinite programming applied to the covering problem.
Ernesto G. BirginWalter GómezGabriel HaeserLeonardo M. MitoDaiana O. SantosPublished in: Comput. Appl. Math. (2020)
Keyphrases
- semidefinite programming
- linear programming
- learning algorithm
- augmented lagrangian
- optimization algorithm
- np hard
- objective function
- computational complexity
- optimal solution
- cost function
- dynamic programming
- worst case
- particle swarm optimization
- primal dual
- higher order
- expectation maximization
- model selection
- global optimum
- machine learning