Generating linear, semidefinite, and second-order cone optimization problems for numerical experiments

DOI10.1080/10556788.2024.2308677MaRDI QIDQ6641002zbMATH OpenFDO

Authors Mohammadhossein Mohammadisiahroudi, Ramin Fakhimi, Brandon R. Augustino, Tamás Terlaky

Publication date 20 November 2024

Published in Optimization Methods \& Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/10556788.2024.2308677

Mathematics Subject Classification ID

Numerical analysis (65-XX) Mathematical programming (90Cxx)

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

• 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
• Generating and measuring instances of hard semidefinite programs
• Generation techniques for linear programming instances with controllable properties
• GENGUB: A generator for linear programs with generalized upper bound constraints
• scientific article; zbMATH DE number 91756 (Why is no real title available?)
• scientific article; zbMATH DE number 1017028 (Why is no real title available?)
• Needed: An Empirical Science of Algorithms
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
• 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

Cited in

(3)

• Global convergence analysis of the power proximal point and augmented Lagrangian method
• On the complexity of p-order cone programs
• An inexact feasible interior point method for linear optimization with high adaptability to quantum computers

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)