New inexact parallel variable distribution algorithms

DOI10.1023/A:1008618009738zbMath0884.90138OpenAlexW2140093252MaRDI QIDQ1360242

Mikhail V. Solodov

Publication date: 5 April 1998

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1008618009738

zbMATH Keywords

linear convergenceasynchronous algorithmsunconstraint minimizationinexact subproblem solutionload balancing among the parallel processorsparallel variable distribution

Mathematics Subject Classification ID

Nonlinear programming (90C30) Parallel numerical computation (65Y05)

Related Items (15)

Parallel variable distribution algorithm for constrained optimization with nonmonotone technique ⋮ Descent methods with linesearch in the presence of perturbations ⋮ Convergence analysis of perturbed feasible descent methods ⋮ Two parallel distribution algorithms for convex constrained minimization problems ⋮ Parallel SSLE algorithm for large scale constrained optimization ⋮ Space-decomposition minimization method for large-scale minimization problems ⋮ Parallel algorithms for large-scale linearly constrained minimization problem ⋮ A syncro-parallel nonsmooth PGD algorithm for nonsmooth optimization ⋮ A method for solving the system of linear equations and linear inequalities ⋮ Space-decomposition multiplier method for constrained minimization problems ⋮ Sprouting search—an algorithmic framework for asynchronous parallel unconstrained optimization ⋮ A unified approach to parallel space decomposition methods ⋮ On the convergence of asynchronous parallel algorithm for large-scale linearly constrained minimization problem ⋮ Error stability properties of generalized gradient-type algorithms ⋮ On a second order parallel variable transformation approach.

This page was built for publication: New inexact parallel variable distribution algorithms