A computational study on QP problems with general linear constraints
From MaRDI portal
Publication:2673522
DOI10.1007/s11590-021-01846-6zbMath1493.90125OpenAlexW4210316542MaRDI QIDQ2673522
Giampaolo Liuzzi, Veronica Piccialli, Marco Locatelli
Publication date: 10 June 2022
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-021-01846-6
Uses Software
Cites Work
- Theoretical and computational results about optimality-based domain reductions
- Three enhancements for optimization-based bound tightening
- Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound
- Quadratic programming with one negative eigenvalue is NP-hard
- Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods
- Globally solving nonconvex quadratic programming problems via completely positive programming
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- BARON: A general purpose global optimization software package
- Global optimization problems and domain reduction strategies
- Computing mixed strategies equilibria in presence of switching costs by the solution of nonconvex QP problems
- QPLIB: a library of quadratic programming instances
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- A new branch-and-bound algorithm for standard quadratic programming problems
- Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques
- Spectral Relaxations and Branching Strategies for Global Optimization of Mixed-Integer Quadratic Programs
- Maxima for Graphs and a New Proof of a Theorem of Turán
- Unnamed Item
- Unnamed Item