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
Discussion
View source
View history
Purge
English
Log in

An exterior Newton method for strictly convex quadratic programming

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

DOI10.1023/A:1008773230148zbMath0942.90031OpenAlexW1488486137MaRDI QIDQ1967119

Jianguo Liu, Thomas F. Coleman

Publication date: 20 August 2000

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1008773230148


zbMATH Keywords

convex quadratic programmingNewton methodsdual problemsexterior methods


Mathematics Subject Classification ID

Convex programming (90C25) Quadratic programming (90C20) Methods of quasi-Newton type (90C53)


Related Items (2)

A novel neural dynamical approach to convex quadratic program and its efficient applications ⋮ An exterior point polynomial-time algorithm for convex quadratic programming







This page was built for publication: An exterior Newton method for strictly convex quadratic programming

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1967119&oldid=14415039"
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 16:37.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki