A relaxed approximate proximal point algorithm

DOI10.1007/S10479-004-5027-9MaRDI QIDQ1772967zbMATH OpenOpenAlexFDO

Authors Zhenhua Yang, Bingsheng He

Publication date 22 April 2005

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10479-004-5027-9

zbMATH Keywords

inexactmonotone operatorsproximal point algorithmsrelaxation

Mathematics Subject Classification ID

Monotone operators and generalizations (47H05) Variational and other types of inequalities involving nonlinear operators (general) (47J20) Variational inequalities (49J40) Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• A new approximate proximal point algorithm for maximal monotone operator
• Approximate proximal point algorithms for finding zeroes of maximal monotone operators in Hilbert spaces
• An approximate proximal point algorithm for maximal monotone inclusion problems
• A projection approximate proximal algorithm for maximal monotone operators
• Convergence of over-relaxed contraction-proximal point algorithm in Hilbert spaces

Cites work

• A new accuracy criterion for approximate proximal point algorithms
• Approximate iterations in Bregman-function-based proximal algorithms
• Engineering and Economic Applications of Complementarity Problems
• Enlargement of monotone operators with applications to variational inequalities
• scientific article; zbMATH DE number 3852340 (Why is no real title available?)
• scientific article; zbMATH DE number 3398324 (Why is no real title available?)
• Inexact implicit methods for monotone general variational inequalities
• Monotone Operators and the Proximal Point Algorithm
• Multiplier and gradient methods
• Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
• On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators

Cited in

(16)

• An abstract proximal point algorithm
• A modified proximal point algorithm with errors for approximating solution of the general variational inclusion
• The developments of proximal point algorithms
• Relaxed augmented Lagrangian-based proximal point algorithms for convex optimization with linear constraints
• Weak convergence of a hybrid type method with errors for a maximal monotone mapping in Banach spaces
• Uniformity and inexact version of a proximal method for metrically regular mappings
• A unified and tight linear convergence analysis of the relaxed proximal point algorithm
• Revisit the over-relaxed proximal point algorithm
• An approximate proximal point algorithm for maximal monotone inclusion problems
• The indefinite proximal point algorithms for maximal monotone operators
• Stability analysis of Gauss-type proximal point method for metrically regular mappings
• Convergence of over-relaxed contraction-proximal point algorithm in Hilbert spaces
• Approximation of Fixed Points of Metrically Regular Mappings
• A new approximate proximal point algorithm for maximal monotone operator
• An algorithm for solving the general variational inclusion involving \(A\)-monotone operators
• A Lyusternik-Graves theorem for the proximal point method

This page was built for publication: A relaxed approximate proximal point algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1772967)