An equivalence between two algorithms for a class of quadratic programming problems withmmatrices*

DOI10.1080/02331939008843619MaRDI QIDQ3358532zbMATH OpenOpenAlexFDO

Authors Andrzej Stachurski

Publication date 1990

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331939008843619

zbMATH Keywords

Chandrasekaran methodM-matricesNewton projection method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Quadratic programming (90C20)

Recommendations

• Publication:3483925
• Quadratic programming problems with M-matrices and box constraints
• scientific article; zbMATH DE number 3976785
• scientific article; zbMATH DE number 4201503
• Equivalence of some quadratic programming algorithms

Cites work

• scientific article; zbMATH DE number 3560020 (Why is no real title available?)
• scientific article; zbMATH DE number 3216614 (Why is no real title available?)
• Projected Newton Methods for Optimization Problems with Simple Constraints
• Quadratic programming with M-matrices
• Some algorithms solving the unilateral Dirichlet problem with two constraints

Cited in

(3)

• scientific article; zbMATH DE number 4155306 (Why is no real title available?)
• scientific article; zbMATH DE number 3976785 (Why is no real title available?)
• Quadratic programming problems with M-matrices and box constraints

This page was built for publication: An equivalence between two algorithms for a class of quadratic programming problems withmmatrices^*

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3358532)