An efficient quadratic penalty method for a class of graph clustering problems

DOI10.1007/S11081-025-10042-9MaRDI QIDQ7404345zbMATH OpenFDO

Authors Wenshun Teng, Qing-Na Li

Publication date 2026

Published in Optimization and Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S11081-025-10042-9

zbMATH Keywords

graph clusteringnetwork community detectionprojected gradient methodquadratic penalty methodsemi-assignment problemssparse optimization

Mathematics Subject Classification ID

Applications of graph theory (05C90) Integer programming (90C10) Quadratic programming (90C20) Combinatorial optimization (90C27)

Cites work

• A quadratic penalty method for hypergraph matching
• A Statistical Performance Analysis of Graph Clustering Algorithms
• Algorithms for graph partitioning on the planted partition model
• An efficient quadratic programming relaxation based algorithm for large-scale MIMO detection
• Community structure in social and biological networks
• Fast unfolding of communities in large networks: 15 years later
• Graph clustering
• Graph clustering via intra-cluster density maximization
• Graph clustering with Boltzmann machines
• scientific article; zbMATH DE number 2061729 (Why is no real title available?)
• scientific article; zbMATH DE number 5060482 (Why is no real title available?)
• Integer Programming
• Linear and quadratic programming approaches for the general graph partitioning problem
• Nonmonotone Spectral Projected Gradient Methods on Convex Sets
• Optimization theory and methods. Nonlinear programming
• Robust optimization of graph partitioning involving interval uncertainty
• The Elements of Statistical Learning
• Two-Point Step Size Gradient Methods

This page was built for publication: An efficient quadratic penalty method for a class of graph clustering problems

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