A Perturbed Parallel Decomposition Method for a Class of Nonsmooth Convex Minimization Problems
From MaRDI portal
Publication:3359664
DOI10.1137/0329045zbMath0733.65038OpenAlexW2087589430MaRDI QIDQ3359664
K. Mouallif, Van Hien Nguyen, Jean Jacques Strodiot
Publication date: 1991
Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0329045
unconstrained optimizationparallel computationvariational convergencenonsmooth convex programmingparallel decomposition methodparallel optimization algorithm
Numerical mathematical programming methods (65K05) Convex programming (90C25) Parallel numerical computation (65Y05)
Related Items (10)
A proximal-based deomposition method for compositions method for convex minimization problems ⋮ A parallel descent algorithm for convex programming ⋮ Family of perturbation methods for variational inequalities ⋮ A survey on operator splitting and decomposition of convex programs ⋮ Space-decomposition minimization method for large-scale minimization problems ⋮ A decomposition method for convex minimization problems and its application. ⋮ Strong convergence of a parallel iterative algorithm in a reflexive Banach space ⋮ Space-decomposition multiplier method for constrained minimization problems ⋮ Convergence analysis and applications of the Glowinski-Le Tallec splitting method for finding a zero of the sum of two maximal monotone operators ⋮ Coupling the auxiliary problem principle and epiconvergence theory to solve general variational inequalities
This page was built for publication: A Perturbed Parallel Decomposition Method for a Class of Nonsmooth Convex Minimization Problems
