A tensor optimization algorithm for computing Lagrangians of hypergraphs
From MaRDI portal
Publication:6051173
DOI10.1007/s10957-023-02215-2zbMath1521.05129arXiv2302.05875OpenAlexW4366758554MaRDI QIDQ6051173
Jingya Chang, Bin Xiao, Xin Zhang
Publication date: 19 September 2023
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2302.05875
Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Numerical mathematical programming methods (65K05) Numerical optimization and variational techniques (65K10) Hypergraphs (05C65)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Spectra of uniform hypergraphs
- On the largest graph-Lagrangian of 3-graphs with fixed number of edges
- Extremal problems whose solutions are the blowups of the small Witt- designs
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- Convergence rate analysis for the higher order power method in best rank one approximations of tensors
- Computing the \(p\)-spectral radii of uniform hypergraphs with applications
- Lagrangians of hypergraphs. II: When colex is best
- Hypergraph Lagrangians. I: The Frankl-Füredi conjecture is false
- Computing Eigenvalues of Large Scale Sparse Tensors Arising from a Hypergraph
- Lagrangians of Hypergraphs
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- A New Active Set Algorithm for Box Constrained Optimization
- Two-Point Step Size Gradient Methods
- The Fiedler Vector of a Laplacian Tensor for Hypergraph Partitioning
- Equipping the Barzilai--Borwein Method with the Two Dimensional Quadratic Termination Property
- Hypergraph Clustering Using a New Laplacian Tensor with Applications in Image Processing
- Maxima for Graphs and a New Proof of a Theorem of Turán
- Tensor Analysis
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Lagrangian densities of linear forests and Turán numbers of their extensions
This page was built for publication: A tensor optimization algorithm for computing Lagrangians of hypergraphs
