Two parallel distribution algorithms for convex constrained minimization problems

DOI10.1016/j.amc.2006.08.167zbMath1118.65064OpenAlexW2011453618MaRDI QIDQ884654

Wei Wang, Jie Shen, Li-Ping Pang

Publication date: 6 June 2007

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2006.08.167

zbMATH Keywords

convergencenonsmooth optimizationconvex programmingparallel algorithmMoreau-Yosida regularizationcoordinate descent methodsparallel gradient distribution algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30) Parallel numerical computation (65Y05)

Cites Work

• Unnamed Item
• Unnamed Item
• On the gradient-projection method for solving the nonsymmetric linear complementarity problem
• New inexact parallel variable distribution algorithms
• Parallel variable distribution for constrained optimization
• Méthodes numériques pour la décomposition et la minimisation de fonctions non différentiables
• A Parallel Algorithm for a Class of Convex Programs
• Methodes de Decomposition pour la Minimisation d’une Fonction sur un Espace Produit
• Minimizing and Stationary Sequences of Constrained Optimization Problems
• Parallel Variable Transformation in Unconstrained Optimization
• Parallel Variable Distribution
• On the Convergence of Constrained Parallel Variable Distribution Algorithms
• Convergence analysis of a proximal newton method¹
• A Globally and Superlinearly Convergent Algorithm for Nonsmooth Convex Minimization
• Parallel Gradient Distribution in Unconstrained Optimization
• Minimizing and stationary sequences of convex constrained minimization problems

This page was built for publication: Two parallel distribution algorithms for convex constrained minimization problems