Multi-objective k-way parallel hypergraph partitioning with proximal gradient algorithm

DOI10.1007/S10589-025-00749-XMaRDI QIDQ6844269zbMATH OpenFDO

Authors Yingying Li, Hongwei Liu, Hailong You, Zexian Liu, Fang Zhang

Publication date 16 March 2026

Published in Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10589-025-00749-X

zbMATH Keywords

hypergraph partitioningmulti-objective optimizationparallel technologyproximal gradient

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites work

• A class of accelerated subspace minimization conjugate gradient methods
• A class of modified accelerated proximal gradient methods for nonsmooth and nonconvex minimization problems
• A family of gradient methods using Householder transformation with application to hypergraph partitioning
• A nonmonotone accelerated proximal gradient method with variable stepsize strategy for nonsmooth and nonconvex minimization problems
• An Efficient Heuristic Procedure for Partitioning Graphs
• An improved Dai-Kou conjugate gradient algorithm for unconstrained optimization
• Benchmarking optimization software with performance profiles.
• Community-Based Event Dissemination with Optimal Load Balancing
• Engineering a direct \(k\)-way hypergraph partitioning algorithm
• High-Quality Hypergraph Partitioning
• scientific article; zbMATH DE number 3417498 (Why is no real title available?)
• Lower Bounds for the Partitioning of Graphs
• LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison
• Multiple-way network partitioning
• New gradient methods with adaptive stepsizes by approximate models
• Paths, Trees, and Flowers
• Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
• Scalable Shared-Memory Hypergraph Partitioning
• SDP-based bounds for graph partition via extended ADMM
• Semidefinite programming and eigenvalue bounds for the graph partition problem
• The Fiedler vector of a Laplacian tensor for hypergraph partitioning
• UMPa: A multi-objective, multi-level partitioner for communication minimization

Cited in

(1)

• Constraint hypergraph partitioning problems via recursive bipartition algorithm based on improved Dai-Kou conjugate gradient algorithm

This page was built for publication: Multi-objective \(k\)-way parallel hypergraph partitioning with proximal gradient algorithm

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