quadprogIP

swMATH36327MaRDI QIDQ52029FDOQ52029

Author name not available (Why is that?)

Source code repository: https://github.com/xiawei918/quadprogIP

Described by source

• Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques

Cited In (10)

• Cutting Plane Generation through Sparse Principal Component Analysis
• A distributionally robust optimization approach for two-stage facility location problems
• Testing copositivity via mixed-integer linear programming
• Outer-product-free sets for polynomial optimization and oracle-based cuts
• Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations
• An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix
• Computing mixed strategies equilibria in presence of switching costs by the solution of nonconvex QP problems
• Convexification of bilinear forms through non-symmetric lifting
• New LP-based local and global algorithms for continuous and mixed-integer nonconvex quadratic programming
• A computational study on QP problems with general linear constraints

This page was built for software: quadprogIP