Generating Linear, Semidefinite, and Second-order Cone Optimization Problems for Numerical Experiments

A. Charnes, W.M. Raike, J.D. Stutz, and A.S. Walters, On generation of test problems for linear programming codes , Communications of the ACM 17 (1974), pp. 583–586

1974

Earlier work this paper cites.

D. Klingman, A. Napier, and J. Stutz, NETGEN: A program for generating large scale capacitated assignment, transportation, and minimum cost flow network problems , Management Science 20 (1974), pp. 814–821

1974

Earlier work this paper cites.

D.M. Gay, Electronic mail distribution of linear programming test problems , Mathematical Programming Society COAL Newsletter 13 (1985), pp. 10–12

1985

Earlier work this paper cites.

M.J. Todd, Probabilistic models for linear programming , Mathematics of Operations Research 16 (1991), pp. 671–693

1991

Earlier work this paper cites.

M.G. Pilcher and R.L. Rardin, Partial polyhedral description and generation of discrete optimization problems with known optima , Naval Research Logistics (NRL) 39 (1992), pp. 839–858

1992

Earlier work this paper cites.

J.L. Arthur and J.O. Frendewey, GENGUB: A generator for linear programs with generalized upper bound constraints , Computers & Operations Research 20 (1993), pp. 565–573

1993

Earlier work this paper cites.

P.H. Calamai, L.N. Vicente, and J.J. Júdice, A new technique for generating quadratic programming test problems , Mathematical Programming 61 (1993), pp. 215–231

1993

Earlier work this paper cites.

J.N. Hooker, Needed: An empirical science of algorithms , Operations Research 42 (1994), pp. 201–212

1994

Earlier work this paper cites.

C. Roos, T. Terlaky, and J.P. Vial, Theory and Algorithms for Linear Optimization: An Interior Point Approach , Wiley Chichester, 1997

1997

Earlier work this paper cites.

S. Chakraborty and P.P. Choudhury, A statistical analysis of an algorithm’s complexity , Applied Mathematics Letters 13 (2000), pp. 121–126

2000

Cited alongside, same era.

E. Castillo, R.E. Pruneda, and M. Esquivel IV, Automatic generation of linear programming problems for computer aided instruction , International Journal of Mathematical Education in Science and Technology 32 (2001), pp. 209–232

2001

Cited alongside, same era.

C. Cotta and P. Moscato, A mixed evolutionary-statistical analysis of an algorithm’s complexity , Applied Mathematics Letters 16 (2003), pp. 41–47

2003

Cited alongside, same era.

E. De Klerk, Aspects of Semidefinite Programming: Interior Point Algorithms and Selected Applications , Vol. 65, Springer Science & Business Media, 2006

2006

Cited alongside, same era.

F. Mezzadri, How to generate random matrices from the classical compact groups , arXiv preprint math-ph/0609050 (2006)

G. Pataki, Bad semidefinite programs: they all look the same , SIAM Journal on Optimization 27 (2017), pp. 146–172

2017

Later among the works it cites.

A. Mohammad-Nezhad, Conic Optimization: Optimal Partition, Parametric, and Stability Analysis , Ph.D. diss., Lehigh University, 2019

2019

Later among the works it cites.

S. Bowly, K. Smith-Miles, D. Baatar, and H. Mittelmann, Generation techniques for linear programming instances with controllable properties , Mathematical Programming Computation 12 (2020), pp. 389–415

2020

Later among the works it cites.

A. Mohammad-Nezhad and T. Terlaky, On the identification of the optimal partition for semidefinite optimization , INFOR: Information Systems and Operational Research 58 (2020), pp. 225–263

2020

Later among the works it cites.

A. Coja-Oghlan, P. Gao, M. Hahn-Klimroth, J. Lee, N. Müller, and M. Rolvien, The full rank condition for sparse random matrices , arXiv preprint arXiv:2112.14090 (2021)