Parallel bundle-based decomposition for large-scale structured mathematical programming problems
type: Item
instance of: scholarly article
title: Parallel bundle-based decomposition for large-scale structured mathematical programming problems
zbMATH Open document ID: 0714.90079
DOI: 10.1007/BF02023050
author: Deepankar Medhi
published in: Annals of Operations Research
publication date: 1990-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90-08
Mathematics Subject Classification ID: 68W15
Mathematics Subject Classification ID: 90C06
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 49M27
zbMATH DE Number: 4176840
zbMATH Keywords: parallel bundle-based decomposition algorithms
zbMATH Keywords: structured large-scale convex optimization
zbMATH Keywords: block-angular linear programming
zbMATH Keywords: unconstrained nonsmooth concave optimization
describes a project that uses: IMSL Numerical Libraries
describes a project that uses: MINOS
MaRDI profile type: Publication
cites work: An Application of Bin-Packing to Multiprocessor Scheduling
cites work: The Decomposition Algorithm for Linear Programs
cites work: Performance Guarantees for Scheduling Algorithms
cites work: Bounds on Multiprocessing Timing Anomalies
cites work: An advanced implementation of the Dantzig—Wolfe decomposition algorithm for linear programming
cites work: Q3316093
cites work: A stable method for solving certain constrained least squares problems
cites work: Convex Analysis
cites work: Q4050397
description: scientific article; zbMATH DE number 4176840