Fetching the paper…
Reading the bibliography…
Non-differentiable and constrained optimization play a key role in machine learning, signal and image processing, communications, and beyond.
A. A. Goldstein, “Convex programming in hilbert space,” Bulletin of the American Mathematical Society
1964
Earlier work this paper cites.
E. S. Levitin and B. T. Polyak, “Constrained minimization methods,” USSR Computational mathematics and mathematical physics
1966
Earlier work this paper cites.
D. Bertsekas, “On the goldstein-levitin-polyak gradient projection method,” Automatic Control, IEEE Transactions on
1976
Earlier work this paper cites.
D. Bertsekas, “Projected newton methods for optimization problems with simple constraints,” SIAM Journal on Control and Optimization
1982
Earlier work this paper cites.
L. Grippo, F. Lampariello, and S. Lucidi, “A Nonmonotone Line Search Technique for Newton’s Method,” SIAM Journal on Numerical Analysis
1986
Earlier work this paper cites.
J. Barzilai and J. M. Borwein, “Two-point step size gradient methods,” IMA J Numer Anal
1988
Earlier work this paper cites.
Philadephia, PA: Society for Industrial and Applied Mathematics, 1989
R. Glowinski and P. L. Tallec, Augmented Lagrangian and Operator-Splitting Methods in Nonlinear Mechanics · 1989
Earlier work this paper cites.
L. Rudin, S. Osher, and E. Fatemi, “Nonlinear total variation based noise removal algorithms,” Physica. D
1992
Earlier work this paper cites.
R. Tibshirani, “Regression shrinkage and selection via the lasso,” Journal of the Royal Statistical Society, Series B
1994
Earlier work this paper cites.
M. Goemans and D. Williamson, “Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming,” J. ACM
1995
Earlier work this paper cites.
R. Burachik, L. Mauricio, G. Drummond, A. Iusem, and E. Castorina, “Full convergence of the steepest descent method with inexact line searches.,” Optimization
1995
Earlier work this paper cites.
K. Kiwiel and K. Murty, “Convergence of the steepest descent method for minimizing quasi convex functions,” Journal of Optimization Theory and Applications
1996
Earlier work this paper cites.
D. D. Lee and H. S. Seung, “Learning the parts of objects by non-negative matrix factorization,” Nature
1999
Earlier work this paper cites.
D. D. Lee and H. S. Seung, “Algorithms for non-negative matrix factorization,” in In NIPS
2000
Earlier work this paper cites.
E. G. Birgin, J. . M. Martnez, and M. Raydan, “Nonmonotone spectral projected gradient methods on convex sets,” SIAM Journal on Optimization
2000
Earlier work this paper cites.
B. He, H. Yang, and S. Wang, “Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities,” Journal of Optimization Theory and Applications
2000
Earlier work this paper cites.
A. Chambolle, “An algorithm for total variation minimization and applications,” J. Math. Imaging Vis
2004
Earlier work this paper cites.
A. Smola and B. Schlkopf, “A tutorial on support vector regression,” Statistics and Computing
2004
Earlier work this paper cites.
Z. Hongchao and W. Hager, “A nonmonotone line search technique and its application to unconstrained optimization,” SIAM J. Optim
2004
Earlier work this paper cites.
P. L. Combettes and V. R. Wajs, “Signal recovery by proximal forward-backward splitting,” Multiscale Modeling and Simulation
2005
Cited alongside, same era.
S. Cotter, B. Rao, K. Engan, and K. Kreutz-Delgado, “Sparse solutions to linear inverse problems with multiple measurement vectors,” Signal Processing, IEEE Transactions on
2005
Cited alongside, same era.
R. Fletcher, “On the Barzilai-Borwein Method,” in Optimization and Control with Applications
2005
Cited alongside, same era.
B. Zhou, L. Gao, and Y.-H. Dai, “Gradient methods with adaptive step-sizes,” Comput. Optim. Appl
2006
Cited alongside, same era.
M. Figueiredo, R. Nowak, and S. Wright, “Gradient projection for sparse reconstruction: Application to compressed sensing and other inverse problems,” IEEE Journal of Selected Topics in Signal Processing
2007
Cited alongside, same era.
K. Gregor and Y. LeCun, “Learning fast approximations of sparse coding,” in Proc. NIPS
2010
Later among the works it cites.
J. Lee, B. Recht, R. Salakhutdinov, N. Srebro, and J. Tropp, “Practical large-scale optimization for max-norm regularization,” in Proc. NIPS
2010
Later among the works it cites.
Z. Wen, W. Yin, and D. Goldfarb, “On the convergence of an active set method for ℓ 1 \ell_{1} minimization,” tech. rep., Rice University, 2010
2010
Later among the works it cites.
T. Goldstein and S. Setzer, “High-order methods for basis pursuit,” Under review (available as UCLA CAM Report)
2010
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
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…
http://www.cs.ubc.ca/labs/scl/spgl1
E. van den Berg and M. P. Friedlander, “SPGL1: A solver for large-scale sparse reconstruction,” June 2007 · 2007
Cited alongside, same era.
J. Bioucas-Dias and M. Figueiredo, “A new TwIST: Two-step iterative shrinkage/thresholding algorithms for image restoration,” IEEE Transactions on Image Processing
2007
Cited alongside, same era.
E. Hale, W. Yin, and Y. Zhang, “A fixed-point continuation method for ℓ 1 \ell_{1} -regularized minimization with applications to compressed sensing,” CAAM Technical Report
2007
Cited alongside, same era.
P. Chakrabarty, A.K.and Shunmugaraj and C. Zalinescu, “Continuity properties for the sub-differential and ϵ \epsilon -subdifferential of a convex function and its conjugate,” Journal of Convex Analysis
2007
Cited alongside, same era.
J. Duchi, S. S. Shwartz, Y. Singer, and T. Chandra, “Efficient projections onto the ℓ 1 \ell_{1} -ball for learning in high dimensions,” in Proc. of the 25th international conference on Machine learning
2008
Cited alongside, same era.
E. van den Berg and M. P. Friedlander, “Probing the pareto frontier for basis pursuit solutions,” SIAM Journal on Scientific Computing
2008
Cited alongside, same era.
J. Duchi and Y. Singer, “Efficient Online and Batch Learning Using Forward Backward Splitting,” Journal of Machine Learning Research
2009
Cited alongside, same era.
A. Chambolle and T. Pock, “A first-order primal-dual algorithm for convex problems with applications to imaging,” Convergence
2010
Later among the works it cites.
M. Hein and S. Setzer, “Beyond spectral clustering-tight relaxations of balanced graph cuts,” in Proc. NIPS
2011
Later among the works it cites.
2011
Later among the works it cites.
P. Combettes and J. Pesquet, “Proximal splitting methods in signal processing,” in Fixed-Point Algorithms for Inverse Problems in Science and Engineering
2011
Later among the works it cites.
H. Bauschke and P. Combettes, Convex Analysis and Monotone Operator Theory in Hilbert Spaces · 2011
Later among the works it cites.
A. Szlam, K. Gregor, and Y. LeCun, “Fast Approximations to Structured Sparse Coding and Applications to Object Classification,” in Lecture Notes in Computer Science
2012
Later among the works it cites.
P. Olsen, F. Oztoprak, J. Nocedal, and S. Rennie, “Newton-like methods for sparse inverse covariance estimation,” in Proc. NIPS
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
2012
Later among the works it cites.
Manuscript
B. O’Donoghue and E. Candès, “Adaptive restart for accelerated gradient schemes.” http://www-stat.stanford.edu/~candes/publications.html , 2012 · 2012
Later among the works it cites.
M. Davenport, Y. Plan, E. van den Berg, and M. Wootters, “1-Bit matrix completion,” arXiv:1209:3672
2013
Later among the works it cites.
E. Candes, T. Strohmer, and V. Voroninski, “PhaseLift: Exact and stable signal recovery from magnitude measurements via convex programming,” Communications on Pure and Applied Mathematics
2013
Later among the works it cites.
2013
Later among the works it cites.