A combinatorial algorithm for computing the entire sequence of the maximum degree of minors of a generic partitioned polynomial matrix with 2 ˟ 2 submatrices.
Yuni IwamasaPublished in: Math. Program. (2024)
Keyphrases
- learning algorithm
- computational cost
- experimental evaluation
- cost function
- times faster
- matching algorithm
- dynamic programming
- recognition algorithm
- detection algorithm
- expectation maximization
- optimal solution
- np hard
- probabilistic model
- input data
- search space
- simulated annealing
- linear programming
- significant improvement
- optimization algorithm
- objective function
- decision trees