scientific article; zbMATH DE number 3431982
From MaRDI portal
Publication:5183274
Cited in
(14)- On the pervasiveness of difference-convexity in optimization and statistics
- Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations
- Solving linear programs with complementarity constraints using branch-and-cut
- On the copositive representation of binary and continuous nonconvex quadratic programs
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- A computational study on QP problems with general linear constraints
- An LPCC approach to nonconvex quadratic programs
- On linear programs with linear complementarity constraints
- Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques
- In memoriam: Franco Giannessi (1935--2025)
- Improving the solution of indefinite quadratic programs and linear programs with complementarity constraints by a progressive MIP method
- Relaxations of KKT conditions do not strengthen finite RLT and SDP-RLT bounds for nonconvex quadratic programs
- Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound
- Box-constrained quadratic programs with fixed charge variables
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5183274)
