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

Bound constrained quadratic programming via piecewise quadratic functions

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

DOI10.1007/S101070050049zbMath0948.90113OpenAlexW2075985239MaRDI QIDQ1295961

Hans Bruun Nielsen, Kaj Madsen, Mustafa Çelebi Pinar

Publication date: 23 September 1999

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11693/25150


zbMATH Keywords

Newton iterationcondition estimationHuber's \(M\)-estimatorbound constrained quadratic programmingfactorization update


Mathematics Subject Classification ID

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


Related Items (6)

Modified combined relaxation method for general monotone equilibrium problems in Hilbert spaces ⋮ Hybrid algorithms with active set prediction for solving linear inequalities in a least squares sense ⋮ A null-space method for computing the search direction in the general inertia-controlling method for dense quadratic programming ⋮ A finite newton method for classification ⋮ Combined relaxation method for monotone equilibrium problems ⋮ A hybrid algorithm for solving linear inequalities in a least squares sense


Uses Software

  • QPBOX






This page was built for publication: Bound constrained quadratic programming via piecewise quadratic functions

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