Accelerated proximal point method for maximally monotone operators
From MaRDI portal
Abstract: This paper proposes an accelerated proximal point method for maximally monotone operators. The proof is computer-assisted via the performance estimation problem approach. The proximal point method includes various well-known convex optimization methods, such as the proximal method of multipliers and the alternating direction method of multipliers, and thus the proposed acceleration has wide applications. Numerical experiments are presented to demonstrate the accelerating behaviors.
Recommendations
- A new approximate proximal point algorithm for maximal monotone operator
- A proximal point method for the sum of maximal monotone operators
- Accelerated proximal algorithms with a correction term for monotone inclusions
- A projection approximate proximal algorithm for maximal monotone operators
- Modified approximate proximal point algorithms for finding roots of maximal monotone operators
- On the proximal point algorithm for strongly monotone operators
- An accelerated inexact proximal point algorithm for convex minimization
- An Accelerated Inexact Proximal Point Method for Solving Nonconvex-Concave Min-Max Problems
- Approximate proximal point algorithms for finding zeroes of maximal monotone operators in Hilbert spaces
- Strong convergence of a modified proximal-point algorithm for maximal monotone operators
Cites work
- scientific article; zbMATH DE number 4079168 (Why is no real title available?)
- scientific article; zbMATH DE number 3574917 (Why is no real title available?)
- scientific article; zbMATH DE number 3309655 (Why is no real title available?)
- scientific article; zbMATH DE number 3341597 (Why is no real title available?)
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A differential equation for modeling Nesterov's accelerated gradient method: theory and insights
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A first-order primal-dual algorithm for convex problems with applications to imaging
- A general framework for a class of first order primal-dual algorithms for convex optimization in imaging science
- A generalized proximal point algorithm and its convergence rate
- A primer on monotone operator methods
- Adaptive restart for accelerated gradient schemes
- An inertial forward-backward algorithm for monotone inclusions
- An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping
- An introduction to continuous optimization for imaging
- An optimal variant of Kelley's cutting-plane method
- Another look at the fast iterative shrinkage/thresholding algorithm (FISTA)
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Catalyst acceleration for first-order convex optimization: from theory to practice
- Convergence analysis of primal-dual algorithms for a saddle-point problem: from contraction perspective
- Convergence of a relaxed inertial forward-backward algorithm for structured monotone inclusions
- Convergence of a relaxed inertial proximal algorithm for maximally monotone operators
- Convergence of inertial dynamics and proximal algorithms governed by maximally monotone operators
- Convergence rate analysis of several splitting schemes
- Convex analysis and monotone operator theory in Hilbert spaces
- Efficient first-order methods for convex minimization: a constructive approach
- Exact worst-case performance of first-order methods for composite convex optimization
- Fast Proximal Methods via Time Scaling of Damped Inertial Dynamics
- Fast alternating direction optimization methods
- Faster convergence rates of relaxed Peaceman-Rachford and ADMM under regularity assumptions
- First-order optimization algorithms via inertial systems with Hessian driven damping
- Generalizing the optimized gradient method for smooth convex minimization
- Gradient methods for minimizing composite functions
- Graph implementations for nonsmooth convex programs
- Modified Lagrangians in convex programming and their generalizations
- Monotone (nonlinear) operators in Hilbert space
- Monotone Operators and the Proximal Point Algorithm
- Monotone operator theory in convex optimization
- Multiplier and gradient methods
- New Proximal Point Algorithms for Convex Minimization
- On parallel complexity of nonsmooth convex optimization
- On the Convergence of the Proximal Point Algorithm for Convex Minimization
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm
- On the convergence rate of the Halpern-iteration
- On the ergodic convergence rates of a first-order primal-dual algorithm
- On the monotonicity of the gradient of a convex function
- Operator splitting performance estimation: tight contraction factors and optimal parameter selection
- Optimized first-order methods for smooth convex minimization
- Optimizing the efficiency of first-order methods for decreasing the gradient of smooth convex functions
- Performance of first-order methods for smooth convex minimization: a novel approach
- Produits infinis de resolvantes
- Proximité et dualité dans un espace hilbertien
- Smooth strongly convex interpolation and exact worst-case performance of first-order methods
- Some methods of speeding up the convergence of iteration methods
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Tight sublinear convergence rate of the proximal point algorithm for maximal monotone inclusion problems
Cited in
(29)- First order inertial optimization algorithms with threshold effects associated with dry friction
- Fast optimization via inertial dynamics with closed-loop damping
- Fast convergence of generalized forward-backward algorithms for structured monotone inclusions
- Provably faster gradient descent via long steps
- Incorporating history and deviations in forward-backward splitting
- A novel method for hierarchical variational inequality with split common fixed point constraint
- [[:Publication:6091103|Fast Krasnosel’skiĭ–Mann Algorithm with a Convergence Rate of the Fixed Point Iteration of \(\boldsymbol{{ o} \left(\frac{1}Template:K \right)}\)]]
- Convergence of iterates for first-order optimization algorithms with inertia and Hessian driven damping
- Tight ergodic sublinear convergence rate of the relaxed proximal point algorithm for monotone variational inequalities
- Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022
- Optimal error bounds for non-expansive fixed-point iterations in normed spaces
- Proximal Splitting Algorithms for Convex Optimization: A Tour of Recent Advances, with New Twists
- Interpolation conditions for linear operators and applications to performance estimation problems
- PEPIT: computer-assisted worst-case analyses of first-order optimization methods in python
- From Halpern's fixed-point iterations to Nesterov's accelerated interpretations for root-finding problems
- Fast continuous dynamics inside the graph of subdifferentials of nonsmooth convex functions
- Applications of accelerated computational methods for quasi-nonexpansive operators to optimization problems
- Factor-\(\sqrt{2}\) acceleration of accelerated gradient methods
- Strongly convergent inertial proximal point algorithm without on-line rule
- Accelerated forward–backward algorithms for structured monotone inclusions
- Fast continuous dynamics inside the graph of maximally monotone operators
- An accelerated proximal alternating direction method of multipliers for optimal decentralized control of uncertain systems
- Accelerated minimax algorithms flock together
- Practical acceleration of the Condat-Vũ algorithm
- A novel inertial proximal contraction-type algorithm with self-adaptive step size for solving monotone variational inclusion problems
- Convergence results of two-step inertial proximal point algorithm
- Generalized proximal point algorithms with correction terms and extrapolation
- Branch-and-bound performance estimation programming: a unified methodology for constructing optimal optimization methods
- Principled analyses and design of first-order methods with inexact proximal operators
This page was built for publication: Accelerated proximal point method for maximally monotone operators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2235140)
