Copositive realxation for genera quadratic programming

From MaRDI portal
Revision as of 01:24, 7 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4391294

DOI10.1080/10556789808805692zbMath0904.90126OpenAlexW2015775145MaRDI QIDQ4391294

Tamás Terlaky, Arie J. Quist, Etienne de Klerk, Cornelis Roos

Publication date: 2 June 1998

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556789808805692




Related Items (22)

Copositive programming motivated bounds on the stability and the chromatic numbersA note on set-semidefinite relaxations of nonconvex quadratic programsA new certificate for copositivityConic optimization: a survey with special focus on copositive optimization and binary quadratic problemsCopositive optimization -- recent developments and applicationsThink co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimizationAn algorithm for determining copositive matricesCopositivity detection by difference-of-convex decomposition and \(\omega \)-subdivisionEnhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methodsAlgorithmic copositivity detection by simplicial partitionLMI approximations for the radius of the intersection of ellipsoids: Survey.Semidefinite programming for discrete optimization and matrix completion problemsConic approximation to nonconvex quadratic programming with convex quadratic constraintsFoundations of Set-Semidefinite OptimizationConvexifiability of continuous and discrete nonnegative quadratic programs for gap-free dualitySemidefinite relaxations for quadratically constrained quadratic programming: A review and comparisonsPartial facial reduction: simplified, equivalent SDPs via approximations of the PSD coneBuilding a completely positive factorizationSieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programsRole of redundant constraints for improving dual bounds in polynomial optimization problemsExploiting symmetry in copositive programs via semidefinite hierarchiesDetecting copositivity of a symmetric matrix by an adaptive ellipsoid-based approximation scheme




Cites Work




This page was built for publication: Copositive realxation for genera quadratic programming