scientific article; zbMATH DE number 1046860

MaRDI QIDQ4348956zbMATH OpenFDO

Authors Dumitru Barac

Publication date 28 September 1997

zbMATH Keywords

cutting plane methodlinear approximationquadratic programmingsimplex method

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4005983
• A cutting-plane method for quadratic semi infinite programming problems
• scientific article; zbMATH DE number 89074
• Solving Quadratic Programming by Cutting Planes
• Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
• A cutting plane method for solving quasimonotone variational inequalities
• The analytic-center cutting-plane method for variational inequalities: a quadratic-cut approach
• Implementing the simplex method as a cutting-plane method, with a view to regularization
• scientific article; zbMATH DE number 3980939
• A method for quadratic programming

Cited in

(4)

• On the use of simplex methods in constructing quadratic models
• A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimension
• Implementing the simplex method as a cutting-plane method, with a view to regularization
• Solving Quadratic Programming by Cutting Planes

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 Q4348956)