PARALLEL MULTISPLITTINGS FOR CONSTRAINED OPTIMIZATION

DOI10.1080/10637199608915565MaRDI QIDQ4820167zbMATH OpenOpenAlexFDO

Authors 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

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

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

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