A primal-dual proximal point algorithm for constrained convex programs
type: Item
instance of: scholarly article
title: A primal-dual proximal point algorithm for constrained convex programs
zbMATH Open document ID: 1063.65044
author: Abdelouahed Hamdi
published in: Applied Mathematics and Computation
publication date: 2005-02-22T00:00:00Z
review text: The author proposes a mixed proximal multipliers method to solve convex constrained minimization problems. The proposed method resembles to the Bregman method of multipliers with a quadratic regularization of the augmented Lagrangian function.
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 2136171
zbMATH Keywords: proximal point method
zbMATH Keywords: Bregman functions
zbMATH Keywords: multipliers method
zbMATH Keywords: convex constrained minimization
zbMATH Keywords: quadratic regularization
MaRDI profile type: Publication
full work available at URL: j.amc.2003.12.137
OpenAlex ID: W2028754765
cites work: Enlarging the region of convergence of Newton's method for constrained optimization
cites work: A Generalized Proximal Point Algorithm for the Variational Inequality Problem in a Hilbert Space
cites work: Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
cites work: Q4840103
cites work: Multiplier and gradient methods
cites work: PARTIAL PROXIMAL METHOD OF MULTIPLIERS FOR CONVEX PROGRAMMING PROBLEMS
cites work: Proximal Minimization Methods with Generalized Bregman Functions
cites work: Q4026938
cites work: Q5590418
cites work: Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
cites work: Applications of the method of partial inverses to convex programming: Decomposition
cites work: Implementing proximal point methods for linear programming
DOI: 10.1016/J.AMC.2003.12.137
description: scientific article; zbMATH DE number 2136171