Generating linear, semidefinite, and second-order cone optimization problems for numerical experiments
From MaRDI portal
Publication:6641002
Recommendations
- On Generating Test Problems for Nonlinear Programming Algorithms
- Generation techniques for linear programming instances with controllable properties
- Generating Linear and Linear-Quadratic Bilevel Programming Problems
- Generating box-constrained optimization problems
- Generation of large-scale quadratic programs for use as global optimization test problems
Cites work
- scientific article; zbMATH DE number 91756 (Why is no real title available?)
- scientific article; zbMATH DE number 1017028 (Why is no real title available?)
- A new technique for generating quadratic programming test problems
- Bad semidefinite programs: they all look the same
- Complementarity and nondegeneracy in semidefinite programming
- Error bounds and singularity degree in semidefinite programming
- GENGUB: A generator for linear programs with generalized upper bound constraints
- Generating and measuring instances of hard semidefinite programs
- Generation techniques for linear programming instances with controllable properties
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- Needed: An Empirical Science of Algorithms
- On generation of test problems for linear programming codes
- On the identification of the optimal partition for semidefinite optimization
- On the identification of the optimal partition of second order cone optimization problems
- Probabilistic Models for Linear Programming
- Second-order cone programming
This page was built for publication: Generating linear, semidefinite, and second-order cone optimization problems for numerical experiments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6641002)
