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
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/02331939008843619 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2073924781 / rank
 
Normal rank
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
links / mardi / namelinks / mardi / name
 

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
    0 references
    0 references
    1990
    0 references
    0 references
    0 references
    0 references
    0 references
    M-matrices
    0 references
    Newton projection method
    0 references
    Chandrasekaran method
    0 references
    0 references