Global escape strategies for maximizing quadratic forms over a simplex

DOI10.1023/A:1008297330705zbMath0904.90125OpenAlexW1550538040MaRDI QIDQ1368742

Immanuel M. Bomze

Publication date: 19 January 1999

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

Full work available at URL: https://doi.org/10.1023/a:1008297330705

zbMATH Keywords

quadratic formsimplex

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20)

Related Items (7)

Fixed interval scheduling: models, applications, computational complexity and algorithms ⋮ Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization ⋮ Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision ⋮ Extensions of the standard quadratic optimization problem: strong duality, optimality, hidden convexity and S-lemma ⋮ A clique algorithm for standard quadratic programming ⋮ Does moral play equilibrate? ⋮ Hessian Barrier Algorithms for Linearly Constrained Optimization Problems

This page was built for publication: Global escape strategies for maximizing quadratic forms over a simplex