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

A parallel quasi-Newton algorithm for unconstrained optimization

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

DOI10.1007/BF02238097zbMath0827.49022MaRDI QIDQ1895652

Yanyan Li

Publication date: 30 November 1995

Published in: Computing (Search for Journal in Brave)


zbMATH Keywords

unconstrained optimizationnumerical resultssuperlinear convergenceBFGS algorithmasynchronous parallel quasi- Newton methodparallel BFGS method


Mathematics Subject Classification ID

Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)



Uses Software

  • ve08


Cites Work

  • Local convergence analysis for partitioned quasi-Newton updates
  • A parallel algorithm for constrained optimization problems
  • Global Convergence of a Cass of Quasi-Newton Methods on Convex Problems
  • A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization
  • A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
  • Variable metric methods of minimisation
  • Unnamed Item
  • Unnamed Item


This page was built for publication: A parallel quasi-Newton algorithm for unconstrained optimization

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