Fetching the paper…
Reading the bibliography…
We propose a new family of inexact sequential quadratic approximation (SQA) methods, which we call the inexact regularized proximal Newton ($\textsf{IRPN}$) method, for minimizing the sum of two closed proper convex functions, one of which is smooth and the other is possibly non-smooth.
The Levenberg–Marquardt Algorithm: Implementation and Theory
J. J. Moré · 1978
Earlier work this paper cites.
A Posteriori Error Bounds for the Linearly–Constrained Variational Inequality Problem
J.-S. Pang · 1987
Earlier work this paper cites.
Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem
Z.-Q. Luo and P. Tseng · 1992
Earlier work this paper cites.
On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization
Z.-Q. Luo and P. Tseng · 1992
Earlier work this paper cites.
Error Bounds and Convergence Analysis of Feasible Descent Methods: A General Approach
Z.-Q. Luo and P. Tseng · 1993
Earlier work this paper cites.
Matrix Analysis
R. Bhatia · 1997
Earlier work this paper cites.
Error Bounds in Mathematical Programming
J.-S. Pang · 1997
Earlier work this paper cites.
Error Bounds and Superlinear Convergence Analysis of Some Newton–Type Methods in Optimization
P. Tseng · 2000
Earlier work this paper cites.
On the Rate of Convergence of the Levenberg–Marquardt Method
N. Yamashita and M. Fukushima · 2001
Earlier work this paper cites.
Local Behavior of an Iterative Framework for Generalized Equations with Nonisolated Solutions
A. Fischer · 2002
Earlier work this paper cites.
Finite–Dimensional Variational Inequalities and Complementarity Problems. Volume I
F. Facchinei and J.-S. Pang · 2003
Earlier work this paper cites.
Regularized Newton Methods for Convex Minimization Problems with Singular Solutions
D.-H. Li, M. Fukushima, L. Qi, and N. Yamashita · 2004
Earlier work this paper cites.
Introductory Lectures on Convex Optimization: A Basic Course
Yu. Nesterov · 2004
Earlier work this paper cites.
Automatic Smoothing with Wavelets for a Wide Class of Distributions
S. Sardy, A. Antoniadis, and P. Tseng · 2004
Earlier work this paper cites.
Signal Recovery by Proximal Forward–Backward Splitting
P. L. Combettes and V. R. Wajs · 2005
Earlier work this paper cites.
Numerical Optimization
J. Nocedal and S. J. Wright · 2006
Earlier work this paper cites.
A Quadratically Convergent Newton Method for Computing the Nearest Correlation Matrix
H. Qi and D. Sun · 2006
Earlier work this paper cites.
Pathwise Coordinate Optimization
J. Friedman, T. Hastie, H. Höfling, and R. Tibshirani · 2007
Cited alongside, same era.
LIBLINEAR: A Library for Large Linear Classification
R.-E. Fan, K.-W. Chang, C.-J. Hsieh, X.-R. Wang, and C.-J. Lin · 2008
Cited alongside, same era.
A Fast Iterative Shrinkage–Thresholding Algorithm for Linear Inverse Problems
A. Beck and M. Teboulle · 2009
Cited alongside, same era.
Implicit Functions and Solution Mappings
A. L. Dontchev and R. T. Rockafellar · 2009
Cited alongside, same era.
Optimizing Costly Functions with Simple Constraints: A Limited–Memory Projected Quasi–Newton Algorithm
M. Schmidt, E. van den Berg, M. P. Friedlander, and K. Murphy · 2009
Cited alongside, same era.
A Coordinate Gradient Descent Method for Nonsmooth Separable Minimization
P. Tseng and S. Yun · 2009
Cited alongside, same era.
On the Linear Convergence of a Proximal Gradient Method for a Class of Nonsmooth Convex Minimization Problems
H. Zhang, J. Jiang, and Z.-Q. Luo · 2013
Later among the works it cites.
An LP–Newton Method: Nonsmooth Equations, KKT Systems, and Nonisolated Solutions
F. Facchinei, A. Fischer, and M. Herrich · 2014
Later among the works it cites.
Proximal Newton–Type Methods for Minimizing Composite Functions
J. D. Lee, Y. Sun, and M. A. Saunders · 2014
Later among the works it cites.
Proximal Algorithms
N. Parikh and S. Boyd · 2014
Later among the works it cites.
Constant Nullspace Strong Convexity and Fast Convergence of Proximal Methods under High-Dimensional Settings
I. E.-H. Yen, C.-J. Hsieh, P. K. Ravikumar, and I. S. Dhillon · 2014
Later among the works it cites.
Proximal Quasi–Newton for Computationally Intensive ℓ 1 \ell_{1} –Regularized M M –Estimators
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Sparse Reconstruction by Separable Approximation
S. J. Wright, R. D. Nowak, and M. A. T. Figueiredo · 2009
Cited alongside, same era.
Approximation Accuracy, Gradient Methods, and Error Bound for Structured Convex Optimization
P. Tseng · 2010
Cited alongside, same era.
A Comparison of Optimization Methods and Software for Large–Scale L1–Regularized Linear Classification
G.-X. Yuan, K.-W. Chang, C.-J. Hsieh, and C.-J. Lin · 2010
Cited alongside, same era.
Sparse Inverse Covariance Matrix Estimation using Quadratic Approximation
C.-J. Hsieh, I. S. Dhillon, P. K. Ravikumar, and M. A. Sustik · 2011
Cited alongside, same era.
A Coordinate Gradient Descent Method for ℓ 1 \ell_{1} –Regularized Convex Minimization
S. Yun and K.-C. Toh · 2011
Cited alongside, same era.
A Quasi–Newton Proximal Splitting Method
S. Becker and J. Fadili · 2012
Cited alongside, same era.
K. Zhong, I. E.-H. Yen, I. S. Dhillon, and P. Ravikumar · 2014
Later among the works it cites.
Adaptive Restart for Accelerated Gradient Schemes
B. O’Donoghue and E. Candès · 2015
Later among the works it cites.
ℓ 1 , p \ell_{1,p} –Norm Regularization: Error Bounds and Convergence Rate Analysis of First–Order Methods
Z. Zhou, Q. Zhang, and A. M.-C. So · 2015
Later among the works it cites.
An Inexact Successive Quadratic Approximation Method for L–1 Regularized Optimization
R. H. Byrd, J. Nocedal, and F. Oztoprak · 2016
Closest in time.
A Globally Convergent LP–Newton Method
A. Fischer, M. Herrich, A. F. Izmailov, and M. V. Solodov · 2016
Closest in time.
Linear Convergence of Gradient and Proximal-Gradient Methods under the Polyak-Łojasiewicz Condition
H. Karimi, J. Nutini, and M. Schmidt · 2016
Closest in time.
Practical Inexact Proximal Quasi–Newton Method with Global Complexity Analysis
K. Scheinberg and X. Tang · 2016
Closest in time.
Calculus of the Exponent of Kurdyka–Łojasiewicz Inequality and Its Applications to Linear Convergence of First–Order Methods
G. Li and T. K. Pong · 2017
Closest in time.
Quadratic Optimization with Orthogonality Constraint: Explicit Łojasiewicz Exponent and Linear Convergence of Retraction–Based Line–Search and Stochastic Variance–Reduced Gradient Methods
H. Liu, A. M.-C. So, and W. Wu · 2017
Closest in time.
Linear Convergence of Proximal Gradient Algorithm with Extrapolation for a Class of Nonconvex Nonsmooth Minimization Problems
B. Wen, X. Chen, and T. K. Pong · 2017
Closest in time.
A Unified Approach to Error Bounds for Structured Convex Optimization Problems
Z. Zhou and A. M.-C. So · 2017
Closest in time.