Proximal primal-dual best approximation algorithm with memory
From MaRDI portal
Abstract: We propose a new modified primal-dual proximal best approximation method for solving convex not necessarily differentiable optimization problems. The novelty of the method relies on introducing memory by taking into account iterates computed in previous steps in the formulas defining current iterate. To this end we consider projections onto intersections of halfspaces generated on the basis of the current as well as the previous iterates. To calculate these projections we are using recently obtained closed-form expressions for projectors onto polyhedral sets. The resulting algorithm with memory inherits strong convergence properties of the original best approximation proximal primal-dual algorithm. Additionally, we compare our algorithm with the original (non-inertial) one with the help of the so called attraction property defined below. Extensive numerical experimental results on image reconstruction problems illustrate the advantages of including memory into the original algorithm.
Recommendations
- Asymptotics for some proximal-like method involving inertia and memory aspects
- Publication:3035147
- Method of conjugate subgradients with constrained memory
- Efficient primal-dual fixed point algorithms with dynamic stepsize for composite convex optimization problems
- A first-order primal-dual algorithm for convex problems with applications to imaging
Cites work
- scientific article; zbMATH DE number 1266748 (Why is no real title available?)
- scientific article; zbMATH DE number 2042705 (Why is no real title available?)
- scientific article; zbMATH DE number 2107573 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- A Douglas--Rachford Type Primal-Dual Method for Solving Inclusions with Mixtures of Composite and Parallel-Sum Type Monotone Operators
- A Note on the Paper by Eckstein and Svaiter on “General Projective Splitting Methods for Sums of Maximal Monotone Operators”
- A block coordinate variable metric forward-backward algorithm
- A double smoothing technique for solving unconstrained nondifferentiable convex optimization problems
- A family of projective splitting methods for the sum of two maximal monotone operators
- A fast dual proximal-gradient method for separable convex optimization with linear coupled constraints
- A general inertial proximal point algorithm for mixed variational inequality problem
- A parallel inertial proximal optimization method
- A parallel splitting method for coupled monotone inclusions
- A simplified form of block-iterative operator splitting and an asynchronous algorithm resembling the multi-block alternating direction method of multipliers
- A stochastic inertial forward–backward splitting algorithm for multivariate monotone inclusions
- ARock: an algorithmic framework for asynchronous parallel coordinate updates
- An inertial alternating direction method of multipliers
- An inertial forward-backward algorithm for monotone inclusions
- An inertial forward-backward-forward primal-dual splitting algorithm for solving monotone inclusion problems
- An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping
- Asynchronous block-iterative primal-dual decomposition methods for monotone inclusions
- Best approximation from the Kuhn-Tucker set of composite monotone inclusions
- Closed-Form Expressions for Projectors onto Polyhedral Sets in Hilbert Spaces
- Convergence of a splitting inertial proximal method for monotone operators
- Convergence theorems for inertial KM-type algorithms
- Convex analysis and monotone operator theory in Hilbert spaces
- Dualization of Generalized Equations of Maximal Monotone Type
- Forcing strong convergence of proximal point iterations in a Hilbert space
- General Projective Splitting Methods for Sums of Maximal Monotone Operators
- Inertial Douglas-Rachford splitting for monotone inclusion problems
- Inertial iterative process for fixed points of certain quasi-nonexpansive mappings
- Inertial proximal ADMM for linearly constrained separable convex optimization
- Local and global convergence of a general inertial proximal splitting scheme for minimizing composite functions
- Mirror Prox algorithm for multi-term composite minimization and semi-separable problems
- Modified extragradient method for variational inequalities and verification of solution existence
- Modified hybrid projection methods for finding common solutions to variational inequality problems
- NUMERICAL APPROACH TO A STATIONARY SOLUTION OF A SECOND ORDER DISSIPATIVE DYNAMICAL SYSTEM
- Nonlinear total variation based noise removal algorithms
- On the convergence rate improvement of a primal-dual splitting algorithm for solving monotone inclusion problems
- On the ergodic convergence rates of a first-order primal-dual algorithm
- Primal-dual splitting algorithm for solving inclusions with mixtures of composite, Lipschitzian, and parallel-sum type monotone operators
- Regularized and inertial algorithms for common fixed points of nonlinear operators
- Solving composite monotone inclusions in reflexive Banach spaces by constructing best Bregman approximations from their Kuhn-Tucker set
- Solving coupled composite monotone inclusions by successive Fejér approximations of their Kuhn-Tucker set
- Strong Convergence of Block-Iterative Outer Approximation Methods for Convex Optimization
- Strong convergence of a splitting projection method for the sum of maximal monotone operators
- Strong convergence of a splitting proximal projection method for the sum of two maximal monotone operators
- Weak Convergence of a Relaxed and Inertial Hybrid Projection-Proximal Point Algorithm for Maximal Monotone Operators in Hilbert Space
- iPiano: inertial proximal algorithm for nonconvex optimization
- iPiasco: inertial proximal algorithm for strongly convex optimization
This page was built for publication: Proximal primal-dual best approximation algorithm with memory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1756584)
