Cover Image

Iterative Belief Propagation for Sparse Combinatorial Optimization

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Reifenstein, Sam, Leleu, Timothée
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Dynamic Anisotropic Smoothing for Noisy Derivative-Free Optimization
by: Reifenstein, Sam, et al.
Published: (2024)

Hybrid Quantum-Classical Optimization for Multi-Objective Supply Chain Logistics
by: Heese, Raoul, et al.
Published: (2026)

Neural Ising Machines via Unrolling and Zeroth-Order Training
by: Reifenstein, Sam, et al.
Published: (2026)

Non-Equilibrium Dynamics of Hybrid Continuous-Discrete Ground-State Sampling
by: Leleu, Timothée, et al.
Published: (2024)

Reshaping Global Loop Structure to Accelerate Local Optimization by Smoothing Rugged Landscapes
by: Leleu, Timothee, et al.
Published: (2026)

Proximal Iterative Hard Thresholding Algorithm for Sparse Group $\ell_0$-Regularized Optimization with Box Constraint
by: Ye, Yuge, et al.
Published: (2025)

An Iteratively Reweighted Method for Sparse Optimization on Nonconvex $\ell_{p}$ Ball
by: Wang, Hao, et al.
Published: (2021)

Accelerating Point-Based Value Iteration via Active Sampling of Belief Points and Gaussian Process Regression
by: Zhou, Siqiong, et al.
Published: (2025)

Combinatorial Optimization and Machine Learning for Dynamic Inventory Routing
by: Greif, Toni, et al.
Published: (2024)

Global Optimization for Combinatorial Geometry Problems Revisited in the Era of LLMs
by: Berthold, Timo, et al.
Published: (2026)

Robust Combinatorial Optimization Problems Under Budgeted Interdiction Uncertainty
by: Goerigk, Marc, et al.
Published: (2023)

Probabilistic Iterative Hard Thresholding for Sparse Learning
by: Bergamaschi, Matteo, et al.
Published: (2024)

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

Sparse Copositive Polynomial Optimization
by: Zhong, Suhan, et al.
Published: (2026)

On Supportedness in Multi-Objective Combinatorial Optimization
by: Könen, David, et al.
Published: (2025)

Combinatorial Optimization Augmented Machine Learning
by: Schiffer, Maximilian, et al.
Published: (2026)

Latent Guided Sampling for Combinatorial Optimization
by: Surendran, Sobihan, et al.
Published: (2025)

Exterior-point Optimization for Sparse and Low-rank Optimization
by: Gupta, Shuvomoy Das, et al.
Published: (2020)

Sparse Polynomial Optimization with Matrix Constraints
by: Nie, Jiawang, et al.
Published: (2024)

Pointer Networks with Q-Learning for Combinatorial Optimization
by: Barro, Alessandro
Published: (2023)

Augmenting Iterative Trajectory for Bilevel Optimization: Methodology, Analysis and Extensions
by: Liu, Risheng, et al.
Published: (2023)

Iterative Implicit Gradients for Nonconvex Optimization with Variational Inequality Constraints
by: Kaushik, Harshal D., et al.
Published: (2022)

PINS: Proximal Iterations with Sparse Newton and Sinkhorn for Optimal Transport
by: Wu, Di, et al.
Published: (2025)

BP-MPC: Optimizing the Closed-Loop Performance of MPC using BackPropagation
by: Zuliani, Riccardo, et al.
Published: (2023)

Stochastic Optimization Algorithms for Problems with Controllable Biased Oracles
by: Liu, Yin, et al.
Published: (2023)

Smoothing Iterative Consensus-based Optimization Algorithm for Nonsmooth Nonconvex Optimization Problems with Global Optimality
by: Wei, Jiazhen, et al.
Published: (2025)

Iterative Switching Time Optimization for Mixed-integer Optimal Control Problems
by: Abbasi-Esfeden, Ramin, et al.
Published: (2025)

Reheated Gradient-based Discrete Sampling for Combinatorial Optimization
by: Li, Muheng, et al.
Published: (2025)

Distributed Nonconvex Optimization: Gradient-free Iterations and $ε$-Globally Optimal Solution
by: He, Zhiyu, et al.
Published: (2020)

From Optimization to Control: Quasi Policy Iteration
by: Kolarijani, Mohammad Amin Sharifi, et al.
Published: (2023)

Last Iterate Convergence of AdaGrad-Norm for Convex Non-Smooth Optimization
by: Preobrazhenskaia, Margarita, et al.
Published: (2026)

Combinatorial Admissibility in Control-Affine Networks
by: Zelazo, Daniel, et al.
Published: (2026)

An Iterative Problem-Driven Scenario Reduction Framework for Stochastic Optimization with Conditional Value-at-Risk
by: Zhuang, Yingrui, et al.
Published: (2025)

Enhancing GNNs Performance on Combinatorial Optimization by Recurrent Feature Update
by: Pugacheva, Daria, et al.
Published: (2024)

Nonlinear Eigen-approach ADMM for Sparse Optimization on Stiefel Manifold
by: Wang, Jiawei, et al.
Published: (2024)

Combinatorial Sparse PCA Beyond the Spiked Identity Model
by: Kumar, Syamantak, et al.
Published: (2026)

Limited-Memory LRSGA: An Iterative Method for Computing Nash Equilibria in Competitive Optimization Problems
by: Foglia, Katherine Rossella, et al.
Published: (2025)

A Block-Alternating Iterative Approach for a Class of Non-Convex Optimization Problems
by: Li, Anran, et al.
Published: (2026)

Next-Generation Iterative Algorithms for Large-Scale Min-Max Optimization: Design and Analysis
by: Choudhury, Sayantan
Published: (2025)

Accelerated Proximal Dogleg Majorization for Sparse Regularized Quadratic Optimization Problem
by: Zhao, Feifei, et al.
Published: (2025)