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

Primal-dual Newton's method with steepest descent for linear programming

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

DOI10.1007/978-3-030-10934-9_6zbMath1468.90071OpenAlexW2909835835MaRDI QIDQ2026151

Vitaliǐ Grigor'evich Zhadan

Publication date: 18 May 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-10934-9_6


zbMATH Keywords

linear programmingNewton's methodprimal-dual methodsteepest descentfinite convergence


Mathematics Subject Classification ID

Linear programming (90C05) Methods of quasi-Newton type (90C53)








This page was built for publication: Primal-dual Newton's method with steepest descent for linear programming

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