Efficient proximal point algorithm for convex composite optimization

MaRDI QIDQ4985864zbMATH OpenFDO

Authors Xudong Li

Publication date 26 April 2021

zbMATH Keywords

composite optimizationproximal point algorithmsemismooth Newton method

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Convex programming (90C25)

Recommendations

• Common fixed points of an infinite family of nonexpansive mappings in uniformly convex metric spaces
• An accelerated inexact proximal point algorithm for convex minimization
• Proximal Newton-type methods for minimizing composite functions
• Mirror Prox algorithm for multi-term composite minimization and semi-separable problems
• How good are the proximal point algorithms?

Cited in

(1)

• The proximal point algorithm for the P₀ complementarity problem

This page was built for publication: Efficient proximal point algorithm for convex composite optimization

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