Constraint exploration method for quadratic programming problem.

DOI10.1016/S0096-3003(99)00037-5MaRDI QIDQ5931586zbMATH OpenFDO

Authors Ismail Mohd, Yosza Dasril

Publication date 25 April 2001

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0096-3003(99)00037-5

zbMATH Keywords

Constrained minimization

Mathematics Subject Classification ID

Quadratic programming (90C20)

Recommendations

• scientific article; zbMATH DE number 1810375
• An algorithm for solving quadratic programming problems
• An algorithm for solving quadratic programming problems with linear equality and inequality constraints.
• A finite gradient-projective solver for a quadratic programming problem
• scientific article; zbMATH DE number 4070204

Cites work

• scientific article; zbMATH DE number 3490719 (Why is no real title available?)
• The Simplex Method for Quadratic Programming

Cited in

(5)

• Linearly constrained global optimization: a general solution algorithm with applications.
• A decomposition algorithm for solving large-scale quadratic programming problems
• scientific article; zbMATH DE number 1810375 (Why is no real title available?)
• A validation and verification tool for global optimization solvers
• scientific article; zbMATH DE number 2159159 (Why is no real title available?)

This page was built for publication: Constraint exploration method for quadratic programming problem.

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