A simplicial branch-and-bound method for solving nonconvex all-quadratic programs
From MaRDI portal
Publication:1281481
DOI10.1023/A:1008377529330zbMath0916.90215OpenAlexW1859065560MaRDI QIDQ1281481
Publication date: 21 July 1999
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1008377529330
global optimizationbranch-and-bound\(\varepsilon\)-approximate optimal solutionindefinite quadratic optimization under indefinite quadratic constraintsnonconvex quadratically constrained quadratic programs
Related Items (21)
Packing equal circles in a square: A deterministic global optimization approach ⋮ An accelerating algorithm for globally solving nonconvex quadratic programming ⋮ An optimal trade-off model for portfolio selection with sensitivity of parameters ⋮ Exact quadratic convex reformulations of mixed-integer quadratically constrained problems ⋮ Extra resource allocation: a DEA approach in the view of efficiencies ⋮ A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables ⋮ A parametric linear relaxation algorithm for globally solving nonconvex quadratic programming ⋮ Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation ⋮ Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations ⋮ Portfolio selection with the effect of systematic risk diversification: formulation and accelerated gradient algorithm ⋮ A branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problems ⋮ Global optimization algorithm for mixed integer quadratically constrained quadratic program ⋮ Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint ⋮ Rounding on the standard simplex: regular grids for global optimization ⋮ A branch and bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation ⋮ Duality bound method for the general quadratic programming problem with quadratic constraints ⋮ Solution existence and stability of quadratically constrained convex quadratic programs ⋮ The exact solution of multiparametric quadratically constrained quadratic programming problems ⋮ A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs ⋮ Optimal trade-off portfolio selection between total risk and maximum relative marginal risk† ⋮ Global optimization approach to unequal global optimization approach to unequal sphere packing problems in 3D
This page was built for publication: A simplicial branch-and-bound method for solving nonconvex all-quadratic programs
