Randomly Generated Test Problems for Positive Definite Quadratic Programming

DOI10.1145/356068.356075zbMath0545.90081OpenAlexW2061478235MaRDI QIDQ3337228

Michael Minkoff, M. L. Lenard

Publication date: 1984

Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL: https://digital.library.unt.edu/ark:/67531/metadc283556/

zbMATH Keywords

performancerobustnessreliabilityefficiencylinear constraintssoftware engineeringexperimentationlinear least-squares problemsrandom datapositive definite quadratic programming

Mathematics Subject Classification ID

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

Related Items (8)

Best practices for comparing optimization algorithms ⋮ Near optimal step size and momentum in gradient descent for quadratic functions ⋮ Tuning Algorithms for Stochastic Black-Box Optimization: State of the Art and Future Perspectives ⋮ A new variable reduction technique for convex integer quadratic programs ⋮ The nearest point problem in a polyhedral set and its extensions ⋮ Value estimation approach to the Iri-Imai method for constrained convex optimization ⋮ A new technique for generating quadratic programming test problems ⋮ Random test problems and parallel methods for quadratic programs and quadratic stochastic programs^∗

Uses Software

• Algorithm 587

This page was built for publication: Randomly Generated Test Problems for Positive Definite Quadratic Programming