Two parallel distribution algorithms for convex constrained minimization problems
From MaRDI portal
Publication:884654
DOI10.1016/j.amc.2006.08.167zbMath1118.65064MaRDI QIDQ884654
Li-Ping Pang, Jie Shen, Wei Wang
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
convergence; nonsmooth optimization; convex programming; parallel algorithm; Moreau-Yosida regularization; coordinate descent methods; parallel gradient distribution algorithm
65K05: Numerical mathematical programming methods
90C25: Convex programming
90C30: Nonlinear programming
65Y05: Parallel numerical computation
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 method1
- 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
