Which Symmetric Homogeneous Polynomials Can Be Proved Positive Semi-definite by Difference Substitution Method?

DOI10.1007/978-3-540-87827-8_5zbMath1166.65342OpenAlexW1488985119MaRDI QIDQ3597980

Zhenbing Zeng, Liangyu Chen

Publication date: 29 January 2009

Published in: Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-87827-8_5

zbMATH Keywords

positive semi-definitenessdifference substitutionhomogeneous symmetric polynomial

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05)

Uses Software

• PolyLib

Cites Work

• A LIBRARY FOR DOING POLYHEDRAL OPERATIONS
• Schur partition for symmetric ternary forms and readable proof to inequalities
• Algorithm for finding a general formula for the non-negative solutions of a system of linear inequalities
• Algorithm for discovering the set of all the solutions of a linear programming problem
• Algorithm for finding a general formula for the non-negative solutions of a system of linear equations
• Unnamed Item
• Unnamed Item

This page was built for publication: Which Symmetric Homogeneous Polynomials Can Be Proved Positive Semi-definite by Difference Substitution Method?