scientific article; zbMATH DE number 1163100

MaRDI QIDQ4394589zbMATH OpenFDO

Authors Michael Patriksson

Publication date 11 June 1998

zbMATH Keywords

Cartesian product setscontinuously differentiable optimizationconvergence analysisconvex approximationconvex feasible setsdecompositionpartially asynchronous parallel algorithm

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Convex programming (90C25)

Recommendations

• Decomposition methods for differentiable optimization problems over Cartesian product sets
• A parallel descent algorithm for convex programming
• Parallel Variable Distribution
• A Perturbed Parallel Decomposition Method for a Class of Nonsmooth Convex Minimization Problems
• scientific article; zbMATH DE number 617923

Cited in

(1)

• Decomposition methods for differentiable optimization problems over Cartesian product sets

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4394589)