Image de couverture de livre

The ratio-cut polytope and K-means clustering

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	De Rosa, Antonio, Khajavirad, Aida
Format:	Preprint
Publié:	2020
Sujets:	Optimization and Control Analysis of PDEs 90C05, 90C57, 62H30, 49Q20, 68Q87
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

On the power of linear programming for K-means clustering
par: De Rosa, Antonio, et autres
Publié: (2024)

Optimization in Theory and Practice
par: Wright, Stephen J.
Publié: (2025)

Robust Graph-Based Semi-Supervised Learning via $p$-Conductances
par: Robertson, Sawyer Jack, et autres
Publié: (2025)

Dimension-free estimators of gradients of functions with(out) non-independent variables
par: Lamboni, Matieyendou
Publié: (2025)

A constraint-based approach to function interpolation, with application to performance estimation for weakly convex optimisation
par: Rubbens, Anne, et autres
Publié: (2024)

Interpolation Conditions for Linear Operators and Applications to Performance Estimation Problems
par: Bousselmi, Nizar, et autres
Publié: (2023)

On the resolution of $\ell_1$-norm minimization via a two-metric adaptive projection method
par: Wu, Hanju, et autres
Publié: (2025)

A Newton-CG based barrier-augmented Lagrangian method for general nonconvex conic optimization
par: He, Chuan, et autres
Publié: (2023)

Controlling a Vlasov-Poisson plasma by a Particle-In-Cell method based on a Monte Carlo framework
par: Bartsch, Jan, et autres
Publié: (2023)

Gaussian smoothing gradient descent for minimizing functions (GSmoothGD)
par: Starnes, Andrew, et autres
Publié: (2023)

Benign landscapes for synchronization on spheres via normalized Laplacian matrices
par: McRae, Andrew D.
Publié: (2025)

Riemannian Adaptive Regularized Newton Methods with Hölder Continuous Hessians
par: Zhang, Chenyu, et autres
Publié: (2023)

Halpern Acceleration of the Inexact Proximal Point Method of Rockafellar
par: Zhang, Liwei, et autres
Publié: (2025)

Similarity-based fuzzy clustering scientific articles: potentials and challenges from mathematical and computational perspectives
par: Huong, Vu Thi, et autres
Publié: (2025)

Variational inference via Gaussian interacting particles in the Bures-Wasserstein geometry
par: Borghi, Giacomo, et autres
Publié: (2026)

A Proximal-Gradient Method for Solving Regularized Optimization Problems with General Constraints
par: Curtis, Frank E., et autres
Publié: (2025)

A Proximal-Gradient Method for Constrained Optimization
par: Dai, Yutong, et autres
Publié: (2024)

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

A non-iterative polynomial algorithm for linear programming
par: Jing-Yuan, Wei
Publié: (2013)

Accelerating preconditioned ADMM via degenerate proximal point mappings
par: Sun, Defeng, et autres
Publié: (2024)

Generalized Steepest Descent Methods on Riemannian Manifolds and Hilbert Spaces: Convergence Analysis and Stochastic Extensions
par: A., Rashid, et autres
Publié: (2025)

Fast Reflected Forward-Backward algorithm: achieving fast convergence rates for convex optimization with linear cone constraints
par: Bot, Radu Ioan, et autres
Publié: (2024)

A semiconcavity approach to stability of entropic plans and exponential convergence of Sinkhorn's algorithm
par: Chiarini, Alberto, et autres
Publié: (2024)

Solving Regularized Multifacility Location Problems with Unknown Number of Centers via Difference-of-Convex Optimization
par: Geremew, W., et autres
Publié: (2026)

Variational models of robust optimal transport
par: De Masi, Luigi, et autres
Publié: (2025)

A Function-Space Stability Boundary for Generalization in Interpolating Learning Systems
par: Katende, Ronald
Publié: (2026)

Topology optimization and boundary observation for clamped plates
par: Murea, Cornel Marius, et autres
Publié: (2023)

Analysis of Kernel Mirror Prox for Measure Optimization
par: Dvurechensky, Pavel, et autres
Publié: (2024)

An Inexact Feasible Interior Point Method for Linear Optimization with High Adaptability to Quantum Computers
par: Mohammadisiahroudi, Mohammadhossein, et autres
Publié: (2023)

Consistency of sample-based stationary points for infinite-dimensional stochastic optimization
par: Milz, Johannes
Publié: (2023)

Optimal drift optimizer for non-convex optimization
par: Li, Qin, et autres
Publié: (2026)

On the Wasserstein alignment problem
par: Pal, Soumik, et autres
Publié: (2025)

Barrier Algorithms for Constrained Non-Convex Optimization
par: Dvurechensky, Pavel, et autres
Publié: (2024)

An efficient second-order cone programming approach for dynamic optimal transport on staggered grid discretization
par: Chen, Liang, et autres
Publié: (2025)

Improved global performance guarantees of second-order methods in convex minimization
par: Dvurechensky, Pavel, et autres
Publié: (2024)

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

Non-polyconvex $Q$-integrands with lower semicontinuous energies
par: De Gennaro, Daniele, et autres
Publié: (2025)

Minimization Over the Nonconvex Sparsity Constraint Using A Hybrid First-order method
par: Yang, Xiangyu, et autres
Publié: (2021)

An Efficient Stochastic First-Order Algorithm for Nonconvex-Strongly Concave Minimax Optimization beyond Lipschitz Smoothness
par: Gao, Yan, et autres
Publié: (2026)

A practical randomized trust-region method to escape saddle points in high dimension
par: Dragomir, Radu-Alexandru, et autres
Publié: (2026)