iPiasco: inertial proximal algorithm for strongly convex optimization
type: Item
instance of: scholarly article
title: iPiasco: inertial proximal algorithm for strongly convex optimization
zbMATH Open document ID: 1327.90219
author: Peter Ochs
author: Thomas Pock
author: Thomas Brox
published in: Journal of Mathematical Imaging and Vision
publication date: 2015-11-09T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 68U10
zbMATH DE Number: 6506309
zbMATH Keywords: heavy-ball method
zbMATH Keywords: strongly convex optimization
zbMATH Keywords: inertial proximal method
zbMATH Keywords: convergence analysis
describes a project that uses: iPiano
describes a project that uses: TwIST
MaRDI profile type: Publication
full work available at URL: s10851-015-0565-0
OpenAlex ID: W1984481261
cites work: Weak Convergence of a Relaxed and Inertial Hybrid Projection-Proximal Point Algorithm for Maximal Monotone Operators in Hilbert Space
cites work: An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping
cites work: A Dynamical Approach to an Inertial Forward-Backward Algorithm for Convex Minimization
cites work: Convex analysis and monotone operator theory in Hilbert spaces
cites work: A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
cites work: A first-order primal-dual algorithm for convex problems with applications to imaging
cites work: On the ergodic convergence rates of a first-order primal-dual algorithm
cites work: Signal Recovery by Proximal Forward-Backward Splitting
cites work: Dualization of signal recovery problems
cites work: An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
cites work: Performance of first-order methods for smooth convex minimization: a novel approach
cites work: Fast multiple-splitting algorithms for convex optimization
cites work: On the \(O(1/n)\) convergence rate of the Douglas-Rachford alternating direction method
cites work: Heavy-ball method in nonconvex optimization problems
cites work: Convergence of a splitting inertial proximal method for monotone operators
cites work: Q3320132
cites work: Introductory lectures on convex optimization. A basic course.
cites work: Smooth minimization of non-smooth functions
cites work: Efficiency of coordinate descent methods on huge-scale optimization problems
cites work: Gradient methods for minimizing composite functions
cites work: iPiano: inertial proximal algorithm for nonconvex optimization
cites work: Some methods of speeding up the convergence of iteration methods
cites work: Nonlinear total variation based noise removal algorithms
cites work: Q5187067
DOI: 10.1007/S10851-015-0565-0
description: scientific article; zbMATH DE number 6506309