Cone decomposition for the solution of efficient extreme points in parallel

MaRDI QIDQ4514797zbMATH OpenFDO

Authors Ralph E. Steuer, Craig A. Piercy

Publication date 14 November 2000

zbMATH Keywords

efficient pointsmultiple objective linear programparallel computingvector maximum algorithms

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Multi-objective and goal programming (90C29)

Recommendations

• A parallel descent algorithm for convex programming
• A Parallel Algorithm for a Class of Convex Programs
• Parallel interior point schemes for solving multistage convex programming
• scientific article; zbMATH DE number 1046042
• Massively Parallel Algorithms for Singly Constrained Convex Programs
• Optimal parallel algorithms for proximate points, with applications (extended abstract)
• A parallel splitting method for separable convex programs
• Efficient parallel convex hull algorithms
• Iterative methods for parallel convex optimization with fixed point constraints

Cited in

(2)

• A general cone decomposition theory based on efficiency
• Reducing wall-clock time for the computation of all efficient extreme points in multiple objective linear programming

This page was built for publication: Cone decomposition for the solution of efficient extreme points in parallel

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