A quadratic programming algorithm using conjugate search directions

DOI10.1007/BF01582094MaRDI QIDQ4184627zbMATH OpenFDO

Authors Regina Benveniste

Publication date 1979

Published in Mathematical Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01582094

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Analysis of algorithms and problem complexity (68Q25) Quadratic programming (90C20)

Cites work

• Function minimization by conjugate gradients
• scientific article; zbMATH DE number 3115465 (Why is no real title available?)
• scientific article; zbMATH DE number 3438384 (Why is no real title available?)
• scientific article; zbMATH DE number 3439906 (Why is no real title available?)
• scientific article; zbMATH DE number 3358258 (Why is no real title available?)
• scientific article; zbMATH DE number 3402374 (Why is no real title available?)
• Methods of conjugate gradients for solving linear systems

Cited in

(8)

• Computer experiments on quadratic programming algorithms
• An iterative working-set method for large-scale nonconvex quadratic programming
• Equivalence of some quadratic programming algorithms
• The primal algorithm using conjugate directions for quadratic programming problems with simple upper bounds
• One way to solve the parametric quadratic programming problem
• Evaluating computational efficiency: A stochastic approach
• Some algorithms for the convex quadratic programming problem via the ABS approacxh
• Computing upper and lower bounds in interval decision trees

This page was built for publication: A quadratic programming algorithm using conjugate search directions

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