scientific article; zbMATH DE number 4154218

MaRDI QIDQ3483090zbMATH OpenFDO

Authors Satoru Takahashi

Publication date 1989

zbMATH Keywords

positive definite quadratic programmingone-parameterized linear constraint

Mathematics Subject Classification ID

Quadratic programming (90C20) Convex programming (90C25) Sensitivity, stability, parametric optimization (90C31) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Recommendations

• scientific article; zbMATH DE number 1215253
• scientific article; zbMATH DE number 4003917
• A numerically stable dual method for solving strictly convex quadratic programs
• A dual-active-set algorithm for positive semi-definite quadratic programming
• An algorithm for solving quadratic programming problems

Cited in

(10)

• scientific article; zbMATH DE number 66883 (Why is no real title available?)
• Numerical solution method for general interval quadratic programming
• scientific article; zbMATH DE number 3928729 (Why is no real title available?)
• scientific article; zbMATH DE number 5064899 (Why is no real title available?)
• On the numerical realization of the exact penalty method for quadratic programming algorithms
• A unifying approach to solve a class of parametrically-convexifiable problems
• scientific article; zbMATH DE number 1215253 (Why is no real title available?)
• scientific article; zbMATH DE number 781292 (Why is no real title available?)
• A new algorithm for solving convex parametric quadratic programs based on graphical derivatives of solution mappings
• On the facet-to-facet property of solutions to convex parametric quadratic programs

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