Global optimality conditions for mixed nonconvex quadratic programs†
From MaRDI portal
Publication:3622005
DOI10.1080/02331930701761243zbMath1158.41317OpenAlexW1986989867MaRDI QIDQ3622005
Publication date: 23 April 2009
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331930701761243
Nonlinear programming (90C30) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Approximation with constraints (41A29)
Related Items (8)
Optimality conditions and optimization methods for quartic polynomial optimization ⋮ Global optimality conditions for fixed charge quadratic programs ⋮ Sufficient conditions for global optimality of semidefinite optimization ⋮ On zero duality gap in nonconvex quadratic programming problems ⋮ Necessary optimality conditions and new optimization methods for cubic polynomial optimization problems with mixed variables ⋮ Optimization methods for mixed integer weakly concave programming problems ⋮ A branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problems ⋮ A filled function method for quadratic programs with binary constraints†
Cites Work
This page was built for publication: Global optimality conditions for mixed nonconvex quadratic programs†