Heavy-ball method in nonconvex optimization problems
From MaRDI portal
Publication:5963275
DOI10.1007/BF01128757zbMath1331.90056MaRDI QIDQ5963275
Publication date: 7 March 2016
Published in: Computational Mathematics and Modeling (Search for Journal in Brave)
Related Items
Block delayed Majorize-Minimize subspace algorithm for large scale image restoration * ⋮ Local convergence of the heavy-ball method and iPiano for non-convex optimization ⋮ An inertial Bregman generalized alternating direction method of multipliers for nonconvex optimization ⋮ Inertial Proximal Alternating Linearized Minimization (iPALM) for Nonconvex and Nonsmooth Problems ⋮ Techniques for gradient-based bilevel optimization with non-smooth lower level problems ⋮ New acceleration factors of the Krasnosel'skiĭ-Mann iteration ⋮ iPiasco: inertial proximal algorithm for strongly convex optimization ⋮ Convergence of the Momentum Method for Semialgebraic Functions with Locally Lipschitz Gradients ⋮ Behavior of accelerated gradient methods near critical points of nonconvex functions ⋮ A unified surface geometric framework for feature-aware denoising, hole filling and context-aware completion ⋮ A refined inertial DC algorithm for DC programming ⋮ A forward-backward algorithm with different inertial terms for structured non-convex minimization problems ⋮ Accelerated stochastic variance reduction for a class of convex optimization problems ⋮ Unifying Abstract Inexact Convergence Theorems and Block Coordinate Variable Metric iPiano ⋮ Convergence rates for an inertial algorithm of gradient type associated to a smooth non-convex minimization ⋮ Momentum and stochastic momentum for stochastic gradient, Newton, proximal point and subspace descent methods ⋮ Wasserstein Dictionary Learning: Optimal Transport-Based Unsupervised Nonlinear Dictionary Learning ⋮ An inertial algorithm for DC programming ⋮ A dynamical view of nonlinear conjugate gradient methods with applications to FFT-based computational micromechanics ⋮ An inertial proximal partially symmetric ADMM-based algorithm for linearly constrained multi-block nonconvex optimization problems with applications ⋮ An adaptive Polyak heavy-ball method ⋮ Distributed Stochastic Inertial-Accelerated Methods with Delayed Derivatives for Nonconvex Problems
Cites Work
This page was built for publication: Heavy-ball method in nonconvex optimization problems
