Algorithm 711: BTN: software for parallel unconstrained optimization

DOI10.1145/138351.138359MaRDI QIDQ4371814zbMATH OpenOpenAlexWikidataFDO

Authors Stephen G. Nash, Ariela Sofer

Publication date 9 February 1998

Published in ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL http://www.acm.org/pubs/contents/journals/toms/1992-18/

zbMATH Keywords

block truncated Newton methodFORTRAN subroutinesLanczos methodparallel computationunconstrained nonlinear optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Parallel numerical computation (65Y05) Nonlinear programming (90C30)

Recommendations

• Algorithm 738: a software package for unconstrained optimization using tensor methods
• A General-Purpose Parallel Algorithm for Unconstrained Optimization
• Algorithm 778: L-BFGS-B
• Multi-directional parallel algorithms for unconstrained optimization
• Algorithm 765: STENMIN—a software package for large, sparse unconstrained optimization using tensor methods
• The parallel downhill simplex algorithm for unconstrained optimisation
• Algorithm 1025: PARyOpt: A Software for P arallel A synchronous R emote Ba y esian Opt imization
• Parallel algorithm for unconstrained optimization based on decomposition techniques
• scientific article; zbMATH DE number 1092176
• scientific article; zbMATH DE number 1114119

Cited in

(3)

• An H-form variant of the partitioned QN method
• Algorithm 897: VTDIRECT95: serial and parallel codes for the global optimization algorithm direct
• PARALLEL MULTISPLITTINGS FOR CONSTRAINED OPTIMIZATION

Describes a project that uses

Uses Software

• BTN

This page was built for publication: Algorithm 711: BTN: software for parallel unconstrained optimization

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