Cover Image

A column generation algorithm with dynamic constraint aggregation for minimum sum-of-squares clustering

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Sudoso, Antonio M., Aloise, Daniel
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

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

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

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

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

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

A practical, fast method for solving sum-of-squares problems for very large polynomials
by: Keren, Daniel, et al.
Published: (2024)

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

A naive aggregation algorithm for improving generalization in a class of learning problems
by: Befekadu, Getachew K
Published: (2024)

Geometric design of the tangent term in landing algorithms for orthogonality constraints
by: Goyens, Florentin, et al.
Published: (2025)

Mean-square and linear convergence of a stochastic proximal point algorithm in metric spaces of nonpositive curvature
by: Pischke, Nicholas
Published: (2025)

Risk reversal for least squares estimators under nested convex constraints
by: Al-Ghattas, Omar
Published: (2026)

Error dynamics of mini-batch gradient descent with random reshuffling for least squares regression
by: Lok, Jackie, et al.
Published: (2024)

First-order methods for stochastic and finite-sum convex optimization with deterministic constraints
by: Lu, Zhaosong, et al.
Published: (2025)

Meta-reinforcement learning with minimum attention
by: Gupta, Shashank, et al.
Published: (2025)

An improved column-generation-based matheuristic for learning classification trees
by: Patel, Krunal Kishor, et al.
Published: (2023)

Learning linear dynamical systems under convex constraints
by: Tyagi, Hemant, et al.
Published: (2023)

Soft regression trees: a model variant and a decomposition training algorithm
by: Consolo, Antonio, et al.
Published: (2025)

A theoretical and empirical study of new adaptive algorithms with additional momentum steps and shifted updates for stochastic non-convex optimization
by: Alecsa, Cristian Daniel
Published: (2021)

A least-square method for non-asymptotic identification in linear switching control
by: Sun, Haoyuan, et al.
Published: (2024)

Binary Kernel Logistic Regression: a sparsity-inducing formulation and a convergent decomposition training algorithm
by: Consolo, Antonio, et al.
Published: (2025)

Compressed and distributed least-squares regression: convergence rates with applications to Federated Learning
by: Philippenko, Constantin, et al.
Published: (2023)

A learning-based approach to stochastic optimal control under reach-avoid constraint
by: Ni, Tingting, et al.
Published: (2024)

Surrogate-based optimization of system architectures subject to hidden constraints
by: Bussemaker, Jasper, et al.
Published: (2025)

A stochastic smoothing framework for nonconvex-nonconcave min-sum-max problems with applications to Wasserstein distributionally robust optimization
by: Liu, Wei, et al.
Published: (2025)

A simple and improved algorithm for noisy, convex, zeroth-order optimisation
by: Carpentier, Alexandra
Published: (2024)

A Unified Framework for Analyzing Meta-algorithms in Online Convex Optimization
by: Pedramfar, Mohammad, et al.
Published: (2024)

A randomized algorithm for nonconvex minimization with inexact evaluations and complexity guarantees
by: Li, Shuyao, et al.
Published: (2023)

The Mixing method: low-rank coordinate descent for semidefinite programming with diagonal constraints
by: Wang, Po-Wei, et al.
Published: (2017)

Riemannian coordinate descent algorithms on matrix manifolds
by: Han, Andi, et al.
Published: (2024)

P-split formulations: A class of intermediate formulations between big-M and convex hull for disjunctive constraints
by: Kronqvist, Jan, et al.
Published: (2022)

A framework for bilevel optimization that enables stochastic and global variance reduction algorithms
by: Dagréou, Mathieu, et al.
Published: (2022)

Variance reduction techniques for stochastic proximal point algorithms
by: Traoré, Cheik, et al.
Published: (2023)

Efficient algorithms for implementing incremental proximal-point methods
by: Shtoff, Alex
Published: (2022)

Primal-dual algorithm for contextual stochastic combinatorial optimization
by: Bouvier, Louis, et al.
Published: (2025)

Novel clustered federated learning based on local loss
by: Gu, Endong, et al.
Published: (2024)

Multiscale replay: A robust algorithm for stochastic variational inequalities with a Markovian buffer
by: Nakul, Milind, et al.
Published: (2026)

PolyFormer: learning efficient reformulations for scalable optimization under complex physical constraints
by: Wen, Yilin, et al.
Published: (2026)

Efficient algorithms for regularized Poisson Non-negative Matrix Factorization
by: Perraudin, Nathanaël, et al.
Published: (2024)

CLASP: An online learning algorithm for Convex Losses And Squared Penalties
by: Ferreira, Ricardo N., et al.
Published: (2026)

Randomized multi-class classification under system constraints: a unified approach via post-processing
by: Chzhen, Evgenii, et al.
Published: (2025)