On the superlinear convergence of the variable metric proximal point algorithm using Broyden and BFGS matrix secant updating
From MaRDI portal
Publication:1591362
DOI10.1007/s101070000151zbMath1028.90086MaRDI QIDQ1591362
Publication date: 27 January 2004
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
global convergencemaximal monotone operatorsuperlinear convergencevariable metricproximal point methods
Convex programming (90C25) Methods of quasi-Newton type (90C53) Methods of successive quadratic programming type (90C55)
Related Items (20)
Forward-backward quasi-Newton methods for nonsmooth optimization problems ⋮ Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization ⋮ An ODE-like nonmonotone method for nonsmooth convex optimization ⋮ On the resolution of the variational inequalities of the first and the second kind as equations obtained by explicit Moreau-Yosida regularizations ⋮ The developments of proximal point algorithms ⋮ Fast Moreau envelope computation I: Numerical algorithms ⋮ A \(J\)-symmetric quasi-Newton method for minimax problems ⋮ Conjugate gradient type methods for the nondifferentiable convex minimization ⋮ An Asymptotically Superlinearly Convergent Semismooth Newton Augmented Lagrangian Method for Linear Programming ⋮ A modified scaled memoryless BFGS preconditioned conjugate gradient algorithm for nonsmooth convex optimization ⋮ A conceptual conjugate epi-projection algorithm of convex optimization: superlinear, quadratic and finite convergence ⋮ Nonsymmetric proximal point algorithm with moving proximal centers for variational inequalities: convergence analysis ⋮ Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach ⋮ On the convergence of a multigrid method for Moreau-regularized variational inequalities of the second kind ⋮ Proximal-point algorithm using a linear proximal term ⋮ An Inexact Variable Metric Proximal Point Algorithm for Generic Quasi-Newton Acceleration ⋮ Globally convergent BFGS method for nonsmooth convex optimization ⋮ The indefinite proximal point algorithms for maximal monotone operators ⋮ A splitting algorithm for coupled system of primal-dual monotone inclusions ⋮ Tseng’s Algorithm with Extrapolation from the past Endowed with Variable Metrics and Error Terms
This page was built for publication: On the superlinear convergence of the variable metric proximal point algorithm using Broyden and BFGS matrix secant updating