Some properties of generalized proximal point methods for quadratic and linear programming
type: Item
instance of: scholarly article
title: Some properties of generalized proximal point methods for quadratic and linear programming
zbMATH Open document ID: 0831.90092
DOI: 10.1007/BF02193058
published in: Journal of Optimization Theory and Applications
publication date: 1995-09-04T00:00:00Z
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 792457
zbMATH Keywords: proximal point method
zbMATH Keywords: convex optimization
zbMATH Keywords: Bregman functions
author: Alfredo Iusem
MaRDI profile type: Publication
cites work: Monotone Operators and the Proximal Point Algorithm
cites work: Q5580053
cites work: A relaxed version of Bregman's method for convex programming
cites work: Q3803964
cites work: Multiplicative iterative algorithms for convex programming
cites work: Proximal minimization algorithm with \(D\)-functions
cites work: Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
cites work: Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
cites work: On the convergence rate of entropic proximal optimization methods
cites work: Q3690580
cites work: Entropy-Like Proximal Methods in Convex Programming
cites work: Convex Analysis
cites work: Limiting behavior of the affine scaling continuous trajectories for linear programming problems
cites work: Limiting Behavior of Trajectories Generated by a Continuation Method for Monotone Complementarity Problems
cites work: Convergence Rate Analysis of Nonquadratic Proximal Methods for Convex and Linear Programming
cites work: A new polynomial-time algorithm for linear programming
cites work: On the convergence of the exponential multiplier method for convex programming
description: scientific article; zbMATH DE number 792457