Copertina

On the power of linear programming for K-means clustering

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	De Rosa, Antonio, Khajavirad, Aida, Wang, Yakun
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Optimization and Control 90C05, 90C57, 62H30, 49Q20, 68Q87
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

The ratio-cut polytope and K-means clustering
di: De Rosa, Antonio, et al.
Pubblicazione: (2020)

A non-iterative polynomial algorithm for linear programming
di: Jing-Yuan, Wei
Pubblicazione: (2013)

Topological structure and a polynomial-time solution of linear programming over the real numbers
di: Wei, Jing-Yuan
Pubblicazione: (2018)

Optimization in Theory and Practice
di: Wright, Stephen J.
Pubblicazione: (2025)

Robust Graph-Based Semi-Supervised Learning via $p$-Conductances
di: Robertson, Sawyer Jack, et al.
Pubblicazione: (2025)

Dimension-free estimators of gradients of functions with(out) non-independent variables
di: Lamboni, Matieyendou
Pubblicazione: (2025)

A constraint-based approach to function interpolation, with application to performance estimation for weakly convex optimisation
di: Rubbens, Anne, et al.
Pubblicazione: (2024)

Interpolation Conditions for Linear Operators and Applications to Performance Estimation Problems
di: Bousselmi, Nizar, et al.
Pubblicazione: (2023)

On the resolution of $\ell_1$-norm minimization via a two-metric adaptive projection method
di: Wu, Hanju, et al.
Pubblicazione: (2025)

A Newton-CG based barrier-augmented Lagrangian method for general nonconvex conic optimization
di: He, Chuan, et al.
Pubblicazione: (2023)

Gaussian smoothing gradient descent for minimizing functions (GSmoothGD)
di: Starnes, Andrew, et al.
Pubblicazione: (2023)

Benign landscapes for synchronization on spheres via normalized Laplacian matrices
di: McRae, Andrew D.
Pubblicazione: (2025)

Riemannian Adaptive Regularized Newton Methods with Hölder Continuous Hessians
di: Zhang, Chenyu, et al.
Pubblicazione: (2023)

Halpern Acceleration of the Inexact Proximal Point Method of Rockafellar
di: Zhang, Liwei, et al.
Pubblicazione: (2025)

Fast Reflected Forward-Backward algorithm: achieving fast convergence rates for convex optimization with linear cone constraints
di: Bot, Radu Ioan, et al.
Pubblicazione: (2024)

Similarity-based fuzzy clustering scientific articles: potentials and challenges from mathematical and computational perspectives
di: Huong, Vu Thi, et al.
Pubblicazione: (2025)

Variational inference via Gaussian interacting particles in the Bures-Wasserstein geometry
di: Borghi, Giacomo, et al.
Pubblicazione: (2026)

A Proximal-Gradient Method for Solving Regularized Optimization Problems with General Constraints
di: Curtis, Frank E., et al.
Pubblicazione: (2025)

A Proximal-Gradient Method for Constrained Optimization
di: Dai, Yutong, et al.
Pubblicazione: (2024)

Accelerating preconditioned ADMM via degenerate proximal point mappings
di: Sun, Defeng, et al.
Pubblicazione: (2024)

An efficient second-order cone programming approach for dynamic optimal transport on staggered grid discretization
di: Chen, Liang, et al.
Pubblicazione: (2025)

Generalized Steepest Descent Methods on Riemannian Manifolds and Hilbert Spaces: Convergence Analysis and Stochastic Extensions
di: A., Rashid, et al.
Pubblicazione: (2025)

A semiconcavity approach to stability of entropic plans and exponential convergence of Sinkhorn's algorithm
di: Chiarini, Alberto, et al.
Pubblicazione: (2024)

Solving Regularized Multifacility Location Problems with Unknown Number of Centers via Difference-of-Convex Optimization
di: Geremew, W., et al.
Pubblicazione: (2026)

A Function-Space Stability Boundary for Generalization in Interpolating Learning Systems
di: Katende, Ronald
Pubblicazione: (2026)

Topology optimization and boundary observation for clamped plates
di: Murea, Cornel Marius, et al.
Pubblicazione: (2023)

Analysis of Kernel Mirror Prox for Measure Optimization
di: Dvurechensky, Pavel, et al.
Pubblicazione: (2024)

An Inexact Feasible Interior Point Method for Linear Optimization with High Adaptability to Quantum Computers
di: Mohammadisiahroudi, Mohammadhossein, et al.
Pubblicazione: (2023)

Consistency of sample-based stationary points for infinite-dimensional stochastic optimization
di: Milz, Johannes
Pubblicazione: (2023)

Controlling a Vlasov-Poisson plasma by a Particle-In-Cell method based on a Monte Carlo framework
di: Bartsch, Jan, et al.
Pubblicazione: (2023)

Inference for max-linear Bayesian networks with noise
di: Adams, Mark, et al.
Pubblicazione: (2025)

On the Wasserstein alignment problem
di: Pal, Soumik, et al.
Pubblicazione: (2025)

Barrier Algorithms for Constrained Non-Convex Optimization
di: Dvurechensky, Pavel, et al.
Pubblicazione: (2024)

Improved global performance guarantees of second-order methods in convex minimization
di: Dvurechensky, Pavel, et al.
Pubblicazione: (2024)

Incremental Certificate Learning for Hybrid Neural Network Verification . A Solver Architecture for Piecewise-Linear Safety Queries
di: Gokavarapu, Chandrasekhar
Pubblicazione: (2025)

On the facet pivot simplex method for linear programming
di: Yang, Yaguang
Pubblicazione: (2021)

Minimization Over the Nonconvex Sparsity Constraint Using A Hybrid First-order method
di: Yang, Xiangyu, et al.
Pubblicazione: (2021)

An Efficient Stochastic First-Order Algorithm for Nonconvex-Strongly Concave Minimax Optimization beyond Lipschitz Smoothness
di: Gao, Yan, et al.
Pubblicazione: (2026)

A practical randomized trust-region method to escape saddle points in high dimension
di: Dragomir, Radu-Alexandru, et al.
Pubblicazione: (2026)

The Hard-Constraint PINNs for Interface Optimal Control Problems
di: Lai, Ming-Chih, et al.
Pubblicazione: (2023)