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

Solving the general quadratic programming problem in a finite number of steps

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

DOI10.1134/S1064562413040224zbMath1285.90026MaRDI QIDQ382174

Alexey A. Tret'yakov, Evgenij E. Tyrtyshnikov

Publication date: 18 November 2013

Published in: Doklady Mathematics (Search for Journal in Brave)


zbMATH Keywords

gradient methodorthogonal projectionactive set strategyconvex quadratic programinequality constrained quadratic programming


Mathematics Subject Classification ID

Quadratic programming (90C20)




Cites Work

  • Unnamed Item
  • Unnamed Item
  • A Newton method for linear programming
  • On the non-polynomiality of the relaxation method for systems of linear inequalities
  • On the Accurate Identification of Active Constraints
  • New numerical methods and some applied aspects of the p-regularity theory
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:382174&oldid=12256504"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 04:10.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki