An inexact successive quadratic approximation method for L-1 regularized optimization
dc.authorwosid | Nocedal, Jorge/B-7255-2009 | |
dc.authorwosid | Oztoprak, Figen/ABH-1969-2021 | |
dc.contributor.author | Byrd, Richard H. | |
dc.contributor.author | Nocedal, Jorge | |
dc.contributor.author | Oztoprak, Figen | |
dc.date.accessioned | 2024-07-18T20:40:38Z | |
dc.date.available | 2024-07-18T20:40:38Z | |
dc.date.issued | 2016 | |
dc.department | İstanbul Bilgi Üniversitesi | en_US |
dc.description.abstract | We study a Newton-like method for the minimization of an objective function that is the sum of a smooth function and an regularization term. This method, which is sometimes referred to in the literature as a proximal Newton method, computes a step by minimizing a piecewise quadratic model of the objective function . In order to make this approach efficient in practice, it is imperative to perform this inner minimization inexactly. In this paper, we give inexactness conditions that guarantee global convergence and that can be used to control the local rate of convergence of the iteration. Our inexactness conditions are based on a semi-smooth function that represents a (continuous) measure of the optimality conditions of the problem, and that embodies the soft-thresholding iteration. We give careful consideration to the algorithm employed for the inner minimization, and report numerical results on two test sets originating in machine learning. | en_US |
dc.description.sponsorship | National Science Foundation [DMS-1216554, DMS-0810213]; Department of Energy [DE-SC0001774]; ONR [N00014-14-1-0313 P00002]; US Department of Energy [DE-FG02-87ER25047]; Scientific and Technological Research Council of Turkey [113M500]; U.S. Department of Energy (DOE) [DE-FG02-87ER25047, DE-SC0001774] Funding Source: U.S. Department of Energy (DOE) | en_US |
dc.description.sponsorship | Richard H. Byrd was supported by National Science Foundation Grant DMS-1216554 and Department of Energy Grant DE-SC0001774.; Jorge Nocedal was supported by National Science Foundation Grant DMS-0810213, and by ONR Grant N00014-14-1-0313 P00002.; Figen Oztoprak was supported by US Department of Energy Grant DE-FG02-87ER25047 and by Scientific and Technological Research Council of Turkey Grant Number 113M500. Part of this work was completed while the author was at Istanbul Technical University. | en_US |
dc.identifier.doi | 10.1007/s10107-015-0941-y | |
dc.identifier.endpage | 396 | en_US |
dc.identifier.issn | 0025-5610 | |
dc.identifier.issn | 1436-4646 | |
dc.identifier.issue | 2 | en_US |
dc.identifier.scopus | 2-s2.0-84940213672 | en_US |
dc.identifier.scopusquality | Q1 | en_US |
dc.identifier.startpage | 375 | en_US |
dc.identifier.uri | https://doi.org/10.1007/s10107-015-0941-y | |
dc.identifier.uri | https://hdl.handle.net/11411/7149 | |
dc.identifier.volume | 157 | en_US |
dc.identifier.wos | WOS:000376925300003 | en_US |
dc.identifier.wosquality | Q1 | en_US |
dc.indekslendigikaynak | Web of Science | en_US |
dc.indekslendigikaynak | Scopus | en_US |
dc.language.iso | en | en_US |
dc.publisher | Springer Heidelberg | en_US |
dc.relation.ispartof | Mathematical Programming | en_US |
dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
dc.rights | info:eu-repo/semantics/closedAccess | en_US |
dc.subject | Sparse Optimization | en_US |
dc.subject | Inexact Proximal Newton | en_US |
dc.subject | Orthant-Based Quasi-Newton | en_US |
dc.subject | Newton | en_US |
dc.subject | Selection | en_US |
dc.title | An inexact successive quadratic approximation method for L-1 regularized optimization | |
dc.type | Article |