Imagen de Portada

A cutting plane algorithm for globally solving low dimensional k-means clustering problems

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Ryner, Martin, Kronqvist, Jan, Karlsson, Johan
Formato:	Preprint
Publicado:	2024
Materias:	Optimization and Control Machine Learning 90C26 (Primary) 90C27 (Secondary) G.1.6
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

A Structured Tour of Optimization with Finite Differences
por: Rando, Marco, et al.
Publicado: (2025)

Extended Dijkstra algorithm and Moore-Bellman-Ford algorithm
por: Cheng, Cong-Dian
Publicado: (2017)

A model-free approach for solving choice-based competitive facility location problems using simulation and submodularity
por: Legault, Robin, et al.
Publicado: (2022)

GPU accelerated variant of Schroeppel-Shamir's algorithm for solving the market split problem
por: Kempke, Nils-Christian, et al.
Publicado: (2025)

A sensitivity-based method for bilevel optimization problems: Theoretical analysis and computational performance
por: Nolasco, Eduardo, et al.
Publicado: (2025)

A Structured Proximal Stochastic Variance Reduced Zeroth-order Algorithm
por: Rando, Marco, et al.
Publicado: (2025)

A solution procedure for minimizing total completion time in a parallel-batching environment
por: Alfieri, Arianna, et al.
Publicado: (2020)

Efficient arc-flow formulations for makespan minimisation on parallel machines with a common server
por: Druetto, Alessandro, et al.
Publicado: (2024)

Box Allocation Optimization in Meal Kit Delivery
por: Nguyen, Thi Minh Thu, et al.
Publicado: (2025)

CBX: Python and Julia packages for consensus-based interacting particle methods
por: Bailo, Rafael, et al.
Publicado: (2024)

Augmentation Algorithms for Integer Programs with Total Variation-like Regularization
por: Yang, Dominic, et al.
Publicado: (2025)

A Bilevel Hierarchy of Strengthened Complex Moment Relaxations for Complex Polynomial Optimization
por: Wang, Jie
Publicado: (2024)

A branch-and-cut algorithm for vehicle routing problems with three-dimensional loading constraints
por: Tamke, Felix, et al.
Publicado: (2024)

Real-time solution of quadratic optimization problems with banded matrices and indicator variables
por: Gomez, Andres, et al.
Publicado: (2024)

Regularized Step Directions in Nonlinear Conjugate Gradient Methods
por: Buhler, Cassidy K., et al.
Publicado: (2021)

Optimistic Bilevel Optimization with Composite Lower-Level Problem
por: Solla, Mattia, et al.
Publicado: (2026)

Pseudoconvex Problems in Operational Decision Systems: Algorithms for Joint Learning and Optimization
por: Li, Zijun, et al.
Publicado: (2026)

ZOBA: An Efficient Single-loop Zeroth-order Bilevel Optimization Algorithm
por: Rando, Marco, et al.
Publicado: (2026)

A divergence-based condition to ensure quantile improvement in black-box global optimization
por: Guilmeau, Thomas, et al.
Publicado: (2024)

Lagrangian Reformulation for Nonconvex Optimization: Tailoring Problems to Specialized Solvers
por: Quintero, Rodolfo A., et al.
Publicado: (2024)

Continuous iterative algorithms for anti-Cheeger cut
por: Shao, Sihong, et al.
Publicado: (2021)

${\varepsilon}$-optimality in reverse convex optimization
por: Maghri, M. El, et al.
Publicado: (2025)

Heavy-ball Differential Equation Achieves $O(\varepsilon^{-7/4})$ Convergence for Nonconvex Functions
por: Okamura, Kaito, et al.
Publicado: (2024)

Global optimization of multivariable functions satisfying the Vanderbei condition
por: Arutyunova, Natalya, et al.
Publicado: (2019)

On exactness of SDP relaxation for the maximum cut problem
por: Bhardwaj, Avinash, et al.
Publicado: (2025)

Taming Nonconvex Stochastic Mirror Descent with General Bregman Divergence
por: Fatkhullin, Ilyas, et al.
Publicado: (2024)

OPM, a collection of Optimization Problems in Matlab
por: Gratton, Serge, et al.
Publicado: (2021)

TOPSIS-like metaheuristic for LABS problem
por: Urbańczyk, Aleksandra, et al.
Publicado: (2025)

On a minimization problem of the maximum generalized eigenvalue: properties and algorithms
por: Nishioka, Akatsuki, et al.
Publicado: (2023)

A reliability-aware randomized simheuristic for the stochastic team orienteering problem
por: Circelli, Michele
Publicado: (2026)

Parameter-free accelerated gradient descent for nonconvex minimization
por: Marumo, Naoki, et al.
Publicado: (2022)

Solving Constrained Affine Heaviside Composite Optimization Problems by a Progressive IP Approach
por: Zheng, Ke, et al.
Publicado: (2026)

Accelerated-gradient-based generalized Levenberg--Marquardt method with oracle complexity bound and local quadratic convergence
por: Marumo, Naoki, et al.
Publicado: (2022)

A Stochastic Gradient Descent Method for Globally Minimizing Nearly Convex Functions
por: Bao, Chenglong, et al.
Publicado: (2025)

Anisotropic Gaussian Smoothing for Gradient-based Optimization
por: Starnes, Andrew, et al.
Publicado: (2024)

Adaptive Methods for Multiobjective Unit Commitment
por: Tevruez, Ece, et al.
Publicado: (2025)

Last-iterate Convergence of ADMM on Multi-affine Quadratic Equality Constrained Problem
por: Chao, Yutong, et al.
Publicado: (2026)

Natural Gradient VI: Guarantees for Non-Conjugate Models
por: Sun, Fangyuan, et al.
Publicado: (2025)

Stochastic convergence of parallel asynchronous adaptive first-order methods
por: Gratton, Serge, et al.
Publicado: (2026)

Two trust region type algorithms for solving nonconvex-strongly concave minimax problems
por: Yao, Tongliang, et al.
Publicado: (2024)