Skip to main content
U.S. Department of Energy
Office of Scientific and Technical Information

A Proximal Quasi-Newton Trust-Region Method for Nonsmooth Regularized Optimization

Journal Article · · SIAM Journal on Optimization
DOI:https://doi.org/10.1137/21m1409536· OSTI ID:1980774

Not provided.

Research Organization:
Krell Institute, Ames, IA (United States)
Sponsoring Organization:
USDOE Office of Science (SC)
DOE Contract Number:
FG02-97ER25308
OSTI ID:
1980774
Journal Information:
SIAM Journal on Optimization, Vol. 32, Issue 2; ISSN 1052-6234
Publisher:
Society for Industrial and Applied Mathematics (SIAM)
Country of Publication:
United States
Language:
English

References (32)

Trimmed Statistical Estimation via Variance Reduction journal February 2020
Basis Pursuit Denoise With Nonsmooth Constraints journal November 2019
Julia: A Fresh Approach to Numerical Computing journal January 2017
Iterative hard thresholding for compressed sensing journal November 2009
An inertial forward–backward algorithm for the minimization of the sum of two nonconvex functions journal February 2016
Proximal alternating linearized minimization for nonconvex and nonsmooth problems journal July 2013
On the Evaluation Complexity of Composite Function Minimization with Applications to Nonconvex Nonlinear Programming journal October 2011
Concise complexity analyses for trust region methods journal June 2018
A trust region algorithm with a worst-case iteration complexity of $$\mathcal{O}(\epsilon ^{-3/2})$$ O ( ϵ - 3 / 2 ) for nonconvex optimization journal May 2016
A unified approach to global convergence of trust region methods for nonsmooth optimization journal January 1995
Two new unconstrained optimization algorithms which use function and gradient values journal August 1979
Compressed sensing journal April 2006
Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties journal December 2001
Mathematical models of threshold phenomena in the nerve membrane journal December 1955
Nonlinear Stepsize Control Algorithms: Complexity Bounds for First- and Second-Order Optimality journal September 2016
Computing proximal points of nonconvex functions journal May 2007
Proximal Newton-Type Methods for Minimizing Composite Functions journal January 2014
Splitting Algorithms for the Sum of Two Nonlinear Operators journal December 1979
A trust region method for minimization of nonsmooth functions with linear constraints journal March 1997
Computing a Trust Region Step journal September 1983
An Active Pulse Transmission Line Simulating Nerve Axon journal October 1962
Modified Gauss–Newton scheme with worst case guarantees for global performance journal June 2007
A trust region algorithm for minimization of locally Lipschitzian functions journal August 1994
DifferentialEquations.jl – A Performant and Feature-Rich Ecosystem for Solving Differential Equations in Julia journal May 2017
The Conjugate Gradient Method and Trust Regions in Large Scale Optimization journal June 1983
Forward-Backward Envelope for the Sum of Two Nonconvex Functions: Further Properties and Nonmonotone Linesearch Algorithms journal January 2018
Probing the Pareto Frontier for Basis Pursuit Solutions journal January 2009
LXXXVIII. On “relaxation-oscillations” journal November 1926
Conditions for convergence of trust region algorithms for nonsmooth optimization journal June 1985
Nearly unbiased variable selection under minimax concave penalty journal April 2010
Relax-and-split method for nonconvex inverse problems journal September 2020
A Unified Framework for Sparse Relaxed Regularized Regression: SR3 journal January 2019