A generic online acceleration scheme for optimization algorithms via relaxation and inertia

DOI10.1080/10556788.2017.1396601zbMath1407.65062arXiv1603.05398OpenAlexW2599455075WikidataQ122189039 ScholiaQ122189039MaRDI QIDQ4622890

No author found.

Publication date: 18 February 2019

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1603.05398

zbMATH Keywords

accelerationapplied optimization methodsrelaxation inertia

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Monotone operators and generalizations (47H05)

Related Items (37)

Relaxed inertial methods for solving the split monotone variational inclusion problem beyond co-coerciveness ⋮ Computing dynamic user equilibrium on large-scale networks without knowing global parameters ⋮ Accelerated methods with fastly vanishing subgradients for structured non-smooth minimization ⋮ Viscosity and inertial algorithms for the split common fixed point problem with applications to compressed sensing ⋮ Convergence analysis of new inertial method for the split common null point problem ⋮ An alternated inertial method for pseudomonotone variational inequalities in Hilbert spaces ⋮ A novel bound on the convergence rate of ADMM for distributed optimization ⋮ Fast alternated inertial projection algorithms for pseudo-monotone variational inequalities ⋮ Relaxed inertial methods for solving split variational inequality problems without product space formulation ⋮ Relaxed inertial Tseng extragradient method for variational inequality and fixed point problems ⋮ Alternated and multi-step inertial approximation methods for solving convex bilevel optimization problems ⋮ Projection methods with alternating inertial steps for variational inequalities: weak and linear convergence ⋮ Relaxed viscosity-type iterative methods with application to compressed sensing ⋮ Alternated inertial algorithms for split feasibility problems ⋮ Convergence rate of a relaxed inertial proximal algorithm for convex minimization ⋮ On split monotone variational inclusion problem with multiple output sets with fixed point constraints ⋮ Fast optimization via inertial dynamics with closed-loop damping ⋮ Image restorations using a modified relaxed inertial technique for generalized split feasibility problems ⋮ Relaxed single projection methods for solving bilevel variational inequality problems in Hilbert spaces ⋮ Convergence of a relaxed inertial proximal algorithm for maximally monotone operators ⋮ Alternated inertial subgradient extragradient method for equilibrium problems ⋮ Shrinking projection methods for accelerating relaxed inertial Tseng-type algorithm with applications ⋮ Global and linear convergence of alternated inertial methods for split feasibility problems ⋮ Newton-like Inertial Dynamics and Proximal Algorithms Governed by Maximally Monotone Operators ⋮ Unnamed Item ⋮ On the proximal gradient algorithm with alternated inertia ⋮ On the optimal relaxation parameters of Krasnosel'ski–Mann iteration ⋮ On the interplay between acceleration and identification for the proximal gradient algorithm ⋮ Convergence Theorems and Convergence Rates for the General Inertial Krasnosel’skiǐ–Mann Algorithm ⋮ Multi-step inertial Krasnosel'skiǐ-Mann iteration with new inertial parameters arrays ⋮ New inertial relaxed method for solving split feasibilities ⋮ Convergence of relaxed inertial subgradient extragradient methods for quasimonotone variational inequality problems ⋮ Fast generalized Nash equilibrium seeking under partial-decision information ⋮ New inertial proximal gradient methods for unconstrained convex optimization problems ⋮ An inertial parallel and asynchronous forward-backward iteration for distributed convex optimization ⋮ Convergence of a relaxed inertial forward-backward algorithm for structured monotone inclusions ⋮ Multiply Accelerated Value Iteration for NonSymmetric Affine Fixed Point Problems and Application to Markov Decision Processes

Uses Software

• PESTO

Cites Work

• Unnamed Item
• Unnamed Item
• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• Smooth minimization of non-smooth functions
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Inertial Douglas-Rachford splitting for monotone inclusion problems
• Optimal rates of linear convergence of relaxed alternating projections and generalized Douglas-Rachford methods for two subspaces
• A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms
• On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm
• Smooth strongly convex interpolation and exact worst-case performance of first-order methods
• An inertial forward-backward algorithm for monotone inclusions
• Convergence theorems for inertial KM-type algorithms
• On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
• An adaptive accelerated proximal gradient method and its homotopy continuation for sparse optimization
• Adaptive restart for accelerated gradient schemes
• An inertial alternating direction method of multipliers
• The Rate of Convergence of Nesterov's Accelerated Forward-Backward Method is Actually Faster Than $1/k^2$
• Local Linear Convergence of ISTA and FISTA on the LASSO Problem
• Coefficient bounds for certain subclasses of analytic functions of complex order
• A Coordinate Descent Primal-Dual Algorithm and Application to Distributed Asynchronous Optimization
• Explicit Convergence Rate of a Distributed Alternating Direction Method of Multipliers
• Optimal Parameter Selection for the Alternating Direction Method of Multipliers (ADMM): Quadratic Problems
• Splitting Algorithms for the Sum of Two Nonlinear Operators
• Cyclically Monotone Linear Operators
• Analysis of Sum-Weight-Like Algorithms for Averaging in Wireless Sensor Networks
• On the Linear Convergence of the ADMM in Decentralized Consensus Optimization
• Weak Convergence of a Relaxed and Inertial Hybrid Projection-Proximal Point Algorithm for Maximal Monotone Operators in Hilbert Space
• Fast Alternating Direction Optimization Methods
• 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

This page was built for publication: A generic online acceleration scheme for optimization algorithms via relaxation and inertia