Generating linear, semidefinite, and second-order cone optimization problems for numerical experiments
- 3 July 2024
- journal article
- research article
- Published by Taylor & Francis in Optimization Methods and Software
- Vol. 39 (4) , 725-755
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Defense Advanced Research Projects Agency (W911NF2010022)
- National Science Foundation (2128527)
This publication has 18 references indexed in Scilit:
- FRaGenLP: A Generator of Random Linear Programming Problems for Cluster Computing Systems2021
- Generation techniques for linear programming instances with controllable propertiesMathematical Programming Computation, 2019
- On the identification of the optimal partition for semidefinite optimizationINFOR: Information Systems and Operational Research, 2019
- Generating and measuring instances of hard semidefinite programsMathematical Programming, 2008
- Second-order cone programmingMathematical Programming, 2003
- Automatic generation of linear programming problems for computer aided instructionInternational Journal of Mathematical Education in Science and Technology, 2001
- Complementarity and nondegeneracy in semidefinite programmingMathematical Programming, 1997
- GENGUB: A generator for linear programs with generalized upper bound constraintsComputers & Operations Research, 1993
- A new technique for generating quadratic programming test problemsMathematical Programming, 1993
- Partial polyhedral description and generation of discrete optimization problems with known optimaNaval Research Logistics (NRL), 1992