116 search results - page 3 / 24 » A Quadratically Convergent Algorithm for Structured Low-Rank... |
CASC
2009
Springer
15 years 5 months ago
2009
Springer
This work addresses the problem of computing a certified ǫ-approximation of all real roots of a square-free integer polynomial. We proof an upper bound for its bit complexity, b...
70
Voted
ICASSP
2010
IEEE
14 years 10 months ago
2010
IEEE
Parallel factor (PARAFAC) analysis is an extension of a low rank decomposition to higher way arrays, usually called tensors. Most of existing methods are based on an alternating l...
CVPR
2007
IEEE
16 years 18 days ago
2007
IEEE
The success of tensor-based subspace learning depends heavily on reducing correlations along the column vectors of the mode-k flattened matrix. In this work, we study the problem ...
105
click to vote
OL
2007
14 years 10 months ago
2007
We propose an SQP-type algorithm for solving nonlinear second-order cone programming (NSOCP) problems. At every iteration, the algorithm solves a convex SOCP subproblem in which th...
CEC
2005
IEEE
15 years 4 months ago
2005
IEEE
Abstract- This paper presents a new operator for genetic algorithms that enhances their convergence in the case of nonlinear problems with nonlinear equality constraints. The propo...