A new branch-and-bound algorithm for standard quadratic programming problems
From MaRDI portal
Publication:4646674
DOI10.1080/10556788.2017.1341504zbMath1405.90144OpenAlexW2730722516MaRDI QIDQ4646674
Veronica Piccialli, Giampaolo Liuzzi, Marco Locatelli
Publication date: 14 January 2019
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2017.1341504
Related Items
On monotonicity and search strategies in face-based copositivity detection algorithms, A computational study on QP problems with general linear constraints, (Global) optimization: historical notes and recent developments, Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations, Two-stage stochastic standard quadratic optimization, A study on sequential minimal optimization methods for standard quadratic problems, Continuous cubic formulations for cluster detection problems in networks, A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Analysis of copositive optimization based linear programming bounds on standard quadratic optimization
- Branch-and-bound approaches to standard quadratic optimization problems
- The worst-case time complexity for generating all maximal cliques and computational experiments
- A linear programming reformulation of the standard quadratic optimization problem
- Semidefinite bounds for the stability number of a graph via sums of squares of polynomials
- New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability
- A clique algorithm for standard quadratic programming
- On standard quadratic optimization problems
- A new semidefinite programming bound for indefinite quadratic forms over a simplex
- Global and local quadratic minimization
- A symmetrical linear maxmin approach to disjoint bilinear programming
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- D.C. versus copositive bounds for standard QP
- Global Optimization with Polynomials and the Problem of Moments
- Approximation of the Stability Number of a Graph via Copositive Programming
- On the accuracy of uniform polyhedral approximations of the copositive cone
- Convex Envelopes of Some Quadratic Functions over the n-Dimensional Unit Simplex
- A comparison of the Delsarte and Lovász bounds
- On the Shannon capacity of a graph
- Continuous Characterizations of the Maximum Clique Problem
- CSDP, A C library for semidefinite programming
- An Adaptive Linear Approximation Algorithm for Copositive Programs
- The Complexity of Simple Models—A Study of Worst and Typical Hard Cases for the Standard Quadratic Optimization Problem
- Maxima for Graphs and a New Proof of a Theorem of Turán
- Computing the Stability Number of a Graph Via Linear and Semidefinite Programming
- Improved Bounds for the Crossing Numbers of Km,n and Kn
- On copositive programming and standard quadratic optimization problems
