Dual bounds and optimality cuts for all-quadratic programs with convex constraints

DOI10.1023/A:1026596100403zbMath0971.90054MaRDI QIDQ5929999

Ivo Nowak

Publication date: 8 November 2001

Published in: Journal of Global Optimization (Search for Journal in Brave)

zbMATH Keywords

global optimizationbranch-and-bound algorithmduality gapall-quadratic optimizationoptimality cuts

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30) Quadratic programming (90C20)

Related Items

A New Global Optimization Scheme for Quadratic Programs with Low-Rank Nonconvexity ⋮ Enhancing the normalized multiparametric disaggregation technique for mixed-integer quadratic programming ⋮ Box-constrained quadratic programs with fixed charge variables ⋮ Lagrangian decomposition of block-separable mixed-integer all-quadratic programs ⋮ Successive Lagrangian relaxation algorithm for nonconvex quadratic optimization ⋮ Decomposition branch-and-bound based algorithm for linear programs with additional multiplicative constraints