A weighted gram-schmidt method for convex quadratic programming (Q3337227): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5636689 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational method for the indefinite quadratic programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reorthogonalization and Stable Algorithms for Updating the Gram-Schmidt QR Factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A General Quadratic Programming Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerically stable methods for quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods for Modifying Matrix Factorizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739659 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix factorizations in optimization of nonlinear functions subject to linear constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A numerically stable dual method for solving strictly convex quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3316095 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence of a sequential quadratic programming method with an augmented lagrangian line search function / rank
 
Normal rank

Latest revision as of 12:46, 14 June 2024

scientific article
Language Label Description Also known as
English
A weighted gram-schmidt method for convex quadratic programming
scientific article

    Statements

    A weighted gram-schmidt method for convex quadratic programming (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    1984
    0 references
    convex quadratic programming
    0 references
    updated orthogonal factorizations
    0 references
    bound constraints
    0 references
    range-space method
    0 references
    active-set strategy
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references