Sparse Branch And Bound For Exact Optimization Of L0-Norm Penalized Least Squares

This video program is a part of the Premium package:

Sparse Branch And Bound For Exact Optimization Of L0-Norm Penalized Least Squares


  • IEEE MemberUS $11.00
  • Society MemberUS $0.00
  • IEEE Student MemberUS $11.00
  • Non-IEEE MemberUS $15.00
Purchase

Sparse Branch And Bound For Exact Optimization Of L0-Norm Penalized Least Squares

0 views
  • Share
We propose a global optimization approach to solve l_0-norm penalized least-squares problems, using a dedicated branch-and-bound methodology. A specific tree search strategy is built, with branching rules inspired from greedy exploration techniques. We sh
We propose a global optimization approach to solve l_0-norm penalized least-squares problems, using a dedicated branch-and-bound methodology. A specific tree search strategy is built, with branching rules inspired from greedy exploration techniques. We sh