Some randomized algorithms for convex quadratic programming

DOI10.1007/S002459900101MaRDI QIDQ1282154zbMATH OpenOpenAlexFDO

Authors R. W. Goldbach

Publication date 28 March 1999

Published in Applied Mathematics and Optimization (Search for Journal in Brave)

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

zbMATH Keywords

linear programmingquadratic programmingrandomized algorithmsconvex programming

Mathematics Subject Classification ID

Quadratic programming (90C20) Convex programming (90C25) Linear programming (90C05)

Recommendations

• A randomized scheme for speeding up algorithms for linear and convex programming problems with high constraints-to-variables ratio
• Linear programming — Randomization and abstract frameworks
• A combinatorial bound for linear programming and related problems
• A subexponential bound for linear programming

Cited in

(8)

• Random algorithms for solving convex inequalities
• An Algorithm for Convex Quadratic Programming That Requires O(n^3.5L) Arithmetic Operations
• Randomized algorithms for the separation of point sets and for solving quadratic programs
• A randomized scheme for speeding up algorithms for linear and convex programming problems with high constraints-to-variables ratio
• A simple randomised algorithm for convex optimisation
• Violator Spaces: Structure and Algorithms
• Randomly Generated Test Problems for Positive Definite Quadratic Programming
• New Analysis on Sparse Solutions to Random Standard Quadratic Optimization Problems and Extensions

This page was built for publication: Some randomized algorithms for convex quadratic programming

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