Abstract
Regularized minimization problems with nonconvex, nonsmooth, perhaps non- Lipschitz penalty functions have attracted considerable attention in recent years, owing to their wide applications in image restoration, signal reconstruction, and variable selection. In this paper, we derive affine-scaled second order necessary and sufficient conditions for local minimizers of such minimization problems. Moreover, we propose a global convergent smoothing trust region Newton method which can find a point satisfying the affine-scaled second order necessary optimality condition from any starting point. Numerical examples are given to demonstrate the effectiveness of the smoothing trust region Newton method.
| Original language | English |
|---|---|
| Pages (from-to) | 1528-1552 |
| Number of pages | 25 |
| Journal | SIAM Journal on Optimization |
| Volume | 23 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - 29 Oct 2013 |
Keywords
- Convergence
- Non-Lipschitz
- Nonsmooth nonconvex optimization
- Penalty function
- Regularized optimization
- Smoothing methods
- Trust region Newton method
ASJC Scopus subject areas
- Theoretical Computer Science
- Software
Fingerprint
Dive into the research topics of 'Optimality conditions and a smoothing trust region newton method for nonlipschitz optimization'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver