scientific article; zbMATH DE number 4115852

MaRDI QIDQ4730700zbMATH OpenFDO

Authors Zixiang Ouyang

Publication date 1988

zbMATH Keywords

Cholesky factorizationdual algorithmsLagrangian methodssemi-positive definite quadratic programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20)

Recommendations

• A dual method for solving positive definite quadratic programming
• scientific article; zbMATH DE number 4033492
• Primal-dual method of solving convex quadratic programming problems
• scientific article; zbMATH DE number 4172744
• A new algorithm for finding global solution of indefinite quadratic programming problems

Cited in

(7)

• A dual method for solving positive definite quadratic programming
• scientific article; zbMATH DE number 5623945 (Why is no real title available?)
• scientific article; zbMATH DE number 3982921 (Why is no real title available?)
• An algorithm for indefinite quadratic programming based on a partial Cholesky factorization
• scientific article; zbMATH DE number 7753388 (Why is no real title available?)
• About Lagrangian methods in integer optimization
• Recursive quadratic programming algorithm that uses an exact augmented Lagrangian function

This page was built for publication:

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