Algorithm 996: BBCPOP: A Sparse Doubly Nonnegative Relaxation of Polynomial Optimization Problems With Binary, Box, and Complementarity Constraints.
Naoki ItoSunyoung KimMasakazu KojimaAkiko TakedaKim-Chuan TohPublished in: ACM Trans. Math. Softw. (2019)
Keyphrases
- objective function
- optimization problems
- cost function
- iterative algorithms
- preprocessing
- linear programming
- k means
- dynamic programming
- worst case
- multiple constraints
- optimization algorithm
- learning algorithm
- detection algorithm
- probabilistic model
- expectation maximization
- segmentation algorithm
- least squares
- neural network
- search space
- computational complexity
- knapsack problem
- constrained optimization
- similarity measure
- theoretical guarantees
- sparse matrix