A geometric integration approach to smooth optimization: foundations of the discrete gradient method
From MaRDI portal
Cites work
- A differential equation for modeling Nesterov's accelerated gradient method: theory and insights
- A first course in Sobolev spaces
- A Lyapunov analysis of accelerated methods in optimization
- A primal-dual approach for a total variation Wasserstein flow
- A variational perspective on accelerated methods in optimization
- Accelerated, parallel, and proximal coordinate descent
- Accuracy and Stability of Numerical Algorithms
- An algorithm for total variation minimization and applications
- An introduction to continuous optimization for imaging
- Analyzing random permutations for cyclic coordinate descent
- Bregman Itoh-Abe methods for sparse optimisation
- Cahn-Hilliard inpainting and a generalization for grayvalue images
- Characterizations of Łojasiewicz inequalities: Subgradient flows, talweg, convexity
- Conformal symplectic and relativistic optimization
- Coordinate descent algorithms
- Discrete gradient method: Derivative-free method for nonsmooth optimization
- Discrete gradient methods for preserving a first integral of an ordinary differential equation
- Discrete gradient methods for solving ODEs numerically while preserving a first integral
- Discrete gradient methods for solving variational image regularisation models
- Dissipative numerical schemes on Riemannian manifolds with applications to gradient flows
- Efficiency of coordinate descent methods on huge-scale optimization problems
- Energy-diminishing integration of gradient systems
- Explicit stabilised gradient descent for faster strongly convex optimisation
- From error bounds to the complexity of first-order descent methods for convex functions
- Geometric integration using discrete gradients
- Geometric Numerical Integration
- Hamiltonian-conserving discrete canonical equations based on variational difference quotients
- scientific article; zbMATH DE number 3850830 (Why is no real title available?)
- scientific article; zbMATH DE number 613868 (Why is no real title available?)
- scientific article; zbMATH DE number 979834 (Why is no real title available?)
- scientific article; zbMATH DE number 1022658 (Why is no real title available?)
- scientific article; zbMATH DE number 1973375 (Why is no real title available?)
- scientific article; zbMATH DE number 1460605 (Why is no real title available?)
- scientific article; zbMATH DE number 1487987 (Why is no real title available?)
- scientific article; zbMATH DE number 3313108 (Why is no real title available?)
- Implicit Functions and Solution Mappings
- Introductory lectures on convex optimization. A basic course.
- Linear convergence of first order methods for non-strongly convex optimization
- Numerical Optimization
- On the convergence of block coordinate descent type methods
- On the equivalence between SOR-type methods for linear systems and the discrete gradient methods for gradient systems
- On Upstream Differencing and Godunov-Type Schemes for Hyperbolic Conservation Laws
- Preserving energy resp. dissipation in numerical PDEs using the ``Average Vector Field method
- Preserving multiple first integrals by discrete gradients
- Random gradient-free minimization of convex functions
- Six lectures on the geometric integration of ODEs
- Time integration and discrete Hamiltonian systems
- Über Abbildung von Mannigfaltigkeiten.
- Variational image regularization with Euler's elastica using a discrete gradient scheme
- Worst-case complexity of cyclic coordinate descent: O(n^2) gap with randomized version
Cited in
(2)
This page was built for publication: A geometric integration approach to smooth optimization: foundations of the discrete gradient method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6915892)
