Nonlinear proximal decomposition method for convex programming

DOI10.1023/A:1004655531273zbMath0982.90036OpenAlexW1518610258MaRDI QIDQ1594877

M. Kyono, Masao Fukushima

Publication date: 29 January 2001

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1004655531273

zbMATH Keywords

convex programmingbregman functionsnonlinear proximal decomposition methodnonlinear proximal point algorithm

Mathematics Subject Classification ID

Convex programming (90C25) Decomposition methods (49M27)

Related Items

Approximate proximal methods in vector optimization, Decomposition Methods Based on Augmented Lagrangians: A Survey, Hybrid approximate proximal method with auxiliary variational inequality for vector optimization, Convergence rate of a proximal multiplier algorithm for separable convex minimization, Modified Lagrangian methods for separable optimization problems, An improved proximal-based decomposition method for structured monotone variational inequalities, Approximate proximal algorithms for generalized variational inequalities with pseudomonotone multifunctions, A new accuracy criterion for approximate proximal point algorithms, A proximal multiplier method for separable convex minimization, A class of nonlinear proximal point algorithms for variational inequality problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Application of the alternating direction method of multipliers to separable convex programming problems
• Approximate iterations in Bregman-function-based proximal algorithms
• A logarithmic-quadratic proximal method for variational inequalities
• A proximal-based deomposition method for compositions method for convex minimization problems
• An Inexact Hybrid Generalized Proximal Point Algorithm and Some New Results on the Theory of Bregman Functions
• Splitting Algorithms for the Sum of Two Nonlinear Operators
• Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
• Monotone Operators and the Proximal Point Algorithm
• Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
• Convergence of Proximal-Like Algorithms
• Proximal Minimization Methods with Generalized Bregman Functions
• A Generalized Proximal Point Algorithm for the Variational Inequality Problem in a Hilbert Space
• Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
• Interior Proximal and Multiplier Methods Based on Second Order Homogeneous Kernels
• Convex Analysis
• Entropic proximal decomposition methods for convex programs and variational inequalities