Sciweavers

224 search results - page 9 / 45
» Homogeneous Decomposition of Polynomials
Sort
View
SIAMJO
2010
112views more  SIAMJO 2010»
13 years 5 months ago
A Semidefinite Relaxation Scheme for Multivariate Quartic Polynomial Optimization with Quadratic Constraints
We present a general semidefinite relaxation scheme for general n-variate quartic polynomial optimization under homogeneous quadratic constraints. Unlike the existing sum-of-squar...
Zhi-Quan Luo, Shuzhong Zhang
DGCI
2006
Springer
14 years 2 months ago
Minimal Decomposition of a Digital Surface into Digital Plane Segments Is NP-Hard
This paper deals with the complexity of the decomposition of a digital surface into digital plane segments (DPS for short). We prove that the decision problem (does there exist a ...
Isabelle Sivignon, David Coeurjolly
CORR
2010
Springer
139views Education» more  CORR 2010»
13 years 6 months ago
A recombination algorithm for the decomposition of multivariate rational functions
In this paper we show how we can compute in a deterministic way the decomposition of a multivariate rational function with a recombination strategy. The key point of our recombinat...
Guillaume Chèze
DAGSTUHL
2003
14 years 10 days ago
Numerical Irreducible Decomposition Using PHCpack
Homotopy continuation methods have proven to be reliable and efficient to approximate all isolated solutions of polynomial systems. In this paper we show how we can use this capabi...
Andrew J. Sommese, Jan Verschelde, Charles W. Wamp...
ICCV
2011
IEEE
12 years 11 months ago
Optimizing Polynomial Solvers for Minimal Geometry Problems
In recent years polynomial solvers based on algebraic geometry techniques, and specifically the action matrix method, have become popular for solving minimal problems in computer...
Oleg Naroditsky, Kostas Daniilidis