Cover Image

Data Clustering and Visualization with Recursive Goemans-Williamson MaxCut Algorithm

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Ly, An, Sawhney, Raj, Chugunova, Marina
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Data Clustering and Visualization with Recursive Max k-Cut Algorithm
by: Ly, An, et al.
Published: (2024)

Benign landscape for Burer-Monteiro factorizations of MaxCut-type semidefinite programs
by: Endor, Faniriana Rakoto, et al.
Published: (2024)

A Primal-Dual Extension of the Goemans--Williamson Algorithm for the Weighted Fractional Cut-Covering Problem
by: Proença, Nathan Benedetto, et al.
Published: (2023)

Generalized Cuts and Grothendieck Covers: a Primal-Dual Approximation Framework Extending the Goemans--Williamson Algorithm
by: Proença, Nathan Benedetto, et al.
Published: (2024)

Solving Max-Cut to Global Optimality via Feasibility-Preserving Graph Neural Networks
by: Chen, Hao, et al.
Published: (2026)

On the Correctness of the Generalized Isotonic Recursive Partitioning Algorithm
by: Won, Joong-Ho, et al.
Published: (2024)

A Semidefinite Programming-Based Branch-and-Cut Algorithm for Biclustering
by: Sudoso, Antonio M.
Published: (2024)

Speeding up the Goemans-Williamson randomized procedure by difference-of-convex optimization
by: Salloum, Hadi, et al.
Published: (2025)

Exponential Speed-ups for Structured Goemans-Williamson relaxations via Quantum Gibbs States and Pauli Sparsity
by: Yuan, Haomu, et al.
Published: (2025)

Single-Loop Stochastic Algorithms for Difference of Max-Structured Weakly Convex Functions
by: Hu, Quanqi, et al.
Published: (2024)

Sample Complexity of Algorithm Selection Using Neural Networks and Its Applications to Branch-and-Cut
by: Cheng, Hongyu, et al.
Published: (2024)

Stability and Generalization for Stochastic Recursive Momentum-based Algorithms for (Strongly-)Convex One to $K$-Level Stochastic Optimizations
by: Pan, Xiaokang, et al.
Published: (2024)

Koopman Data-Driven Predictive Control with Robust Stability and Recursive Feasibility Guarantees
by: de Jong, Thomas, et al.
Published: (2024)

A Single-Loop Smoothed Gradient Descent-Ascent Algorithm for Nonconvex-Concave Min-Max Problems
by: Zhang, Jiawei, et al.
Published: (2020)

Accelerating Cutting-Plane Algorithms via Reinforcement Learning Surrogates
by: Mana, Kyle, et al.
Published: (2023)

A Global Optimization Algorithm for K-Center Clustering of One Billion Samples
by: Ren, Jiayang, et al.
Published: (2022)

Diffusion Stochastic Optimization for Min-Max Problems
by: Cai, Haoyuan, et al.
Published: (2024)

Exploiting Low-Rank Structure in Max-K-Cut Problems
by: Stevens, Ria, et al.
Published: (2026)

Learning Cut Generating Functions for Integer Programming
by: Cheng, Hongyu, et al.
Published: (2024)

Implicit Riemannian Optimism with Applications to Min-Max Problems
by: Roux, Christophe, et al.
Published: (2025)

Classical optimization with imaginary time block encoding on quantum computers: The MaxCut problem
by: Zhong, Dawei, et al.
Published: (2024)

Tiny Recursive Models for Solving the J2-Perturbed Lambert Problem
by: Wijayatunga, Minduli, et al.
Published: (2026)

The Limit Points of (Optimistic) Gradient Descent in Min-Max Optimization
by: Daskalakis, Constantinos, et al.
Published: (2018)

Generalization Guarantees for Learning Branch-and-Cut Policies in Integer Programming
by: Cheng, Hongyu, et al.
Published: (2025)

Recursively Feasible Probabilistic Safe Online Learning with Control Barrier Functions
by: Castañeda, Fernando, et al.
Published: (2022)

On the Stability Connection Between Discrete-Time Algorithms and Their Resolution ODEs: Applications to Min-Max Optimisation
by: Farzin, Amir Ali, et al.
Published: (2026)

Beyond the Bellman Recursion: A Pontryagin-Guided Framework for Non-Exponential Discounting
by: Ko, Hojin, et al.
Published: (2026)

Accelerated Stochastic Min-Max Optimization Based on Bias-corrected Momentum
by: Cai, Haoyuan, et al.
Published: (2024)

On the Convergence of Min-Max Langevin Dynamics and Algorithm
by: Cai, Yang, et al.
Published: (2024)

Scalable Min-Max Optimization via Primal-Dual Exact Pareto Optimization
by: Park, Sangwoo, et al.
Published: (2025)

Online Min-Max Optimization: From Individual Regrets to Cumulative Saddle Points
by: Vyas, Abhijeet, et al.
Published: (2026)

Active Learning of Deep Neural Networks via Gradient-Free Cutting Planes
by: Zhang, Erica, et al.
Published: (2024)

Harnessing Data from Clustered LQR Systems: Personalized and Collaborative Policy Optimization
by: Kanakeri, Vinay, et al.
Published: (2025)

Revisiting Inexact Fixed-Point Iterations for Min-Max Problems: Stochasticity and Structured Nonconvexity
by: Alacaoglu, Ahmet, et al.
Published: (2024)

Min-Max Connected Multiway Cut
by: Tiwary, Hans Raj, et al.
Published: (2026)

Accelerated Algorithms for Constrained Nonconvex-Nonconcave Min-Max Optimization and Comonotone Inclusion
by: Cai, Yang, et al.
Published: (2022)

Learn2Aggregate: Supervised Generation of Chvátal-Gomory Cuts Using Graph Neural Networks
by: Deza, Arnaud, et al.
Published: (2024)

Equity-Transformer: Solving NP-hard Min-Max Routing Problems as Sequential Generation with Equity Context
by: Son, Jiwoo, et al.
Published: (2023)

FedCluster: Boosting the Convergence of Federated Learning via Cluster-Cycling
by: Chen, Cheng, et al.
Published: (2020)

From Inverse Optimization to Feasibility to ERM
by: Mishra, Saurabh, et al.
Published: (2024)