A note on the convergence of an inertial version of a diagonal hybrid projection-point algorithm

DOI10.1080/02331930801951389zbMath1196.90095OpenAlexW1989497465MaRDI QIDQ3577847

Miguel Carrasco, K. Pichard

Publication date: 26 July 2010

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10533/145010

zbMATH Keywords

global convergencerelaxationhybrid methodproximal pointinertial termparametric approximationdiagonal iteration

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Interior-point methods (90C51)

Cites Work

• On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
• Convergence of some algorithms for convex minimization
• Coupling the proximal point algorithm with approximation methods
• A dynamical approach to convex minimization coupling approximation with the steepest descent method
• A UNIFIED FRAMEWORK FOR SOME INEXACT PROXIMAL POINT ALGORITHMS^*
• On the Convergence of the Proximal Point Algorithm for Convex Minimization
• Path-Following Methods for Linear Programming
• Monotone Operators and the Proximal Point Algorithm
• On the Minimizing Property of a Second Order Dissipative System in Hilbert Spaces
• Weak Convergence of a Relaxed and Inertial Hybrid Projection-Proximal Point Algorithm for Maximal Monotone Operators in Hilbert Space
• Convergence of a Hybrid Projection-Proximal Point Algorithm Coupled with Approximation Methods in Convex Optimization
• Weak convergence of the sequence of successive approximations for nonexpansive mappings