Imagen de Portada

A Bregman-Sinkhorn Algorithm for the Maximum Weight Independent Set Problem

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Haller, Stefan, Savchynskyy, Bogdan
Formato:	Preprint
Publicado:	2024
Materias:	Optimization and Control
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Relative-Interior Solution for the (Incomplete) Linear Assignment Problem with Applications to the Quadratic Assignment Problem
por: Dlask, Tomáš, et al.
Publicado: (2023)

A Metaheuristic Algorithm for Large Maximum Weight Independent Set Problems
por: Dong, Yuanyuan, et al.
Publicado: (2022)

Sharper Exponential Convergence Rates for Sinkhorn's Algorithm in Continuous Settings
por: Chizat, Lénaïc, et al.
Publicado: (2024)

A Clustering-Based Variable Ordering Framework for Relaxed Decision Diagrams for Maximum Weighted Independent Set Problem
por: Nafar, Mohsen, et al.
Publicado: (2025)

Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem
por: Großmann, Ernestine, et al.
Publicado: (2024)

A Triple-Bregman Balanced Primal-Dual Algorithm for Saddle Point Problems
por: Yu, Jintao, et al.
Publicado: (2025)

From Maximum Cut to Maximum Independent Set
por: Wu, Chuixiong, et al.
Publicado: (2024)

Variable Bregman Majorization-Minimization Algorithm and its Application to Dirichlet Maximum Likelihood Estimation
por: Martin, Ségolène, et al.
Publicado: (2025)

Generalized Bregman Projection Algorithms for Solving Nonlinear Split Feasibility Problems in Infinite-Dimensional Spaces
por: Sababe, Saeed Hashemi, et al.
Publicado: (2025)

Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem
por: Gao, Xuan-Zhao, et al.
Publicado: (2024)

On Sinkhorn's Algorithm and Choice Modeling
por: Qu, Zhaonan, et al.
Publicado: (2023)

qReduMIS: A Quantum-Informed Reduction Algorithm for the Maximum Independent Set Problem
por: Schuetz, Martin J. A., et al.
Publicado: (2025)

Stochastic Bregman Subgradient Methods for Nonsmooth Nonconvex Optimization Problems
por: Ding, Kuangyu, et al.
Publicado: (2024)

Variance-reduction for Variational Inequality Problems with Bregman Distance Function
por: Alizadeh, Zeinab, et al.
Publicado: (2024)

A Sinkhorn-type Algorithm for Constrained Optimal Transport
por: Tang, Xun, et al.
Publicado: (2024)

Accelerating Sinkhorn Algorithm with Sparse Newton Iterations
por: Tang, Xun, et al.
Publicado: (2024)

Assessing and Enhancing Graph Neural Networks for Combinatorial Optimization: Novel Approaches and Application in Maximum Independent Set Problems
por: Hu, Chenchuhui
Publicado: (2024)

A Bregman Proximal Stochastic Gradient Method with Extrapolation for Nonconvex Nonsmooth Problems
por: Wang, Qingsong, et al.
Publicado: (2024)

Strength of the Upper Bounds for the Edge-Weighted Maximum Clique Problem
por: Ciccarelli, Fabio, et al.
Publicado: (2025)

A Bregman Regularized Proximal Point Method for Solving Equilibrium Problems on Hadamard Manifolds
por: Sharma, Shikher, et al.
Publicado: (2026)

Importance Sparsification for Sinkhorn Algorithm
por: Li, Mengyu, et al.
Publicado: (2023)

On the Complexity of Bilevel Independent Set Problem
por: Muluk, Komal
Publicado: (2026)

On the nature of Bregman functions
por: Pauwels, Edouard
Publicado: (2023)

Non-Convex Robust Hypothesis Testing using Sinkhorn Uncertainty Sets
por: Wang, Jie, et al.
Publicado: (2024)

A Generalized Sinkhorn Algorithm for Mean-Field Schrödinger Bridge
por: Eldesoukey, Asmaa, et al.
Publicado: (2026)

Hardness of the Maximum Independent Set Problem on Unit-Disk Graphs and Prospects for Quantum Speedups
por: Andrist, Ruben S., et al.
Publicado: (2023)

An Inexact Bregman Proximal Difference-of-Convex Algorithm with Two Types of Relative Stopping Criteria
por: Yang, Lei, et al.
Publicado: (2024)

An Inertial Bregman Proximal DC Algorithm for Generalized DC Programming with Application to Data Completion
por: Pan, Chenjian, et al.
Publicado: (2024)

Inertial Proximal Difference-of-Convex Algorithm with Convergent Bregman Plug-and-Play for Nonconvex Imaging
por: Chow, Tsz Ching, et al.
Publicado: (2024)

Unrealized Expectations: Comparing AI Methods vs Classical Algorithms for Maximum Independent Set
por: Wu, Yikai, et al.
Publicado: (2025)

Accelerating Sinkhorn for Entropy-Regularized Optimal Transport
por: Xu, Zeyi, et al.
Publicado: (2026)

Spurious Stationarity and Hardness Results for Bregman Proximal-Type Algorithms
por: Chen, He, et al.
Publicado: (2024)

Bregman three-operator splitting methods
por: Jiang, Xin, et al.
Publicado: (2022)

Optimization of Bregman Variational Learning Dynamics
por: Cha, Jinho, et al.
Publicado: (2025)

Multifractal Analysis of the Sinkhorn Algorithm: Unveiling the Intricate Structure of Optimal Transport Maps
por: Mena, Jose Rafael Espinosa
Publicado: (2024)

Nested Stochastic Algorithm for Generalized Sinkhorn distance-Regularized Distributionally Robust Optimization
por: Yang, Yufeng, et al.
Publicado: (2025)

Well-Posedness and Efficient Algorithms for Inverse Optimal Transport with Bregman Regularization
por: Bao, Chenglong, et al.
Publicado: (2025)

Delay-tolerant distributed Bregman proximal algorithms
por: Chraibi, S., et al.
Publicado: (2024)

Box-constrained L0 Bregman-relaxations
por: Essafri, Mhamed, et al.
Publicado: (2025)

Sinkhorn Distributionally Robust Optimization
por: Wang, Jie, et al.
Publicado: (2021)