A generalized proximal-point method for convex optimization problems in Hilbert spaces

DOI10.1080/02331934.2017.1349127MaRDI QIDQ4598825zbMATH OpenOpenAlexFDO

Authors Christian Kanzow, Daniel Steck

Publication date 15 December 2017

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331934.2017.1349127

zbMATH Keywords

augmented Lagrangian methodgeneralized proximal-point methodglobal convergenceTikhonov regularization

Mathematics Subject Classification ID

Convex programming (90C25) Programming in abstract spaces (90C48)

Recommendations

• On a proximal point method for convex optimization in banach spaces
• Strict convex regularizations, proximal points and augmented lagrangians
• Inertial proximal point regularization algorithm for unconstrained vector convex optimization problems
• Strong convergence of a proximal-based method for convex optimization
• scientific article; zbMATH DE number 1042861

Cited in

(7)

• Augmented Lagrangian and exact penalty methods for quasi-variational inequalities
• Generalized proximal point algorithm for convex optimization
• scientific article; zbMATH DE number 5906517 (Why is no real title available?)
• Strict convex regularizations, proximal points and augmented lagrangians
• Hybrid Moreau’s Proximal Algorithms and Convergence Theorems for Minimization Problems in Hilbert Spaces with Applications
• On Error Bounds and Multiplier Methods for Variational Problems in Banach Spaces
• Safeguarded augmented Lagrangian methods in Banach spaces

Describes a project that uses

Uses Software

• LANCELOT

This page was built for publication: A generalized proximal-point method for convex optimization problems in Hilbert spaces

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