Recovery of sparse signals via Branch and Bound Least-Squares.
Abolfazl HashemiHaris VikaloPublished in: ICASSP (2017)
Keyphrases
- branch and bound
- least squares
- sparse linear
- lower bound
- search algorithm
- branch and bound algorithm
- search space
- upper bound
- column generation
- combinatorial optimization
- optimal solution
- branch and bound procedure
- beam search
- branch and bound method
- tree search algorithm
- branch and bound search
- search strategies
- tree search
- max sat
- integer programming problems
- network design problem
- optical flow
- neural network
- randomly generated problems
- bnb adopt
- lagrangian heuristic
- compressive sensing
- linear programming relaxation
- partial solutions
- probabilistic model
- reinforcement learning
- bayesian networks