A family of gradient methods using Householder transformation with application to hypergraph partitioning

DOI10.1007/S11075-023-01593-YMaRDI QIDQ6140902OpenAlexFDO

Authors Xin Zhang, Jingya Chang, Zhili Ge, Zhou Sheng

Publication date 22 January 2024

Published in Numerical Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11075-023-01593-y

zbMATH Keywords

conjugate gradientimage segmentationtensor eigenvaluehypergraph partitioningHouseholder transform

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Graph theory (including graph drawing) in computer science (68R10) Computing methodologies for image processing (68U10) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• The Fiedler vector of a Laplacian tensor for hypergraph partitioning
• Hypergraph clustering using a new Laplacian tensor with applications in image processing
• The \(Z\)-eigenvalues of a symmetric tensor and its application to spectral hypergraph theory.
• The abstract Laplacian tensor of a hypergraph with applications in clustering
• Computing the largest H-eigenvalue of large-scale tensors generated from directed hypergraphs

Cites work

• scientific article; zbMATH DE number 3681933 (Why is no real title available?)
• scientific article; zbMATH DE number 1243473 (Why is no real title available?)
• scientific article; zbMATH DE number 3278849 (Why is no real title available?)
• scientific article; zbMATH DE number 3417498 (Why is no real title available?)
• scientific article; zbMATH DE number 964896 (Why is no real title available?)
• A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
• A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
• A convergent Newton algorithm for computing Z-eigenvalues of an almost nonnegative irreducible tensor
• A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations
• A modified conjugate gradient method for general convex functions
• A quadratically convergent algorithm for finding the largest eigenvalue of a nonnegative homogeneous polynomial map
• A sequential subspace projection method for extreme Z-eigenvalues of supersymmetric tensors.
• A survey of nonlinear conjugate gradient methods
• Algebraic connectivity of an even uniform hypergraph
• All real eigenvalues of symmetric tensors
• An adaptive gradient method for computing generalized tensor eigenpairs
• An adaptive shifted power method for computing generalized tensor eigenpairs
• Circulant tensors with applications to spectral hypergraph theory and stochastic process
• Complex graphs and networks
• Computing eigenvalues of large scale sparse tensors arising from a hypergraph
• Computing extreme eigenvalues of large scale Hankel tensors
• Computing tensor eigenvalues via homotopy methods
• Computing the \(p\)-spectral radii of uniform hypergraphs with applications
• Efficient generalized conjugate gradient algorithms. I: Theory
• Eigenvalues of a real supersymmetric tensor
• Family weak conjugate gradient algorithms and their convergence analysis for nonconvex functions
• Function minimization by conjugate gradients
• Global Convergence Properties of Conjugate Gradient Methods for Optimization
• Hypergraph clustering using a new Laplacian tensor with applications in image processing
• Laplacian and signless Laplacian Z-eigenvalues of uniform hypergraphs
• Methods of conjugate gradients for solving linear systems
• New properties of a nonlinear conjugate gradient method
• On the Best Rank-1 and Rank-(R₁ ,R₂ ,. . .,R_N) Approximation of Higher-Order Tensors
• On the best rank-1 approximation of higher-order supersymmetric tensors
• Shifted power method for computing tensor eigenpairs
• Spectra of uniform hypergraphs
• Spectral directed hypergraph theory via tensors
• The Fiedler vector of a Laplacian tensor for hypergraph partitioning
• The Laplacian of a uniform hypergraph
• The \(Z\)-eigenvalues of a symmetric tensor and its application to spectral hypergraph theory.
• The clique and coclique numbers' bounds based on the H-eigenvalues of uniform hypergraphs
• The conjugate gradient method in extremal problems
• The global convergence of the Polak-Ribière-Polyak conjugate gradient algorithm under inexact line search for nonconvex functions
• The largest \(H\)-eigenvalue and spectral radius of Laplacian tensor of non-odd-bipartite generalized power hypergraphs
• \(H^{+}\)-eigenvalues of Laplacian and signless Laplacian tensors

This page was built for publication: A family of gradient methods using Householder transformation with application to hypergraph partitioning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6140902)