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

DOI10.1080/02331939008843619zbMath0731.90060OpenAlexW2073924781MaRDI QIDQ3358532

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

M-matricesNewton projection methodChandrasekaran method

Mathematics Subject Classification ID

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

Cites Work

• Quadratic programming with M-matrices
• Some algorithms solving the unilateral Dirichlet problem with two constraints
• Projected Newton Methods for Optimization Problems with Simple Constraints
• Unnamed Item
• Unnamed Item

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