Multivariate polynomial minimization and its application in signal processing
From MaRDI portal
Recommendations
- \(n\)D polynomial matrices with applications to multidimensional signal analysis
- scientific article; zbMATH DE number 1742124
- scientific article; zbMATH DE number 2131806
- scientific article; zbMATH DE number 4023120
- Global minimization of a multivariate polynomial using matrix methods
- Non-linear local polynomial regression multiresolution methods using ^1-norm minimization with application to signal processing
- Signal analysis and weighted polynomial approximation
- Optimally space localized polynomials with applications in signal processing
- Majorization-Minimization Algorithms in Signal Processing, Communications, and Machine Learning
- Convex optimization for signal processing and communications. From fundamentals to applications
Cited in
(46)- The degree of the E-characteristic polynomial of an even order tensor
- Optimality conditions and optimization methods for quartic polynomial optimization
- On global integer extrema of real-valued box-constrained multivariate quadratic functions
- Global optimization of polynomials over real algebraic sets
- A robust unscented transformation for uncertain moments
- A cubically convergent method for solving the largest eigenvalue of a nonnegative irreducible tensor
- Real eigenvalues of nonsymmetric tensors
- Theorems of the alternative for inequality systems of real polynomials
- Semismoothness of the maximum eigenvalue function of a symmetric tensor and its application
- Tensor \(Z\)-eigenvalue complementarity problems
- The point-wise convergence of shifted symmetric higher order power method
- An efficient PGM-based algorithm with backtracking strategy for solving quadratic optimization problems with spherical constraint
- Eigenvalue bounds of third-order tensors via the minimax eigenvalue of symmetric matrices
- Steklov convexification and a trajectory method for global optimization of multivariate quartic polynomials
- Criterions for the positive definiteness of real supersymmetric tensors
- A subspace modified Broyden-Fletcher-Goldfarb-Shanno method for \(\mathcal{B} \)-eigenvalues of symmetric tensors
- A quadratically convergent algorithm for finding the largest eigenvalue of a nonnegative homogeneous polynomial map
- Optimum short-time polynomial regression for signal analysis
- On the spherical convexity of quadratic functions
- Maximization of homogeneous polynomials over the simplex and the sphere: structure, stability, and generic behavior
- Local convergence analysis of inverse iteration algorithm for computing the H-spectral radius of a nonnegative weakly irreducible tensor
- Projections onto convex sets on the sphere
- Eigenvalues of a real supersymmetric tensor
- Extrema of a real polynomial
- The geometry of decoupling fields
- Bound estimations of bi-block \(M\)-eigenvalues for bi-block symmetric tensors
- A tensor analogy of Yuan's theorem of the alternative and polynomial optimization with sign structure
- On meet hypermatrices and their eigenvalues
- Concepts and techniques of optimization on the sphere
- The Z-eigenvalues of a symmetric tensor and its application to spectral hypergraph theory.
- A sequential subspace projection method for extreme Z-eigenvalues of supersymmetric tensors.
- The location of H-eigenvalues of real even order symmetry tensors
- New iterative codes for \(\mathcal H\)-tensors and an application
- Fused-MCP With Application to Signal Processing
- Finding the maximum eigenvalue of essentially nonnegative symmetric tensors via sum of squares programming
- Majorization-Minimization Algorithms in Signal Processing, Communications, and Machine Learning
- Global optimality conditions and optimization methods for polynomial programming problems
- A convergent Newton algorithm for computing Z-eigenvalues of an almost nonnegative irreducible tensor
- Inhomogeneous polynomial optimization over a convex set: an approximation approach
- Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
- Locally Optimal Eigenpairs of Orthogonally Decomposable Tensors: A Generalized Proof
- T-semidefinite programming relaxation with third-order tensors for constrained polynomial optimization
- The multivariate eigenvalues of symmetric tensors
- Approximation algorithms for nonnegative polynomial optimization problems over unit spheres
- Interval B-tensors and interval double B-tensors
- Eigenvalues and invariants of tensors
This page was built for publication: Multivariate polynomial minimization and its application in signal processing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1404397)
