Asymptotic Convergence Analysis of Some Inexact Proximal Point Algorithms for Minimization

DOI10.1137/S1052623494255923zbMATH Open0859.65057MaRDI QIDQ4895613FDOQ4895613

Authors: Ciyou Zhu 

Publication date: 7 April 1997

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

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

zbMATH Keywords

convex minimizationasymptotic convergencebundle methodlinear convergenceinexact proximal point algorithm

Mathematics Subject Classification ID

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

Cited In (8)

• Some new step-size rules for optimization problems
• On finite termination of an inexact proximal point algorithm
• Title not available (Why is that?)
• Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization
• Title not available (Why is that?)
• Inexact and accelerated proximal point algorithms
• Asymptotic Convergence Analysis of a New Class of Proximal Point Methods
• Inexact proximal point algorithms and descent methods in optimization

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)