How good are the proximal point algorithms?

DOI10.1080/01630568708816257MaRDI QIDQ3777808zbMATH OpenOpenAlexFDO

Authors Allen A. Goldstein, I. Bert Russak

Publication date 1987

Published in Numerical Functional Analysis and Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/01630568708816257

zbMATH Keywords

gradient minimizationproximal point algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Analysis of algorithms and problem complexity (68Q25) Convex programming (90C25) Methods of successive quadratic programming type (90C55)

Recommendations

• Some remarks on the proximal point algorithm
• The proximal point algorithm revisited
• How good are projection methods for convex feasibility problems?
• On the proximal point algorithm
• scientific article; zbMATH DE number 4043635
• A proximal point algorithm revisited and extended
• The developments of proximal point algorithms
• Comments on ``The proximal point algorithm revisited
• Coupling the proximal point algorithm with approximation methods
• Proximal point algorithm, Douglas-Rachford algorithm and alternating projections: a case study

Cites work

• Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
• scientific article; zbMATH DE number 3302906 (Why is no real title available?)
• Monotone Operators and the Proximal Point Algorithm
• Submonotone mappings and the proximal point algorithm

Cited in

(2)

• Efficient proximal point algorithm for convex composite optimization
• Local search proximal algorithms as decision dynamics with costs to move

This page was built for publication: How good are the proximal point algorithms?

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