Imagen de Portada

A Semidefinite Programming-Based Branch-and-Cut Algorithm for Biclustering

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Sudoso, Antonio M.
Formato:	Preprint
Publicado:	2024
Materias:	Optimization and Control Machine Learning
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Exact and Heuristic Algorithms for Constrained Biclustering
por: Sudoso, Antonio M.
Publicado: (2025)

Optimization meets Machine Learning: An Exact Algorithm for Semi-Supervised Support Vector Machines
por: Piccialli, Veronica, et al.
Publicado: (2023)

A column generation algorithm with dynamic constraint aggregation for minimum sum-of-squares clustering
por: Sudoso, Antonio M., et al.
Publicado: (2024)

Optimizing accuracy and diversity: a multi-task approach to forecast combinations
por: Felici, Giovanni, et al.
Publicado: (2023)

Strong bounds for large-scale Minimum Sum-of-Squares Clustering
por: Croella, Anna Livia, et al.
Publicado: (2025)

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

Towards Optimal Branching of Linear and Semidefinite Relaxations for Neural Network Robustness Certification
por: Anderson, Brendon G., et al.
Publicado: (2021)

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

Mixtures Closest to a Given Measure: A Semidefinite Programming Approach
por: Đurašinović, Srećko, et al.
Publicado: (2025)

Fast, Scalable, Warm-Start Semidefinite Programming with Spectral Bundling and Sketching
por: Angell, Rico, et al.
Publicado: (2023)

Statistically Optimal K-means Clustering via Nonnegative Low-rank Semidefinite Programming
por: Zhuang, Yubo, et al.
Publicado: (2023)

Improved Approximation Algorithms for Orthogonally Constrained Problems Using Semidefinite Optimization
por: Cory-Wright, Ryan, et al.
Publicado: (2025)

Semidefinite Relaxations of the Gromov-Wasserstein Distance
por: Chen, Junyu, et al.
Publicado: (2023)

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

Low-Rank Extragradient Methods for Scalable Semidefinite Optimization
por: Garber, Dan, et al.
Publicado: (2024)

Dual Conic Proxy for Semidefinite Relaxation of AC Optimal Power Flow
por: Qiu, Guancheng, et al.
Publicado: (2025)

Data Clustering and Visualization with Recursive Goemans-Williamson MaxCut Algorithm
por: Ly, An, et al.
Publicado: (2024)

Scalable Neural Network Verification with Branch-and-bound Inferred Cutting Planes
por: Zhou, Duo, et al.
Publicado: (2024)

Machine Learning Augmented Branch and Bound for Mixed Integer Linear Programming
por: Scavuzzo, Lara, et al.
Publicado: (2024)

Speeding Up Mixed-Integer Programming Solvers with Sparse Learning for Branching
por: Bayramoğlu, Selin, et al.
Publicado: (2026)

A Generic Branch-and-Bound Algorithm for $\ell_0$-Penalized Problems with Supplementary Material
por: Elvira, Clément, et al.
Publicado: (2025)

A Rolling-Space Branch-and-Price Algorithm for the Multi-Compartment Vehicle Routing Problem with Multiple Time Windows
por: Raqabi, El Mehdi Er, et al.
Publicado: (2026)

An Efficient Spatial Branch-and-Bound Algorithm for Global Optimization of Gaussian Process Posterior Mean Functions
por: Tang, Wei-Ting, et al.
Publicado: (2026)

Heuristic Optimal Transport in Branching Networks
por: Andrecut, M.
Publicado: (2023)

Sparse Cuts for the Positive Semidefinite Cone
por: Günlük, Oktay, et al.
Publicado: (2026)

Accelerating Low-Rank Factorization-Based Semidefinite Programming Algorithms on GPU
por: Han, Qiushi, et al.
Publicado: (2024)

A conditional gradient homotopy method with applications to Semidefinite Programming
por: Dvurechensky, Pavel, et al.
Publicado: (2022)

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

Maximum Cuts and Fractional Cut Covers: A Computational Study of a Randomized Semidefinite Programming Approach
por: Proença, Nathan Benedetto, et al.
Publicado: (2026)

Learning to Configure Mathematical Programming Solvers by Mathematical Programming
por: Iommazzo, Gabriele, et al.
Publicado: (2024)

Optimal Placement of Nature-Based Solutions for Urban Challenges
por: Pinto, Diego Maria, et al.
Publicado: (2025)

Lagrangian Duality for Mixed-Integer Semidefinite Programming: Theory and Algorithms
por: de Meijer, Frank, et al.
Publicado: (2025)

Rethinking the Capacity of Graph Neural Networks for Branching Strategy
por: Chen, Ziang, et al.
Publicado: (2024)

A New Branch-and-Bound Pruning Framework for $\ell_0$-Regularized Problems
por: Guyard, Theo, et al.
Publicado: (2024)

Fix and Bound: An efficient approach for solving large-scale quadratic programming problems with box constraints
por: Locatelli, Marco, et al.
Publicado: (2022)

Parametric Semidefinite Programming: Geometry of the Trajectory of Solutions
por: Bellon, Antonio, et al.
Publicado: (2021)

Non-linear Multi-objective Optimization with Probabilistic Branch and Bound
por: Huang, Hao, et al.
Publicado: (2025)

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

Learning Fair And Effective Points-Based Rewards Programs
por: Hssaine, Chamsi, et al.
Publicado: (2025)

Disjunctive Branch-and-Bound for Certifiably Optimal Low-Rank Matrix Completion
por: Bertsimas, Dimitris, et al.
Publicado: (2023)