PARTIAL PROXIMAL METHOD OF MULTIPLIERS FOR CONVEX PROGRAMMING PROBLEMS

DOI10.15807/JORSJ.39.213zbMATH Open0870.90087OpenAlexW2152994082MaRDI QIDQ5284943FDOQ5284943

Authors: Satoru Ibaraki, Masao Fukushima 

Publication date: 22 January 1997

Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.15807/jorsj.39.213

Recommendations

• Partial Proximal Minimization Algorithms for Convex Pprogramming
• A partial inexact proximal point method for separable convex programming
• Penalty-proximal methods in convex programming
• Partial proximal point method for nonmonotone equilibrium problems
• A proximal multiplier method for separable convex minimization
• Proximal methods for mixed variational inequalities
• The multiproximal linearization method for convex composite problems
• A proximal-projection partial bundle method for convex constrained minimax problems
• Proximal point methods and nonconvex optimization
• scientific article; zbMATH DE number 1926003

zbMATH Keywords

global convergencetraffic assignmentlinear constraintssum of two convex functionsmultiple set constraintspartial proximal method of multipliers

Mathematics Subject Classification ID

Convex programming (90C25) Parallel numerical computation (65Y05)

Cited In (6)

• Parametric proximal-point methods
• Generalizations of the proximal method of multipliers in convex optimization
• A partial proximal point algorithm for nuclear norm regularized matrix least squares problems
• A primal-dual proximal point algorithm for constrained convex programs
• Auxiliary problem principle and proximal point methods
• Mirror Prox algorithm for multi-term composite minimization and semi-separable problems

This page was built for publication: PARTIAL PROXIMAL METHOD OF MULTIPLIERS FOR CONVEX PROGRAMMING PROBLEMS

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