Nonlinear proximal decomposition method for convex programming
type: Item
instance of: scholarly article
title: Nonlinear proximal decomposition method for convex programming
zbMATH Open document ID: 0982.90036
DOI: 10.1023/A:1004655531273
author: M. Kyono
author: Masao Fukushima
published in: Journal of Optimization Theory and Applications
publication date: 2001-01-29T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 49M27
zbMATH DE Number: 1558309
zbMATH Keywords: nonlinear proximal decomposition method
zbMATH Keywords: bregman functions
zbMATH Keywords: convex programming
zbMATH Keywords: nonlinear proximal point algorithm
MaRDI profile type: Publication
cites work: Monotone Operators and the Proximal Point Algorithm
cites work: Interior Proximal and Multiplier Methods Based on Second Order Homogeneous Kernels
cites work: A logarithmic-quadratic proximal method for variational inequalities
cites work: A Generalized Proximal Point Algorithm for the Variational Inequality Problem in a Hilbert Space
cites work: Q4718793
cites work: Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
cites work: Approximate iterations in Bregman-function-based proximal algorithms
cites work: Proximal Minimization Methods with Generalized Bregman Functions
cites work: An inexact hybrid generalized proximal point algorithm and some new results on the theory of Bregman functions
cites work: Convergence of Proximal-Like Algorithms
cites work: Convex Analysis
cites work: Q3690580
cites work: Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
cites work: Q4001523
cites work: Splitting Algorithms for the Sum of Two Nonlinear Operators
cites work: A proximal-based deomposition method for compositions method for convex minimization problems
cites work: Q4311908
cites work: Application of the alternating direction method of multipliers to separable convex programming problems
cites work: Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
cites work: Q4347616
cites work: Entropic proximal decomposition methods for convex programs and variational inequalities
full work available at URL: a:1004655531273
OpenAlex ID: W1518610258
description: scientific article; zbMATH DE number 1558309