Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Stability of the Minimizers of Least Squares with a Non-Convex Regularization. Part I: Local Behavior

Stability of the Minimizers of Least Squares with a Non-Convex Regularization. Part I: Local... Many estimation problems amount to minimizing a piecewise C m objective function, with m ≥ 2, composed of a quadratic data-fidelity term and a general regularization term. It is widely accepted that the minimizers obtained using non-convex and possibly non-smooth regularization terms are frequently good estimates. However, few facts are known on the ways to control properties of these minimizers. This work is dedicated to the stability of the minimizers of such objective functions with respect to variations of the data. It consists of two parts: first we consider all local minimizers, whereas in a second part we derive results on global minimizers. In this part we focus on data points such that every local minimizer is isolated and results from a C m-1 local minimizer function, defined on some neighborhood. We demonstrate that all data points for which this fails form a set whose closure is negligible. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Applied Mathematics and Optimization Springer Journals

Stability of the Minimizers of Least Squares with a Non-Convex Regularization. Part I: Local Behavior

Loading next page...
 
/lp/springer-journals/stability-of-the-minimizers-of-least-squares-with-a-non-convex-d1cAQj6hTw

References (44)

Publisher
Springer Journals
Copyright
Copyright © 2006 by Springer
Subject
Mathematics; Systems Theory, Control; Calculus of Variations and Optimal Control; Optimization; Mathematical and Computational Physics; Mathematical Methods in Physics; Numerical and Computational Methods
ISSN
0095-4616
eISSN
1432-0606
DOI
10.1007/s00245-005-0842-1
Publisher site
See Article on Publisher Site

Abstract

Many estimation problems amount to minimizing a piecewise C m objective function, with m ≥ 2, composed of a quadratic data-fidelity term and a general regularization term. It is widely accepted that the minimizers obtained using non-convex and possibly non-smooth regularization terms are frequently good estimates. However, few facts are known on the ways to control properties of these minimizers. This work is dedicated to the stability of the minimizers of such objective functions with respect to variations of the data. It consists of two parts: first we consider all local minimizers, whereas in a second part we derive results on global minimizers. In this part we focus on data points such that every local minimizer is isolated and results from a C m-1 local minimizer function, defined on some neighborhood. We demonstrate that all data points for which this fails form a set whose closure is negligible.

Journal

Applied Mathematics and OptimizationSpringer Journals

Published: Mar 1, 2006

There are no references for this article.