Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Algorithm 711: BTN: software for parallel unconstrained optimization

From MaRDI portal
Publication:4371814
Jump to:navigation, search

DOI10.1145/138351.138359zbMath0892.65035OpenAlexW1973852453WikidataQ113310593 ScholiaQ113310593MaRDI QIDQ4371814

Ariela Sofer, Stephen G. Nash

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

Lanczos methodparallel computationunconstrained nonlinear optimizationFORTRAN subroutinesblock truncated Newton method


Mathematics Subject Classification ID

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


Related Items

An H-form variant of the partitioned QN method, PARALLEL MULTISPLITTINGS FOR CONSTRAINED OPTIMIZATION


Uses Software

  • BTN


Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4371814&oldid=18371274"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 7 February 2024, at 01:04.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki