Z-eigenvalue methods for a global polynomial optimization problem

DOI10.1007/s10107-007-0193-6zbMath1169.90022OpenAlexW1981973750MaRDI QIDQ1016123

Publication date: 4 May 2009

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-007-0193-6

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items

An iterative scheme for testing the positive definiteness of multivariate homogeneous forms, New bounds for the spectral radius for nonnegative tensors, Minimal Geršgorin tensor eigenvalue inclusion set and its approximation, Smoothing approximation to the lower order exact penalty function for inequality constrained optimization, Higher-degree eigenvalue complementarity problems for tensors, Concepts and techniques of optimization on the sphere, A new simultaneous iterative method with a parameter for solving the extended split equality problem and the extended split equality fixed point problem, The cubic spherical optimization problems, \(M\)-numerical ranges of odd-order tensors based on operators, An adaptive gradient method for computing generalized tensor eigenpairs, Alternating proximal penalization algorithm for the modified multiple-sets split feasibility problems, Calculating \(C\)-eigenpairs of piezoelectric-type tensors via a \(Z\)-eigenpair method, A Positivity Preserving Inverse Iteration for Finding the Perron Pair of an Irreducible Nonnegative Third Order Tensor, Computing extreme eigenvalues of large scale Hankel tensors, Unnamed Item, On the largest eigenvalue of a symmetric nonnegative tensor, Finding the extreme Z-eigenvalues of tensors via a sequential semidefinite programming method, The Z -eigenvalues of a symmetric tensor and its application to spectral hypergraph theory, A cone constrained convex program: structure and algorithms, Nonnegative diffusion orientation distribution function, A sequential subspace projection method for extreme Z-eigenvalues of supersymmetric tensors, On the spherical convexity of quadratic functions, Convergence of an algorithm for the largest singular value of a nonnegative rectangular tensor, Perturbation bounds for the largest \(C\)-eigenvalue of piezoelectric-type tensors, A self-adaptive trust region method for extreme \(\mathcal {B}\)-eigenvalues of symmetric tensors, On solving biquadratic optimization via semidefinite relaxation, Bounds for the spectral radius of nonnegative tensors, New practical criteria for ℋ-tensors and its application, A DCA-Newton method for quartic minimization over the sphere, Feasible Newton methods for symmetric tensor Z-eigenvalue problems, Linear convergence of an algorithm for largest singular value of a nonnegative rectangular tensor, Efficient algorithms for computing the largest eigenvalue of a nonnegative tensor, An algorithm for the largest eigenvalue of nonhomogeneous nonnegative polynomials, A MODIFIED FR CONJUGATE GRADIENT METHOD FOR COMPUTING -EIGENPAIRS OF SYMMETRIC TENSORS, Some Ostrowski-type bound estimations of spectral radius for weakly irreducible nonnegative tensors, Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems, A tensor singular values and its symmetric embedding eigenvalues, Properties and methods for finding the best rank-one approximation to higher-order tensors, Calculating entanglement eigenvalues for nonsymmetric quantum pure states based on the Jacobian semidefinite programming relaxation method, Further study on \(Z\)-eigenvalue localization set and positive definiteness of fourth-order tensors, Further results on Cauchy tensors and Hankel tensors, Cross-Hill: a heuristic method for global optimization, Programmable criteria for strong \(\mathcal {H}\)-tensors, Iterative algorithms for computing US- and U-eigenpairs of complex tensors, D-eigenvalues of diffusion kurtosis tensors, Bounds for the M-spectral radius of a fourth-order partially symmetric tensor, Semidefinite relaxation approximation for multivariate bi‐quadratic optimization with quadratic constraints, Computing the generalized eigenvalues of weakly symmetric tensors, Computing the largest H-eigenvalue of large-scale tensors generated from directed hypergraphs, Real eigenvalues of nonsymmetric tensors, \(Z\)-eigenvalue inclusion theorems for tensors, On cones of nonnegative quartic forms, Numerical multilinear algebra and its applications, Criterions for identifying \(\mathcal H\)-tensors, Criterions for the positive definiteness of real supersymmetric tensors, Alternating direction method of multipliers for real and complex polynomial optimization models, On approximate diagonalization of third order symmetric tensors by orthogonal transformations, Theorems of the alternative for inequality systems of real polynomials, A class of second-order cone eigenvalue complementarity problems for higher-order tensors, A hybrid second-order method for homogenous polynomial optimization over unit sphere, Computing geometric measure of entanglement for symmetric pure states via the Jacobian SDP relaxation technique, An always convergent algorithm for the largest eigenvalue of an irreducible nonnegative tensor, Singular values of a real rectangular tensor, On computing minimal \(H\)-eigenvalue of sign-structured tensors, Tensor \(Z\)-eigenvalue complementarity problems, Solution structures of tensor complementarity problem, Note on \(Z \)-eigenvalue inclusion theorems for tensors, Computing Tensor Eigenvalues via Homotopy Methods, On the cone eigenvalue complementarity problem for higher-order tensors, A successive approximation method for quantum separability, Numerical ranges of even-order tensor, Computing tensor Z-eigenvalues via shifted inverse power method, A convergent Newton algorithm for computing Z-eigenvalues of an almost nonnegative irreducible tensor, Space tensor conic programming, Brauer-type upper bounds for z-spectral radius of weakly symmetric nonnegative tensors, SDP relaxation algorithms for \(\mathbf{P(P}_0)\)-tensor detection, Iterative methods for computing U-eigenvalues of non-symmetric complex tensors with application in quantum entanglement, A descent cautious BFGS method for computing US-eigenvalues of symmetric complex tensors, A potential reduction method for tensor complementarity problems, A semidefinite relaxation algorithm for checking completely positive separable matrices, On the perturbation of rank-one symmetric tensors, New eigenvalue inclusion sets for tensors, Computing Eigenvalues of Large Scale Sparse Tensors Arising from a Hypergraph, An efficient alternating minimization method for fourth degree polynomial optimization, Conditions for strong ellipticity of anisotropic elastic materials, Conditions for strong ellipticity and M-eigenvalues, Direct methods to compute all \(Z\)-eigenpairs of a tensor with dimension 2 or 3, Z-eigenvalue intervals of even-order tensors with application to judge the strong ellipticity of an elasticity tensor, Decomposition of completely symmetric states, Sharp Z-eigenvalue inclusion set-based method for testing the positive definiteness of multivariate homogeneous forms, The geometric measure of entanglement of multipartite states and the \(Z\)-eigenvalue of tensors, A new eigenvalue inclusion set for tensors and its applications, A generalization of inverse power method for computing eigenpairs of symmetric tensors, Enhance capability of separable ball criterion for the bipartite quantum states

Cites Work