Fetching the paper…
Reading the bibliography…
An adaptive regularization algorithm using high-order models is proposed for partially separable convexly constrained nonlinear optimization problems whose objective function contains non-Lipschitzian $\ell_q$-norm regularization terms for $q\in (0,1)$.
The modification of Newton’s method for unconstrained optimization by bounding cubic terms
A. Griewank · 1981
Earlier work this paper cites.
On the unconstrained optimization of partially separable functions
A. Griewank and Ph. L. Toint · 1982
Earlier work this paper cites.
AMPL: A mathematical programming language
R. Fourer, D. M. Gay, and B. W. Kernighan · 1987
Earlier work this paper cites.
LANCELOT
A. R. Conn, N. I. M. Gould, and Ph. L. Toint · 1992
Earlier work this paper cites.
Partial-update Newton methods for unary, factorable and partially separable optimization
D. Goldfarb and S. Wang · 1993
Earlier work this paper cites.
A trust region method with partial-update technique for unary optimization
L. Chen, N. Deng, and J. Zhang · 1995
Earlier work this paper cites.
Convergence properties of minimization algorithms for convex constraints using a structured trust region
A. R. Conn, N. I. M. Gould, A. Sartenaer, and Ph. L. Toint · 1996
Earlier work this paper cites.
Automatically finding and exploiting partially separable structure in nonlinear programming problems
D. M. Gay · 1996
Earlier work this paper cites.
Structured trust-region algorithms for the minimization of nonlinear functions
J. S. Shahabuddin · 1996
Earlier work this paper cites.
Modified partial-update Newton-type algorithms for unary optimization
L. Chen, N. Deng, and J. Zhang · 1998
Earlier work this paper cites.
Trust-Region Methods
A. R. Conn, N. I. M. Gould, and Ph. L. Toint · 2000
Cited alongside, same era.
Introductory Lectures on Convex Optimization
Yu. Nesterov · 2004
Cited alongside, same era.
Cubic regularization of Newton method and its global performance
Yu. Nesterov and B. T. Polyak · 2006
Cited alongside, same era.
FILTRANE
N. I. M. Gould and Ph. L. Toint · 2007
Cited alongside, same era.
From sparse solutions of systems of equations to sparse modeling of signals and images
A.M. Bruckstein, D.L. Donoho, and M. Elad · 2009
Cited alongside, same era.
On the complexity of steepest descent, Newton’s and regularized Newton’s methods for nonconvex unconstrained optimization
C. Cartis, N. I. M. Gould, and Ph. L. Toint · 2010
Cited alongside, same era.
Iterative reweighted minimization methods for
Z. Lu · 2014
Later among the works it cites.
Distributed block coordinate descent for minimizing partially separable functions
J. Mareček, P. Richtárik, and M. Takáč · 2014
Later among the works it cites.
Linearly constrained non-Lipschitzian optimization for image restoration
W. Bian and X. Chen · 2015
Later among the works it cites.
Second-order optimality and beyond: characterization and evaluation complexity in convexly-constrained nonlinear optimization
C. Cartis, N. I. M. Gould, and Ph. L. Toint · 2016
Later among the works it cites.
Solving nonlinear least-squares problems
N. I. M. Gould, J. Hogg, T. Rees, and J. Scott · 2016
Later among the works it cites.
A smoothing SQP framework for a class of composite
Y.F. Liu, S. Ma, Y.H. Dai, and S. Zhang · 2016
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Adaptive cubic overestimation methods for unconstrained optimization. Part I: motivation, convergence and numerical results
C. Cartis, N. I. M. Gould, and Ph. L. Toint · 2011
Cited alongside, same era.
Adaptive cubic overestimation methods for unconstrained optimization. Part II: worst-case function-evaluation complexity
C. Cartis, N. I. M. Gould, and Ph. L. Toint · 2011
Cited alongside, same era.
An adaptive cubic regularization algorithm for nonconvex optimization with convex constraints and its function-evaluation complexity
C. Cartis, N. I. M. Gould, and Ph. L. Toint · 2012
Cited alongside, same era.
Optimality conditions and smoothing trust region Newton method for non-Lipschitz optimization
X. Chen, L. Niu, and Y. Yuan · 2013
Cited alongside, same era.
Complexity of unconstrained
X. Chen, D. Ge, and Y. Ye
Cited in the paper.
Lower bound theory of nonzero entries in solutions of
X. Chen, F. Xu, and Y. Ye
Cited in the paper.
Later among the works it cites.
Optimality and complexity for constrained optimization problems with nonconvex regularization
W. Bian and X. Chen · 2017
Closest in time.
Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models
E. G. Birgin, J. L. Gardenghi, J. M. Martínez, S. A. Santos, and Ph. L. Toint · 2017
Closest in time.
An augmented Lagrangian method for non-Lipschitz nonconvex programming
X. Chen, L. Guo, Z. Lu, and J.J. Ye · 2017
Closest in time.
Asymptotic properties of bridge estimators in sparse highdimensional regression models
J. Huang, J.L. Horowitz, and S. Ma · 2018
Closest in time.