A Simple and Exact Algorithm to Solve Linear Problems with \ell ^1 -Based Regularizers.
Yohann TenderoIgor CirilJérôme DarbonPublished in: VISIGRAPP (Revised Selected Papers) (2018)
Keyphrases
- np hard
- detection algorithm
- benchmark problems
- dynamic programming
- exact solution
- learning algorithm
- convex quadratic programming
- cost function
- search space
- preprocessing
- simulated annealing
- segmentation algorithm
- computational complexity
- similarity measure
- algebraic equations
- computationally simple
- closed form
- linear complexity
- genetic algorithm
- k means
- nonlinear programming
- integer program
- linear systems
- column generation
- optimal solution
- combinatorial optimization
- expectation maximization
- particle swarm optimization
- scheduling problem