Decomposition methods for differentiable optimization problems over Cartesian product sets

DOI10.1023/A:1018358602892zbMath0905.90162MaRDI QIDQ1383825

Michael Patriksson

Publication date: 29 July 1998

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

zbMATH Keywords

convergence analysisdecomposition algorithmssequential algorithmCartesian products of convex feasible setscontinuously differentiable optimizationcost approximationpartially asynchronous parallel algorithm

Mathematics Subject Classification ID

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

Related Items (6)

On the convergence of the block nonlinear Gauss-Seidel method under convex constraints ⋮ A convergent decomposition algorithm for support vector machines ⋮ Cost approximation algorithms with nonmonotone line searches for a general class of nonlinear programs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the convergence of inexact block coordinate descent methods for constrained optimization

This page was built for publication: Decomposition methods for differentiable optimization problems over Cartesian product sets