Asymptotic Convergence Analysis of Some Inexact Proximal Point Algorithms for Minimization

DOI10.1137/S1052623494255923MaRDI QIDQ4895613zbMATHFDO

Authors Ciyou Zhu

Publication date 7 April 1997

Published in SIAM Journal on Optimization (Search for Journal in Brave)

zbMATH Keywords

convex minimizationasymptotic convergencebundle methodlinear convergenceinexact proximal point algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20)

Recommendations

• scientific article; zbMATH DE number 1062747
• Inexact and accelerated proximal point algorithms
• Inexact Variants of the Proximal Point Algorithm without Monotonicity
• On general inexact proximal point algorithms and their contributions to linear convergence analysis
• On the Convergence of the Proximal Point Algorithm for Convex Minimization

Cited in

(8)

• Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization
• scientific article; zbMATH DE number 1062747 (Why is no real title available?)
• On finite termination of an inexact proximal point algorithm
• Inexact and accelerated proximal point algorithms
• scientific article; zbMATH DE number 5586189 (Why is no real title available?)
• Inexact proximal point algorithms and descent methods in optimization
• Asymptotic Convergence Analysis of a New Class of Proximal Point Methods
• Some new step-size rules for optimization problems

This page was built for publication: Asymptotic Convergence Analysis of Some Inexact Proximal Point Algorithms for Minimization

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