Fetching the paper…
Reading the bibliography…
This paper proposes two proximal Newton-CG methods for convex nonsmooth optimization problems in composite form.
J.-J. Moreau, “Proximité et dualité dans un espace Hilbertien,” Bull. Soc. Math. France , vol. 93, pp. 273–299, 1965
1965
Earlier work this paper cites.
R. T. Rockafellar, “Monotone operators and the proximal point algorithm,” SIAM Journal on Control and Optimization , vol. 14, no. 5, pp. 877–898, 1976
1976
Earlier work this paper cites.
R. Mifflin, “Semismooth and semiconvex functions in constrained optimization,” SIAM Journal on Control and Optimization , vol. 15, no. 6, pp. 959–972, 1977
1977
Earlier work this paper cites.
P.-L. Lions and B. Mercier, “Splitting algorithms for the sum of two nonlinear operators,” SIAM Journal on Numerical Analysis , vol. 16, no. 6, pp. 964–979, 1979
1979
Earlier work this paper cites.
F. Clarke, Optimization and nonsmooth analysis . New York: Wiley, 1983
1983
Earlier work this paper cites.
R. S. Dembo and T. Steihaug, “Truncated-Newton algorithms for large-scale unconstrained optimization,” Mathematical Programming , vol. 26, no. 2, pp. 190–212, 1983
1983
Earlier work this paper cites.
R. A. Horn, Topics in matrix analysis . Cambridge university press, 1991
1991
Earlier work this paper cites.
M. Fukushima, “Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems,” Mathematical programming , vol. 53, no. 1, pp. 99–110, 1992
1992
Earlier work this paper cites.
C. Tomasi and T. Kanade, “Shape and motion from image streams under orthography: a factorization method,” International Journal of Computer Vision , vol. 9, no. 2, pp. 137–154, 1992
1992
Earlier work this paper cites.
L. Qi and J. Sun, “A nonsmooth version of Newton’s method,” Mathematical programming , vol. 58, no. 1-3, pp. 353–367, 1993
1993
Earlier work this paper cites.
J. F. Bonnans, J. C. Gilbert, C. Lemaréchal, and C. A. Sagastizábal, “A family of variable metric proximal methods,” Mathematical Programming , vol. 68, no. 1-3, pp. 15–47, 1995
1995
Earlier work this paper cites.
F. Facchinei, “Minimization of S C 1 {SC}^{1} functions and the Maratos effect,” Operations Research Letters , vol. 17, no. 3, pp. 131–137, 1995
1995
Earlier work this paper cites.
A. S. Lewis, “The convex analysis of unitarily invariant matrix functions,” Journal of Convex Analysis , vol. 2, no. 1, pp. 173–183, 1995
1995
Earlier work this paper cites.
M. Fukushima and L. Qi, “A globally and superlinearly convergent algorithm for nonsmooth convex minimization,” SIAM Journal on Optimization , vol. 6, no. 4, pp. 1106–1120, 1996
1996
Earlier work this paper cites.
A. S. Lewis, “Convex analysis on the Hermitian matrices,” SIAM Journal on Optimization , vol. 6, no. 1, pp. 164–177, 1996
1996
Earlier work this paper cites.
——, “Derivatives of spectral functions,” Mathematics of Operations Research , vol. 21, no. 3, pp. 576–588, 1996
1996
Earlier work this paper cites.
N. Yamashita, K. Taji, and M. Fukushima, “Unconstrained optimization reformulations of variational inequality problems,” Journal of Optimization Theory and Applications , vol. 92, no. 3, pp. 439–456, 1997
1997
Earlier work this paper cites.
C. Lemaréchal and C. Sagastizábal, “Practical aspects of the Moreau–Yosida regularization: Theoretical preliminaries,” SIAM Journal on Optimization , vol. 7, no. 2, pp. 367–385, 1997
1997
Earlier work this paper cites.
D. Sun, M. Fukushima, and L. Qi, “A computable generalized Hessian of the D-gap function and Newton-type methods for variational inequality problems,” in Complementarity and Variational Problems: State of the Art , M. Ferris and J. Pang, Eds. SIAM Publications, 1997, pp. 452–473
1997
Earlier work this paper cites.
R. Bhatia, Matrix analysis . Springer, 1997, vol. 169
1997
Earlier work this paper cites.
T. Morita and T. Kanade, “A sequential factorization method for recovering shape and motion from image streams,” IEEE Transactions on Pattern Analysis and Machine Intelligence , vol. 19, no. 8, pp. 858–867, 1997
1997
Earlier work this paper cites.
R. Mifflin, D. Sun, and L. Qi, “Quasi-Newton bundle-type methods for nondifferentiable convex optimization,” SIAM Journal on Optimization , vol. 8, no. 2, pp. 583–603, 1998
1998
Earlier work this paper cites.
D. Bertsekas, Nonlinear programming . Athena Scientific, 1999
1999
Earlier work this paper cites.
R. Mifflin, L. Qi, and D. Sun, “Properties of the Moreau-Yosida regularization of a piecewise C 2 {C}^{2} convex function,” Mathematical programming , vol. 84, no. 2, pp. 269–281, 1999
1999
Earlier work this paper cites.
A. S. Lewis and H. S. Sendov, “Twice differentiable spectral functions,” SIAM Journal on Matrix Analysis and Applications , vol. 23, no. 2, pp. 368–386, 2001
2001
Cited alongside, same era.
M. Fazel, H. Hindi, and S. P. Boyd, “A rank minimization heuristic with application to minimum order system approximation,” in American Control Conference. Proceedings of the 2001 , vol. 6. IEEE, 2001, pp. 4734–4739
2001
Cited alongside, same era.
D. Sun and J. Sun, “Semismooth matrix-valued functions,” Mathematics of Operations Research , vol. 27, no. 1, pp. 150–169, 2002
2002
Cited alongside, same era.
M. Fazel, “Matrix rank minimization with applications,” Ph.D. dissertation, Stanford University, 2002
2002
Cited alongside, same era.
E. D. Dolan and J. J. Moré, “Benchmarking optimization software with performance profiles,” Mathematical Programming , vol. 91, no. 2, pp. 201–213, Jan. 2002
Z. Liu and L. Vandenberghe, “Interior-point method for nuclear norm approximation with application to system identification,” SIAM Journal on Matrix Analysis and Applications , vol. 31, no. 3, pp. 1235–1256, 2009
2009
Later among the works it cites.
S. J. Wright, R. D. Nowak, and M. A. Figueiredo, “Sparse reconstruction by separable approximation,” Signal Processing, IEEE Transactions on , vol. 57, no. 7, pp. 2479–2493, 2009
2009
Later among the works it cites.
E. J. Candès and B. Recht, “Exact matrix completion via convex optimization,” Foundations of Computational Mathematics , vol. 9, no. 6, pp. 717–772, 2009
2009
Later among the works it cites.
A. Beck and M. Teboulle, “Gradient-based algorithms with applications to signal recovery problems,” in Convex Optimization in Signal Processing and Communications , D. Palomar and Y. Eldar, Eds. Cambridge University Press, 2010, pp. 42–88
2010
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2002
Cited alongside, same era.
F. Facchinei and J.-S. Pang, Finite-dimensional variational inequalities and complementarity problems . Springer, 2003, vol. II
2003
Cited alongside, same era.
Y. Nesterov, Introductory lectures on convex optimization: A basic course . Springer, 2003, vol. 87
2003
Cited alongside, same era.
X. Chen, H. Qi, and P. Tseng, “Analysis of nonsmooth symmetric-matrix-valued functions with applications to semidefinite complementarity problems,” SIAM Journal on Optimization , vol. 13, no. 4, pp. 960–985, 2003
2003
Cited alongside, same era.
M. S. Gowda, “Inverse and implicit function theorems for H-differentiable and semismooth functions,” Optimization Methods and Software , vol. 19, no. 5, pp. 443–461, 2004
2004
Cited alongside, same era.
M. Fazel, H. Hindi, and S. Boyd, “Rank minimization and applications in system theory,” in American Control Conference. Proceedings of the 2004 , vol. 4. IEEE, 2004, pp. 3273–3278
2004
Cited alongside, same era.
N. Srebro, “Learning with matrix factorizations,” Ph.D. dissertation, Massachusetts Institute of Technology, 2004
2004
Cited alongside, same era.
P. L. Combettes and V. R. Wajs, “Signal recovery by proximal forward-backward splitting,” Multiscale Modeling & Simulation , vol. 4, no. 4, pp. 1168–1200, 2005
2005
Cited alongside, same era.
X.-Y. Zhao, D. Sun, and K.-C. Toh, “A Newton-CG augmented Lagrangian method for semidefinite programming,” SIAM Journal on Optimization , vol. 20, no. 4, pp. 1737–1765, 2010
2010
Later among the works it cites.
B. Recht, M. Fazel, and P. A. Parrilo, “Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization,” SIAM review , vol. 52, no. 3, pp. 471–501, 2010
2010
Later among the works it cites.
K.-C. Toh and S. Yun, “An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems,” Pacific Journal of Optimization , vol. 6, no. 3, pp. 615–640, 2010
2010
Later among the works it cites.
G. Lan, Z. Lu, and R. Monteiro, “Primal-dual first-order methods with 𝒪 ( 1 / ϵ ) \mathcal{O}(1/\epsilon) iteration-complexity for cone programming,” Mathematical Programming , vol. 126, no. 1, pp. 1–29, 2011
2011
Later among the works it cites.
P. L. Combettes and J.-C. Pesquet, “Proximal splitting methods in signal processing,” Fixed-Point Algorithms for Inverse Problems in Science and Engineering , pp. 185–212, 2011
2011
Later among the works it cites.
P. Patrinos, P. Sopasakis, and H. Sarimveis, “A global piecewise smooth Newton method for fast large-scale model predictive control,” Automatica , vol. 47, pp. 2016–2022, 2011
2011
Later among the works it cites.
H. H. Bauschke and P. L. Combettes, Convex analysis and monotone operator theory in Hilbert spaces . Springer, 2011
2011
Later among the works it cites.
R. T. Rockafellar and R. J.-B. Wets, Variational analysis . Springer, 2011, vol. 317
2011
Later among the works it cites.
S. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein, “Distributed optimization and statistical learning via the alternating direction method of multipliers,” Foundations and Trends® in Machine Learning , vol. 3, no. 1, pp. 1–122, 2011
2011
Later among the works it cites.
J. Yang and Y. Zhang, “Alternating direction algorithms for ℓ 1 \ell_{1} -problems in compressive sensing,” SIAM Journal on Scientific Computing , vol. 33, no. 1, pp. 250–278, 2011
2011
Later among the works it cites.
S. Becker and M. J. Fadili, “A quasi-Newton proximal splitting method,” in Advances in Neural Information Processing Systems 25 , P. Bartlett, F. Pereira, C. Burges, L. Bottou, and K. Weinberger, Eds., 2012, vol. 1, pp. 2618–2626
2012
Later among the works it cites.
J. Lee, Y. Sun, and M. Saunders, “Proximal Newton-type methods for convex optimization,” in Advances in Neural Information Processing Systems 25 , P. Bartlett, F. Pereira, C. Burges, L. Bottou, and K. Weinberger, Eds., 2012, vol. 1, pp. 827–835
2012
Later among the works it cites.
S. Scholtes, Introduction to piecewise differentiable equations . Springer, 2012
2012
Later among the works it cites.
P. Patrinos and A. Bemporad, “Proximal Newton methods for convex composite optimization,” in IEEE Conference on Decision and Control , 2013, pp. 2358–2363
2013
Later among the works it cites.
Y. Nesterov, “Gradient methods for minimizing composite functions,” Mathematical Programming , vol. 140, no. 1, pp. 125–161, 2013
2013
Later among the works it cites.
N. Parikh and S. Boyd, “Proximal algorithms,” Foundations and Trends in Optimization , pp. 1–96, 2013
2013
Later among the works it cites.
C. C. Gonzaga, E. W. Karas, and D. R. Rossetto, “An optimal algorithm for constrained differentiable convex optimization,” SIAM Journal on Optimization , vol. 23, no. 4, pp. 1939–1955, 2013
2013
Later among the works it cites.
L. Xiao and T. Zhang, “A proximal-gradient homotopy method for the sparse least-squares problem,” SIAM Journal on Optimization , vol. 23, no. 2, pp. 1062–1091, 2013
2013
Later among the works it cites.
D. Lorenz, “Constructing test instances for basis pursuit denoising,” IEEE Transactions on Signal Processing , vol. 61, no. 5, pp. 1210–1214, 2013
2013
Later among the works it cites.