One way to solve the parametric quadratic programming problem

DOI10.1007/BF01584242MaRDI QIDQ3912371zbMATH OpenFDO

Authors Regina Benveniste

Publication date 1981

Published in Mathematical Programming (Search for Journal in Brave)

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

zbMATH Keywords

conjugate directionsparametric quadratic programmingreduced gradientreduced problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Sensitivity, stability, parametric optimization (90C31)

Cites work

• A parametric linear complementarity problem involving derivatives
• A quadratic programming algorithm using conjugate search directions
• Evaluating computational efficiency: A stochastic approach
• scientific article; zbMATH DE number 3543799 (Why is no real title available?)
• scientific article; zbMATH DE number 3347916 (Why is no real title available?)
• Isotone solutions of parametric linear complementarity problems
• Monotone solutions of the parametric linear complementarity problem
• The Simplex Method for Quadratic Programming

Cited in

(3)

• Stability of linearly constrained convex quadratic programs
• Finding normal solutions in piecewise linear programming
• A unified approach to one-parametric general quadratic programming

This page was built for publication: One way to solve the parametric quadratic programming problem

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