iPiasco: inertial proximal algorithm for strongly convex optimization

DOI10.1007/S10851-015-0565-0zbMath1327.90219OpenAlexW1984481261MaRDI QIDQ890114

Peter Ochs, Thomas Pock, Thomas Brox

Publication date: 9 November 2015

Published in: Journal of Mathematical Imaging and Vision (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10851-015-0565-0

zbMATH Keywords

convergence analysisstrongly convex optimizationheavy-ball methodinertial proximal method

Mathematics Subject Classification ID

Convex programming (90C25) Computing methodologies for image processing (68U10)

Related Items (53)

An inertial proximal alternating direction method of multipliers for nonconvex optimization ⋮ New inertial projection methods for solving multivalued variational inequality problems beyond monotonicity ⋮ A General Inertial Proximal Point Algorithm for Mixed Variational Inequality Problem ⋮ Variational methods for normal integration ⋮ Self-adaptive inertial subgradient extragradient scheme for pseudomonotone variational inequality problem ⋮ Inertial Proximal ADMM for Linearly Constrained Separable Convex Optimization ⋮ Reflected three-operator splitting method for monotone inclusion problem ⋮ Linear Convergence for Quasi-Variational Inequalities with Inertial Projection-Type Method ⋮ Bounded perturbation resilience of extragradient-type methods and their applications ⋮ An efficient projection-type method for monotone variational inequalities in Hilbert spaces ⋮ First-order frameworks for continuous Newton-like dynamics governed by maximally monotone operators ⋮ Inexact accelerated augmented Lagrangian methods ⋮ Unnamed Item ⋮ Convergence analysis for the proximal split feasibility problem using an inertial extrapolation term method ⋮ A strong convergence result involving an inertial forward-backward algorithm for monotone inclusions ⋮ General inertial proximal gradient method for a class of nonconvex nonsmooth optimization problems ⋮ FISTA is an automatic geometrically optimized algorithm for strongly convex functions ⋮ Inertial projection and contraction algorithms for variational inequalities ⋮ A subgradient extragradient algorithm with inertial effects for solving strongly pseudomonotone variational inequalities ⋮ Unnamed Item ⋮ An inertial type iterative method with Armijo linesearch for nonmonotone equilibrium problems ⋮ Unnamed Item ⋮ Approximating solutions of split equality of some nonlinear optimization problems using an inertial algorithm ⋮ Unnamed Item ⋮ Inertial subgradient extragradient algorithms with line-search process for solving variational inequality problems and fixed point problems ⋮ Iterative method with inertial for variational inequalities in Hilbert spaces ⋮ Inertial extragradient method via viscosity approximation approach for solving equilibrium problem in Hilbert space ⋮ Convergence of projection and contraction algorithms with outer perturbations and their applications to sparse signals recovery ⋮ Approximate versions of proximal iteratively reweighted algorithms including an extended IP-ICMM for signal and image processing problems ⋮ Cyclic schemes for PDE-based image analysis ⋮ Proximal primal-dual best approximation algorithm with memory ⋮ An introduction to continuous optimization for imaging ⋮ Convergence analysis of an inertial accelerated iterative algorithm for solving split variational inequality problem ⋮ Momentum and stochastic momentum for stochastic gradient, Newton, proximal point and subspace descent methods ⋮ Convergence Rate Analysis of Inertial Krasnoselskii–Mann Type Iteration with Applications ⋮ Inertial extragradient algorithms for strongly pseudomonotone variational inequalities ⋮ New convergence results for inertial Krasnoselskii-Mann iterations in Hilbert spaces with applications ⋮ Inertial projection-type methods for solving quasi-variational inequalities in real Hilbert spaces ⋮ Convergence of relaxed inertial subgradient extragradient methods for quasimonotone variational inequality problems ⋮ A Gauss-Seidel type inertial proximal alternating linearized minimization for a class of nonconvex optimization problems ⋮ iPiasco ⋮ Proximal type algorithms involving linesearch and inertial technique for split variational inclusion problem in hilbert spaces with applications ⋮ An inertial parallel and asynchronous forward-backward iteration for distributed convex optimization ⋮ Convergence analysis of projection method for variational inequalities ⋮ Weak and strong convergence of inertial Tseng's extragradient algorithms for solving variational inequality problems ⋮ Inertial proximal incremental aggregated gradient method with linear convergence guarantees ⋮ An inertial proximal partially symmetric ADMM-based algorithm for linearly constrained multi-block nonconvex optimization problems with applications ⋮ An inertial extrapolation method for convex simple bilevel optimization ⋮ A Second Order Dynamical System and Its Discretization for Strongly Pseudo-monotone Variational Inequalities ⋮ Weak convergence for variational inequalities with inertial-type method ⋮ An adaptive Polyak heavy-ball method ⋮ Distributed Stochastic Inertial-Accelerated Methods with Delayed Derivatives for Nonconvex Problems ⋮ Self-Adaptive Inertial Projection and Contraction Algorithm for Monotone Variational Inequality

Uses Software

• iPiano
• TwIST

Cites Work

• Unnamed Item
• Unnamed Item
• Nonlinear total variation based noise removal algorithms
• Smooth minimization of non-smooth functions
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• On the ergodic convergence rates of a first-order primal-dual algorithm
• Gradient methods for minimizing composite functions
• Dualization of signal recovery problems
• Introductory lectures on convex optimization. A basic course.
• Convergence of a splitting inertial proximal method for monotone operators
• A first-order primal-dual algorithm for convex problems with applications to imaging
• Performance of first-order methods for smooth convex minimization: a novel approach
• iPiano: Inertial Proximal Algorithm for Nonconvex Optimization
• On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
• Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems
• Fast Multiple-Splitting Algorithms for Convex Optimization
• An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
• Weak Convergence of a Relaxed and Inertial Hybrid Projection-Proximal Point Algorithm for Maximal Monotone Operators in Hilbert Space
• A Dynamical Approach to an Inertial Forward-Backward Algorithm for Convex Minimization
• Signal Recovery by Proximal Forward-Backward Splitting
• Some methods of speeding up the convergence of iteration methods
• Convex analysis and monotone operator theory in Hilbert spaces
• An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping
• Heavy-ball method in nonconvex optimization problems

This page was built for publication: iPiasco: inertial proximal algorithm for strongly convex optimization