A proximal alternating minimization algorithm for the largest C-eigenvalue of piezoelectric-type tensors
From MaRDI portal
Publication:6064027
DOI10.1007/s10898-022-01180-wMaRDI QIDQ6064027
Y. J. Wang, Wenjie Wang, Hai-Bin Chen, Guanglu Zhou
Publication date: 8 November 2023
Published in: Journal of Global Optimization (Search for Journal in Brave)
Nonlinear programming (90C30) Numerical solution of nonlinear eigenvalue and eigenvector problems (65H17)
Cites Work
- Unnamed Item
- Unnamed Item
- Alternating direction method for bi-quadratic programming
- Copositive tensor detection and its applications in physics and hypergraphs
- Copositivity detection of tensors: theory and algorithm
- A globally convergent algorithm for nonconvex optimization based on block coordinate update
- C-eigenvalue inclusion theorems for piezoelectric-type tensors
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- \(C\)-eigenvalues intervals for piezoelectric-type tensors
- The hierarchy of local minimums in polynomial optimization
- Generating polynomials and symmetric tensor decompositions
- On the use of homogeneous polynomials to develop anisotropic yield functions with applications to sheet forming
- Eigenvalues of a real supersymmetric tensor
- Global Optimization with Polynomials and the Problem of Moments
- A Unified Convergence Analysis of Block Successive Minimization Methods for Nonsmooth Optimization
- Polynomial Optimization with Real Varieties
- Maximum Block Improvement and Polynomial Optimization
- Semidefinite Relaxations for Best Rank-1 Tensor Approximations
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Shifted Power Method for Computing Tensor Eigenpairs
- A semidefinite program approach for computing the maximum eigenvalue of a class of structured tensors and its applications in hypergraphs and copositivity test
- Nonnegative Polynomial Optimization over Unit Spheres and Convex Programming Relaxations
- Alternating direction method of multipliers for real and complex polynomial optimization models
- Convergence analysis of a block improvement method for polynomial optimization over unit spheres
- Convergence of a block coordinate descent method for nondifferentiable minimization