A generic interval branch and bound algorithm for parameter estimation.
Bertrand NeveuMartin de La GorcePascal MonasseGilles TrombettoniPublished in: J. Glob. Optim. (2019)
Keyphrases
- parameter estimation
- branch and bound algorithm
- lower bound
- branch and bound
- maximum likelihood
- lower bounding
- least squares
- optimal solution
- markov random field
- combinatorial optimization
- np hard
- model selection
- upper bound
- random fields
- em algorithm
- precedence constraints
- single machine scheduling problem
- parameter estimation algorithm
- finding an optimal solution
- randomly generated problems
- upper bounding
- model fitting
- lagrangian relaxation
- expectation maximization
- structure learning
- max sat
- maximum clique
- estimation problems
- mixed integer linear programming
- search space
- objective function
- computer vision
- genetic algorithm