%0 Journal Article %T On projection algorithms for solving convex feasibility problems %A H. H. Bauschke %A J. M. Borwein %J SIAM Rev. %D 1996 %V 38 %F Bauschke1996 %0 Book %T Nonlinear Programming %A D. P. Bertsekas %D 1995 %I Athena Scientific %C Belmont, MA %F Bertsekas1995 %0 Book %T Incremental Gradient, Subgradient, and Proximal Methods for Convex Optimization: A Survey %A D. P. Bertsekas %D 2011 %I MIT Press %C Cambridge %F Bertsekas2011 %0 Journal Article %T Incremental aggregated proximal and augmented Lagrangian algorithms %A D. P. Bertsekas %J arXiv preprint %D 2015 %V 2015 %F Bertsekas2015 %0 Book %T Neuro-Dynamic Programming %A D. P. Bertsekas %A J. N. Tsitsikls %D 1996 %I Athena Scientific %C Belmont, MA %F Bertsekas1996 %0 Journal Article %T Hilbertian convex feasibility problem: convergence of projection methods %A P. L. Combettes %J Appl. Math. Optim. %D 1997 %V 35 %F Combettes1997 %0 Book %T Topics in Metric Fixed Point Theory %A K. Geobel %A W. A. Kirk %D 1990 %I Cambridge University Press %C Cambridge %F Geobel1990 %0 Book %T Uniform convexity, hyperbolic geometry, and nonexpansive mappings %A K. Geobel %A S. Reich %D 1984 %I Marcel Dekker, Inc. %C New York %F Geobel1984 %0 Journal Article %T Convergence of a simple subgradient level method %A J.-L. Goffin %A K. C. Kiwiel %J Math. Program. %D 1999 %V 85 %F Goffin1999 %0 Book %T The elements of statistical learning %A T. Hastie %A R. Tibshirani %A J. Friedman %D 2009 %I Data mining, inference, and prediction, Second edition, Springer %C New York %F Hastie2009 %0 Book %T Parallel subgradient methods for convex optimization %A K. C. Kiwiel %A P. O. Lindberg %D 2001 %I Inherently parallel algorithms in feasibility and optimization and their applications (Haifa, 2000), 335–344, Stud. Comput. Math., North-Holland %C Amsterdam %F Kiwiel2001 %0 Journal Article %T Convergence of approximate and incremental subgradient methods for convex optimization %A K. C. Krzysztof %J SIAM J. Optim. %D 2004 %V 14 %F Krzysztof 2004 %0 Journal Article %T On the convergence of the LMS algorithm with adaptive learning rate for linear feedforward networks %A Z.-Q. Luo %J Neural Computation %D 1991 %V 3 %F Luo1991 %0 Journal Article %T Incremental subgradient methods for nondifferentiable optimization %A A. Nedić %A D. P. Bertsekas %J SIAM J. Option %D 2001 %V 12 %F Nedić2001 %0 Journal Article %T Distributed Asynchronous Incremental Subgradient Methods %A A. Nedić %A D. P. Bertsekas %A V. S. Borkar %J Stud. Comput. Math. %D 2001 %V 8 %F Nedić2001 %0 Journal Article %T Minimization of unsmooth functionals %A B. T. Polyak %J USSR Comput. Math. & Math. Phys. %D 1969 %V 9 %F Polyak 1969 %0 Book %T Introduction to Optimization %A B. T. Polyak %D 1987 %I Translated from the Russian. With a foreword by Dimitri P. Bertsekas. Translations Series in Mathematics and Engineering, Optimization Software, Inc., Publications Division %C New York %F Polyak 1987 %0 Journal Article %T An iterative regularization method for the solution of the split feasibility problem in Banach spaces %A F. Schöpfer %A T. Schuster %A A. K. Louis %J Inverse Problems %D 2008 %V 2008 %F Schöpfer2008 %0 Journal Article %T A new algorithm for constrained composite minimization %A L. Y. Shi %A Q. H. Ansari %A C. F. Wen %A J. C. Yao %J J. Nonlinear Var. Anal. %D 2017 %V 1 %F Shi2017 %0 Book %T Optimization for machine learning %A S. Sra %A S. Nowozin %A S. J. Wright %D 2011 %I MIT Press, Cambridge %C Massachusetts %F Sra2011 %0 Journal Article %T Averaged mappings and the gradient-projection algorithm %A H.-K. Xu %J J. Optim. Theory Appl. %D 2011 %V 150 %F Xu2011 %0 Journal Article %T Projection algorithms for composite minimization %A X. Yang %A H.-K. Xu %J Carpathian J. Math. %D 2017 %V 33 %F Yang2017 %0 Journal Article %T Surrogate gradient algorithm for Lagrangian relaxation %A X. Zhao %A P. B. Luh %A J. Wang %J J. Optim. Theory Appl. %D 1999 %V 100 %F Zhao1999