An equivalence between two algorithms for a class of quadratic programming problems with<i>m</i>matrices<sup>*</sup> (Q3358532): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Projected Newton Methods for Optimization Problems with Simple Constraints / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5343726 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4132874 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Quadratic programming with M-matrices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some algorithms solving the unilateral Dirichlet problem with two constraints / rank | |||
Normal rank |
Latest revision as of 18:19, 21 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An equivalence between two algorithms for a class of quadratic programming problems with<i>m</i>matrices<sup>*</sup> |
scientific article |
Statements
An equivalence between two algorithms for a class of quadratic programming problems with<i>m</i>matrices<sup>*</sup> (English)
0 references
1990
0 references
M-matrices
0 references
Newton projection method
0 references
Chandrasekaran method
0 references