Asset Details
Do you wish to reserve the book?
Iterative reweighted minimization methods for ... regularized unconstrained nonlinear programming
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Iterative reweighted minimization methods for ... regularized unconstrained nonlinear programming
Do you wish to request the book?
Iterative reweighted minimization methods for ... regularized unconstrained nonlinear programming
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
Iterative reweighted minimization methods for ... regularized unconstrained nonlinear programming
2014
Overview
(ProQuest: ... denotes formulae and/or non-USASCII text omitted; see image).In this paper we study general ... regularized unconstrained minimization problems. In particular, we derive lower bounds for nonzero entries of the first- and second-order stationary points and hence also of local minimizers of the ... minimization problems. We extend some existing iterative reweighted ... (...) and ... (...) minimization methods to solve these problems and propose new variants for them in which each subproblem has a closed-form solution. Also, we provide a unified convergence analysis for these methods. In addition, we propose a novel Lipschitz continuous ...-approximation to ... Using this result, we develop new ... methods for the ... minimization problems and show that any accumulation point of the sequence generated by these methods is a first-order stationary point, provided that the approximation parameter ... is below a computable threshold value. This is a remarkable result since all existing iterative reweighted minimization methods require that ... be dynamically updated and approach zero. Our computational results demonstrate that the new ... method and the new variants generally outperform the existing ... methods (Chen and Zhou in 2012; Foucart and Lai in Appl Comput Harmon Anal 26:395-407, 2009).
Subject
