PARALLEL MULTISPLITTINGS FOR CONSTRAINED OPTIMIZATION

DOI10.1080/10637199608915565zbMath1049.68920OpenAlexW2005397629MaRDI QIDQ4820167

Hans D. Mittelmann

Publication date: 6 October 2004

Published in: Parallel Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10637199608915565

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Cites Work

• An unconstrained optimization technique for large-scale linearly constrained convex minimization problems
• Asynchronous two-stage iterative methods
• Newton-Type Minimization via the Lanczos Method
• A dual differentiable exact penalty function
• On the Resolution of Linearly Constrained Convex Minimization Problems
• Large-Scale, Nonlinearly Constrained Optimization on a 1024-Processor<scp>n</scp>CUBE
• Evaluation of Large-scale Optimization Problems on Vector and Parallel Architectures
• Parallel Variable Distribution
• A special newton-type optimization method
• Algorithm 711: BTN: software for parallel unconstrained optimization

This page was built for publication: PARALLEL MULTISPLITTINGS FOR CONSTRAINED OPTIMIZATION