Newton-Type Greedy Selection Methods for $\ell _0$ -Constrained Minimization
We introduce a family of Newton-type greedy selection methods for -constrained minimization problems. The basic idea is to construct a quadratic function to approximate the original objective function around the current iterate and solve the constructed quadratic program over the cardinality constra...
| Veröffentlicht in: | IEEE transactions on pattern analysis and machine intelligence. - 1979. - 39(2017), 12 vom: 07. Dez., Seite 2437-2450 |
|---|---|
| 1. Verfasser: | |
| Weitere Verfasser: | |
| Format: | Online-Aufsatz |
| Sprache: | English |
| Veröffentlicht: |
2017
|
| Zugriff auf das übergeordnete Werk: | IEEE transactions on pattern analysis and machine intelligence |
| Schlagworte: | Journal Article Research Support, Non-U.S. Gov't |
| Online verfügbar |
Volltext |