Convergence analysis of the relaxed proximal point algorithm

DOI10.1155/2013/912846zbMath1470.90081OpenAlexW2107390182WikidataQ58917719 ScholiaQ58917719MaRDI QIDQ2319250

Yanfei You, Min Li

Publication date: 16 August 2019

Published in: Abstract and Applied Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2013/912846

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Variational inequalities (49J40) Monotone operators and generalizations (47H05) Iterative procedures involving nonlinear operators (47J25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Gradient methods for minimizing composite functions
• A dual algorithm for the solution of nonlinear variational problems via finite element approximation
• Network economics: a variational inequality approach
• A proximal point algorithm revisit on the alternating direction method of multipliers
• On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
• Monotone Operators and the Proximal Point Algorithm
• Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
• Modified Lagrangians in convex programming and their generalizations
• Engineering and Economic Applications of Complementarity Problems
• Finite-Dimensional Variational Inequalities and Complementarity Problems

This page was built for publication: Convergence analysis of the relaxed proximal point algorithm