Parallel Solution of Large-Scale, Block-Diagonal Concave Maximization Problems

DOI10.1137/0801030MaRDI QIDQ4012430zbMATH OpenOpenAlexFDO

Authors J. H. Glick, Robert S. Maier, J. B. Rosen

Publication date 27 September 1992

Published in SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0801030

zbMATH Keywords

block-diagonal coefficient matrixfeasible-point algorithmstructured, large-scale, constrained optimization

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30)

Recommendations

• Large-Scale, Nonlinearly Constrained Optimization on a 1024-Processor<scp>n</scp>CUBE
• A view of the limitations, opportunities, and challenges in parallel nonlinear optimization
• A parallel algorithm for constrained concave quadratic global minimization
• Parallel solution of large-scale, block-angular linear programs
• Parallel computing in nonconvex programming

Cited in

(5)

• A Parallel Block Iterative Scheme Applied to Computations in Structural Analysis
• A multiprocessor interior point algorithm
• Large-Scale, Nonlinearly Constrained Optimization on a 1024-Processor<scp>n</scp>CUBE
• Optimizing Large-Scale Linear Energy System Problems with Block Diagonal Structure by Using Parallel Interior-Point Methods
• scientific article; zbMATH DE number 1932331 (Why is no real title available?)

Describes a project that uses

Uses Software

• MINOS

This page was built for publication: Parallel Solution of Large-Scale, Block-Diagonal Concave Maximization Problems

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