PARTIAL PROXIMAL METHOD OF MULTIPLIERS FOR CONVEX PROGRAMMING PROBLEMS

DOI10.15807/JORSJ.39.213zbMath0870.90087OpenAlexW2152994082MaRDI QIDQ5284943

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

zbMATH Keywords

global convergencelinear constraintstraffic assignmentsum of two convex functionsmultiple set constraintspartial proximal method of multipliers

Mathematics Subject Classification ID

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

Related Items (2)

A partial proximal point algorithm for nuclear norm regularized matrix least squares problems ⋮ A primal-dual proximal point algorithm for constrained convex programs

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