scientific article; zbMATH DE number 2042705
Let \(T\) be a maximal monotone operator on a real Hilbert space. The inertial proximal method for finding a zero of \(T\) generates a sequence \(\{x_k\}\) as follows: given \(x_{k-1}\) and \(x_k \in H\) and two parameters \(\alpha_k \in [0,1)\) and \(\lambda_k >0\), find \(x_{k+1} \in H\) such that \[ \lambda_k T(x_{k+1}) +x_{k+1}-x_k - \alpha_k(x_k-x_{k-1})\ni 0. \] In order to obtain an implementable algorithm, the authors replace in the previous relation, \(T(x_{k+1})\) by an enlargement \(T^{\varepsilon}(x_{k+1})\). Then for the sequence generated by the resulting algorithm, they prove the weak convergence and the strong convergence to a zero of \(T\). In the second part, the particular case of convex minimization is examined. This time, \(T^{\varepsilon}\) is replaced by \(\partial_{\varepsilon}f\), the \(\varepsilon\)-subdifferential of \(f\), and, when \(f\) is nonsmooth, the function \(f\) itself is approximated by a monotone decreasing sequence \(\{f_k\}\) of proper closed convex functions such that \(f=\) cl\((\inf_k\,f_k)\). A weak convergence theorem is proven for the resulting algorithm.
- Approximate proximal point algorithms for finding zeroes of maximal monotone operators in Hilbert spaces
- scientific article; zbMATH DE number 2113076
- Inexact inertial proximal algorithm for maximal monotone operators
- A projection approximate proximal algorithm for maximal monotone operators
- A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
- Fixed point iterations coupled with relaxation factors and inertial effects
- Modified Tseng's extragradient algorithms for variational inequality problems
- Parallel iterative methods for solving the common null point problem in Banach spaces
- An inertial method for solving split common fixed point problems
- Proximal primal-dual best approximation algorithm with memory
- Modified subgradient extragradient method for variational inequality problems
- A novel inertial projection and contraction method for solving pseudomonotone variational inequality problems
- Strong convergence of the modified inertial extragradient method with line-search process for solving variational inequality problems in Hilbert spaces
- Convergence results of two-step inertial proximal point algorithm
- An inertial-type algorithm for approximation of solutions of Hammerstein integral inclusions in Hilbert spaces
- An inertial self-adaptive algorithm for the generalized split common null point problem in Hilbert spaces
- New strong convergence theorem of the inertial projection and contraction method for variational inequality problems
- A new strong convergence for solving split variational inclusion problems
- Regularization inertial proximal point algorithm for common solutions of a finite family of inverse-strongly monotone equations
- Two strong convergence theorems for the common null point problem in Banach spaces
- A family of inertial derivative-free projection methods for constrained nonlinear pseudo-monotone equations with applications
- Self adaptive iterative algorithm for solving variational inequality problems and fixed point problems in Hilbert spaces
- Inexact inertial proximal algorithm for maximal monotone operators
- A general inertial proximal point algorithm for mixed variational inequality problem
- Inertial proximal ADMM for linearly constrained separable convex optimization
- scientific article; zbMATH DE number 1306968 (Why is no real title available?)
- A perturbed projection algorithm with inertial technique for split feasibility problem
- scientific article; zbMATH DE number 2113076 (Why is no real title available?)
- Bundle methods for maximal monotone operators
- Convergence analysis of a parallel projection algorithm for solving convex feasibility problems
- An inertial proximal alternating direction method of multipliers for nonconvex optimization
- Convergence analysis of new inertial method for the split common null point problem
- New self-adaptive algorithms and inertial self-adaptive algorithms for the split variational inclusion problems in Hilbert space
- Weak and linear convergence of a generalized proximal point algorithm with alternating inertial steps for a monotone inclusion problem
- New algorithms for the split variational inclusion problems and application to split feasibility problems
- An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping
- A generalized proximal point algorithm with new step size update for solving monotone variational inequalities in real Hilbert spaces
- Inertial proximal point algorithm for the split common solution problem of monotone operator equations
- Perturbation Resilience of Self-Adaptive Step-Size Algorithms for Solving Split Variational Inclusion Problems and their Applications
- Strongly convergent inertial proximal point algorithm without on-line rule
- Generalized proximal point algorithms with correction terms and extrapolation
- Three-operator reflected forward-backward splitting algorithm with double inertial effects
- An inertial three-term hybrid CG-based projection method for constrained nonlinear pseudo-Monotone equations with applications
- A new version of forward-backward-forward splitting algorithm for monotone inclusions
- Convergence results for proximal point algorithm with inertial and correction terms
- New splitting algorithm with three inertial steps for three-operator monotone inclusion problems
- A modified self-adaptive inertial Tseng algorithm for solving a quasimonotone variational inequality and fixed point problems in real Hilbert space
- Self adaptive viscosity algorithm for solving variational inequality problem in Hilbert spaces
- New accelerated splitting algorithm for monotone inclusion problems
- A Bregman-type improved ADMM method with extrapolation and its linear variant for nonconvex and nonsmooth optimization
- A sequential complete inertial Bregman ADMM for multi-block nonconvex problems
- Convergence analysis of multi-block symmetric two-step inertial ADMM for nonconvex consensus problem
- A new inertial-type hybrid projection-proximal algorithm for monotone inclusions
- Inertial iterative process for fixed points of certain quasi-nonexpansive mappings
- Regularized and inertial algorithms for common fixed points of nonlinear operators
- Convergence theorems for inertial KM-type algorithms
- Regularization inertial proximal point algorithm for monotone hemicontinuous mapping and inverse strongly monotone mappings in Hilbert spaces
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4450552)