scientific article; zbMATH DE number 1306982

zbMATH Open0930.65072MaRDI QIDQ4252829FDOQ4252829

Authors: Maijian Qian, James V. Burke 

Publication date: 2 November 1999

Title of this publication is not available (Why is that?)

Recommendations

• On the superlinear convergence of the variable metric proximal point algorithm using Broyden and BFGS matrix secant updating
• A Variable Metric Proximal Point Algorithm for Monotone Operators
• A Class of Inexact Variable Metric Proximal Point Algorithms
• Local Convergence of the Proximal Point Algorithm and Multiplier Methods Without Monotonicity

zbMATH Keywords

numerical experimentsconvex programminglocal convergencemaximal monotone operatoroptimization algorithmsBFGSmatrix secant methodsvariable metric proximal point algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Interior-point methods (90C51)

Cited In (4)

• An Asymptotically Superlinearly Convergent Semismooth Newton Augmented Lagrangian Method for Linear Programming
• On the superlinear convergence of the variable metric proximal point algorithm using Broyden and BFGS matrix secant updating
• Fast Moreau envelope computation I: Numerical algorithms
• The developments of proximal point algorithms

This page was built for publication:

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