Products of positive forms, linear matrix inequalities, and Hilbert 17th problem for ternary forms

DOI10.1016/J.EJOR.2003.08.014zbMath1106.90058OpenAlexW2081728301WikidataQ56874384 ScholiaQ56874384MaRDI QIDQ1877018

Dimitrii V. Pasechnik, Etienne de Klerk

Publication date: 16 August 2004

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://research.tilburguniversity.edu/en/publications/90713b98-8cb2-4d0c-981c-815bfeb1b627

zbMATH Keywords

global optimizationsemi-definite programmingHilbert's 17th problemternary forms

Mathematics Subject Classification ID

Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) General binary quadratic forms (11E16)

Related Items (5)

Sums of squares in Macaulay2 ⋮ Reflection groups and cones of sums of squares ⋮ Formulas for calculating the extremum ranks and inertias of a four-term quadratic matrix-valued function and their applications ⋮ Global optimization of rational functions: a semidefinite programming approach ⋮ On the Generation of Positivstellensatz Witnesses in Degenerate Cases

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extremal positive semidefinite forms
• On the complexity of semidefinite programs
• Initialization in semidefinite programming via a self-dual skew-symmetric embedding
• An exact duality theory for semidefinite programming and its complexity implications
• Semidefinite programming relaxations for semialgebraic problems
• Uniform denominators in Hilbert's seventeenth problem
• An Explicit Equivalent Positive Semidefinite Program for Nonlinear 0-1 Programs
• Sums of even powers of real linear forms
• Mathematical problems
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Convex Analysis
• Semidefinite Programming vs. LP Relaxations for Polynomial Programming
• Handbook of semidefinite programming. Theory, algorithms, and applications
• A new bound for Pólya's theorem with applications to polynomials positive on polyhedra.

This page was built for publication: Products of positive forms, linear matrix inequalities, and Hilbert 17th problem for ternary forms