Exact line and plane search for tensor optimization
From MaRDI portal
Publication:5963312
DOI10.1007/S10589-015-9761-5zbMATH Open1361.90046OpenAlexW303777154MaRDI QIDQ5963312FDOQ5963312
Authors: Laurent Sorber, Ignat Domanov, Marc van Barel, Lieven De Lathauwer 
Publication date: 7 March 2016
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://lirias.kuleuven.be/handle/123456789/463246
Recommendations
- An enhanced line search scheme for complex-valued tensor decompositions. Application in DS-CDMA
- Curvilinear Linesearch for Tensor Methods
- Optimization-based algorithms for tensor decompositions: canonical polyadic decomposition, decomposition in rank-\((L_r,L_r,1)\) terms, and a new generalization
- Optimization via separated representations and the canonical tensor decomposition
- Numerical optimization for symmetric tensor decomposition
tensor decompositionexact line searchbivariate polynomial systemtensor optimizationexact plane search
Cites Work
- On the exact computation of the topology of real algebraic curves
- Independent component analysis, a new concept?
- Title not available (Why is that?)
- Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
- Tensor Decompositions and Applications
- Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the asymptotic and practical complexity of solving bivariate systems over the reals
- An Elimination Method for Solving Bivariate Polynomial Systems: Eliminating the Usual Drawbacks
- On the uniqueness of the canonical polyadic decomposition of third-order tensors. I: Basic results and uniqueness of one factor matrix
- On the uniqueness of the canonical polyadic decomposition of third-order tensors. II: Uniqueness of the overall decomposition
- Title not available (Why is that?)
- The Best Rank-1 Approximation of a Symmetric Tensor and Related Spherical Optimization Problems
- Homotopies Exploiting Newton Polytopes for Solving Sparse Polynomial Systems
- A survey of multilinear subspace learning for tensor data
- Title not available (Why is that?)
- New ALS Methods With Extrapolating Search Directions and Optimal Step Size for Complex-Valued Tensor Decompositions
- An enhanced line search scheme for complex-valued tensor decompositions. Application in DS-CDMA
- Higher-Order SVD-Based Subspace Estimation to Improve the Parameter Estimation Accuracy in Multidimensional Harmonic Retrieval Problems
- Tensor Algebra and Multidimensional Harmonic Retrieval in Signal Processing for MIMO Radar
- Decompositions of a Higher-Order Tensor in Block Terms—Part II: Definitions and Uniqueness
- Gröbner bases and systems theory
- Approximate solution of the trust region problem by minimization over two-dimensional subspaces
- Title not available (Why is that?)
- Unconstrained Optimization of Real Functions in Complex Variables
- The evaluation of the zeros of ill-conditioned polynomials. I, II
- Tensor-based techniques for the blind separation of DS-CDMA signals
- Computer Algebra in Scientific Computing
- Matrices in elimination theory
- Dimensionality reduction in higher-order signal processing and rank-\((R_1,R_2,\ldots,R_N)\) reduction in multilinear algebra
- Decompositions of a Higher-Order Tensor in Block Terms—Part III: Alternating Least Squares Algorithms
- Decompositions of a Higher-Order Tensor in Block Terms—Part I: Lemmas for Partitioned Matrices
- Enhanced Line Search: A Novel Method to Accelerate PARAFAC
- A Block Component Model-Based Blind DS-CDMA Receiver
- Numerical solution of bivariate and polyanalytic polynomial systems
- Blind Deconvolution of DS-CDMA Signals by Means of Decomposition in Rank-(1, L, L) Terms
- Blind Separation of Exponential Polynomials and the Decomposition of a Tensor in Rank-$(L_r,L_r,1)$ Terms
- On the (non)existence of undesirable equilibria of Godard blind equalizers
Cited In (6)
- Exploiting Efficient Representations in Large-Scale Tensor Decompositions
- On decompositions and approximations of conjugate partial-symmetric tensors
- Title not available (Why is that?)
- The Dynamics of Swamps in the Canonical Tensor Approximation Problem
- Alternating Mahalanobis Distance Minimization for Accurate and Well-Conditioned CP Decomposition
- On global convergence of alternating least squares for tensor approximation
Uses Software
This page was built for publication: Exact line and plane search for tensor optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5963312)
