A new branch-and-bound algorithm for standard quadratic programming problems
From MaRDI portal
Recommendations
- Branch-and-bound approaches to standard quadratic optimization problems
- New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability
- A clique algorithm for standard quadratic programming
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
Cites work
- A clique algorithm for standard quadratic programming
- A comparison of the Delsarte and Lovász bounds
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- A linear programming reformulation of the standard quadratic optimization problem
- A new semidefinite programming bound for indefinite quadratic forms over a simplex
- A symmetrical linear maxmin approach to disjoint bilinear programming
- An adaptive linear approximation algorithm for copositive programs
- Analysis of copositive optimization based linear programming bounds on standard quadratic optimization
- Approximation of the stability number of a graph via copositive programming
- Branch-and-bound approaches to standard quadratic optimization problems
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- Computing the Stability Number of a Graph Via Linear and Semidefinite Programming
- Continuous Characterizations of the Maximum Clique Problem
- Convex Envelopes of Some Quadratic Functions over the n-Dimensional Unit Simplex
- CSDP, A C library for semidefinite programming
- D.C. versus copositive bounds for standard QP
- Global and local quadratic minimization
- Global optimization with polynomials and the problem of moments
- scientific article; zbMATH DE number 544186 (Why is no real title available?)
- scientific article; zbMATH DE number 912567 (Why is no real title available?)
- Improved Bounds for the Crossing Numbers of Km,n and Kn
- Maxima for Graphs and a New Proof of a Theorem of Turán
- New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability
- On copositive programming and standard quadratic optimization problems
- On standard quadratic optimization problems
- On the accuracy of uniform polyhedral approximations of the copositive cone
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- On the Shannon capacity of a graph
- Semidefinite bounds for the stability number of a graph via sums of squares of polynomials
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- The complexity of simple models -- a study of worst and typical hard cases for the standard quadratic optimization problem
- The worst-case time complexity for generating all maximal cliques and computational experiments
Cited in
(14)- 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
- On monotonicity and search strategies in face-based copositivity detection algorithms
- Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations
- Using SVM to combine global heuristics for the standard quadratic problem
- A computational study on QP problems with general linear constraints
- A branch and bound reduced algorithm for quadratic programming problems with quadratic constraints
- scientific article; zbMATH DE number 7366738 (Why is no real title available?)
- A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem
- Branch-and-bound approaches to standard quadratic optimization problems
- (Global) optimization: historical notes and recent developments
- Regularized standard polynomial programming formulations for the maximum clique problem
- Fix and bound: an efficient approach for solving large-scale quadratic programming problems with box constraints
This page was built for publication: A new branch-and-bound algorithm for standard quadratic programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4646674)
