OPTIMIZATIONS FOR TENSORIAL BERNSTEIN–BASED SOLVERS BY USING POLYHEDRAL BOUNDS (Q4923349): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1142/s0218654310001304 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2031092060 / rank | |||
Normal rank | |||
Latest revision as of 11:07, 30 July 2024
scientific article; zbMATH DE number 6171293
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | OPTIMIZATIONS FOR TENSORIAL BERNSTEIN–BASED SOLVERS BY USING POLYHEDRAL BOUNDS |
scientific article; zbMATH DE number 6171293 |
Statements
OPTIMIZATIONS FOR TENSORIAL BERNSTEIN–BASED SOLVERS BY USING POLYHEDRAL BOUNDS (English)
0 references
6 June 2013
0 references
Bernstein polynomials
0 references
algebraic systems
0 references
subdivision solver
0 references
linear programming
0 references
simplex algorithm
0 references
0 references
