Fetching the paper…
Reading the bibliography…
Discrete gradient methods are geometric integration techniques that can preserve the dissipative structure of gradient flows.
Über Abbildung von Mannigfaltigkeiten
Luitzen Egbertus Jan Brouwer · 1911
Earlier work this paper cites.
Gradient methods for minimizing functionals
Boris T. Polyak · 1963
Earlier work this paper cites.
On upstream differencing and Godunov-type schemes for hyperbolic conservation laws
Amiram Harten, Peter D Lax, and Bram van Leer · 1983
Earlier work this paper cites.
A method for solving the convex programming problem with convergence rate O ( 1 / k 2 ) {O}(1/k^{2})
Yurii Nesterov · 1983
Earlier work this paper cites.
Real and Complex Analysis
W. Rudin · 1987
Earlier work this paper cites.
Hamiltonian-conserving discrete canonical equations based on variational difference quotients
Toshiaki Itoh and Kanji Abe · 1988
Earlier work this paper cites.
A Course in Functional Analysis
J.B. Conway · 1994
Earlier work this paper cites.
Time integration and discrete Hamiltonian systems
Oscar Gonzalez · 1996
Earlier work this paper cites.
Discrete gradient methods for solving ODEs numerically while preserving a first integral
G. R. W. Quispel and Grant S Turner · 1996
Earlier work this paper cites.
Dynamical systems and numerical analysis
Andrew Stuart and Anthony R Humphries · 1996
Earlier work this paper cites.
Geometric integration using discrete gradients
Robert I McLachlan, G. R. W. Quispel, and Nicolas Robidoux · 1999
Earlier work this paper cites.
Numerical optimization
Jorge Nocedal and Stephen Wright · 1999
Earlier work this paper cites.
The heavy ball with friction dynamical system for convex constrained minimization problems
H. Attouch and F. Alvarez · 2000
Earlier work this paper cites.
Matrix analysis and applied linear algebra , volume 71
Carl D. Meyer · 2000
Earlier work this paper cites.
Six lectures on the geometric integration of ODEs
Robert I McLachlan and G. R. W. Quispel · 2001
Earlier work this paper cites.
Accuracy and stability of numerical algorithms
Nicholas J Higham · 2002
Earlier work this paper cites.
Nonlinear Programming
Dimitri P. Bertsekas · 2003
Earlier work this paper cites.
Fixed Point Theory
A. Granas and J. Dugundji · 2003
Earlier work this paper cites.
Smooth manifolds and observables , volume 220
Jet Nestruev · 2003
Earlier work this paper cites.
An algorithm for total variation minimization and applications
Antonin Chambolle · 2004
Earlier work this paper cites.
Introductory Lectures on Convex Programming: A Basic Course
Yurii Nesterov · 2004
Earlier work this paper cites.
Geometric numerical integration: structure-preserving algorithms for ordinary differential equations , volume 31
Ernst Hairer, Christian Lubich, and Gerhard Wanner · 2006
Cited alongside, same era.
Efficient l1 regularized logistic regression
Su-In Lee, Honglak Lee, Pieter Abbeel, and Andrew Y Ng · 2006
Cited alongside, same era.
Discrete gradient method: derivative-free method for nonsmooth optimization
Adil M Bagirov, Bülent Karasözen, and Meral Sezer · 2008
Cited alongside, same era.
Cahn–Hilliard inpainting and a generalization for grayvalue images
Martin Burger, Lin He, and Carola-Bibiane Schönlieb · 2009
Cited alongside, same era.
Characterizations of Łojasiewicz inequalities: subgradient flows, talweg, convexity
Jérôme Bolte, Aris Daniilidis, Olivier Ley, and Laurent Mazet · 2010
Cited alongside, same era.
Preserving multiple first integrals by discrete gradients
A variational perspective on accelerated methods in optimization
Andre Wibisono, Ashia C Wilson, and Michael I Jordan · 2016
Later among the works it cites.
From error bounds to the complexity of first-order descent methods for convex functions
Jérôme Bolte, Trong Phong Nguyen, Juan Peypouquet, and Bruce W. Suter · 2017
Later among the works it cites.
Global Convergence of Arbitrary-Block Gradient Methods for Generalized Polyak–Łojasiewicz Functions
Dominik Csiba and Peter Richtárik · 2017
Later among the works it cites.
Discrete gradient methods for solving variational image regularisation models
Volker Grimm, Robert I McLachlan, David I McLaren, G. R. W. Quispel, and Carola-Bibiane Schönlieb · 2017
Later among the works it cites.
When cyclic coordinate descent outperforms randomized coordinate descent
Mert Gürbüzbalaban, Asuman Ozdaglar, Pablo A. Parrilo, and Nuri Vanli · 2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Morten Dahlby, Brynjulf Owren, and Takaharu Yaguchi · 2011
Cited alongside, same era.
Preserving energy resp. dissipation in numerical PDEs using the “average vector field” method
Elena Celledoni, Volker Grimm, Robert I McLachlan, David I McLaren, Dion O’Neale, Brynjulf Owren, and G. R. W. Quispel · 2012
Cited alongside, same era.
Efficiency of coordinate descent methods on huge-scale optimization problems
Yurii Nesterov · 2012
Cited alongside, same era.
On the convergence of block coordinate descent type methods
Amir Beck and Luba Tetruashvili · 2013
Cited alongside, same era.
A primal-dual approach for a total variation Wasserstein flow
Martin Benning, Luca Calatroni, Bertram Düring, and Carola-Bibiane Schönlieb · 2013
Cited alongside, same era.
Energy-diminishing integration of gradient systems
Ernst Hairer and Christian Lubich · 2013
Cited alongside, same era.
Implicit Functions and Solution Mappings: A View from Variational Analysis
A. L. Dontchev and R.T. Rockafellar · 2014
Cited alongside, same era.
A First Course in Sobolev Spaces
G. Leoni · 2017
Later among the works it cites.
Random gradient-free minimization of convex functions
Yurii Nesterov and Vladimir Spokoiny · 2017
Later among the works it cites.
Michael Betancourt, Michael I Jordan, and Ashia C Wilson · 2018
Closest in time.
Dissipative numerical schemes on riemannian manifolds with applications to gradient flows
Elena Celledoni, Sølve Eidnes, Brynjulf Owren, and Torbjørn Ringholm · 2018
Closest in time.
Chris J Maddison, Daniel Paulin, Yee Whye Teh, Brendan O’Donoghue, and Arnaud Doucet · 2018
Closest in time.
On the equivalence between SOR-type methods for linear systems and the discrete gradient methods for gradient systems
Yuto Miyatake, Tomohiro Sogabe, and Shao-Liang Zhang · 2018
Closest in time.
Linear convergence of first order methods for non-strongly convex optimization
Ion Necoara, Yurii Nesterov, and François Glineur · 2018
Closest in time.
Variational image regularization with Euler’s elastica using a discrete gradient scheme
Torbjørn Ringholm, Jasmina Lazic, and Carola-Bibiane Schonlieb · 2018
Closest in time.
Bregman Itoh–Abe methods for sparse optimisation
Martin Benning, Erlend Skaldehaug Riis, and Carola-Bibiane Schönlieb · 2020
Closest in time.
Conformal symplectic and relativistic optimization
Guilherme França, Jeremias Sulam, Daniel P Robinson, and René Vidal · 2020
Closest in time.
Analyzing random permutations for cyclic coordinate descent
Stephen J Wright and Ching-pei Lee · 2020
Closest in time.
Explicit stabilised gradient descent for faster strongly convex optimisation
Armin Eftekhari, Bart Vandereycken, Gilles Vilmart, and Konstantinos C. Zygalakis · 2021
Closest in time.
A geometric integration approach to nonsmooth, nonconvex optimisation
Erlend S. Riis, Matthias J. Ehrhardt, G. R. W. Quispel, and Carola-Bibiane Schönlieb · 2021
Closest in time.
Worst-case complexity of cyclic coordinate descent: $$o(nˆ2)$$gap with randomized version
Ruoyu Sun and Yinyu Ye · 2021
Closest in time.
A Lyapunov analysis of accelerated methods in optimization
Ashia C Wilson, Ben Recht, and Michael I Jordan · 2021
Closest in time.