{"total":22,"rows":[{"id":"2109.03349","title":"Certifiably Optimal Outlier-Robust Geometric Perception: Semidefinite Relaxations and Scalable Global Optimization","created":"2021-09-07","cited_by_count":21,"area":null},{"id":"2111.15571","title":"An Exact Algorithm for Semi-supervised Minimum Sum-of-Squares Clustering","created":"2021-11-30","cited_by_count":13,"area":null},{"id":"2105.14033","title":"An Inexact Projected Gradient Method with Rounding and Lifting by Nonlinear Programming for Solving Rank-One Semidefinite Relaxation of Polynomial Optimization","created":"2021-05-28","cited_by_count":10,"area":null},{"id":"2205.13098","title":"Optimal Neural Network Approximation of Wasserstein Gradient Direction via Convex Optimization","created":"2022-05-26","cited_by_count":9,"area":null},{"id":"2305.18436","title":"Statistically Optimal K-means Clustering via Nonnegative Low-rank Semidefinite Programming","created":"2023-05-29","cited_by_count":9,"area":null},{"id":"2301.03139","title":"A Newton-CG based augmented Lagrangian method for finding a second-order stationary point of nonconvex equality constrained optimization with complexity guarantees","created":"2023-01-09","cited_by_count":6,"area":null},{"id":"2204.00406","title":"A Semismooth Newton Stochastic Proximal Point Algorithm with Variance Reduction","created":"2022-04-01","cited_by_count":5,"area":null},{"id":"2312.11801","title":"Fast, Scalable, Warm-Start Semidefinite Programming with Spectral Bundling and Sketching","created":"2023-12-19","cited_by_count":4,"area":null},{"id":"2209.08901","title":"Global Optimization for Cardinality-constrained Minimum Sum-of-Squares Clustering via Semidefinite Programming","created":"2022-09-19","cited_by_count":3,"area":null},{"id":"2301.04204","title":"A Newton-CG based barrier-augmented Lagrangian method for general nonconvex conic optimization","created":"2023-01-10","cited_by_count":2,"area":null},{"id":"2403.11351","title":"A Semidefinite Programming-Based Branch-and-Cut Algorithm for Biclustering","created":"2024-03-17","cited_by_count":2,"area":null},{"id":"2211.15744","title":"Sketch-and-solve approaches to k-means clustering by semidefinite programming","created":"2022-11-28","cited_by_count":1,"area":null},{"id":"2310.14087","title":"A Specialized Semismooth Newton Method for Kernel-Based Optimal Transport","created":"2023-10-21","cited_by_count":1,"area":null},{"id":"2106.08775","title":"Momentum-inspired Low-Rank Coordinate Descent for Diagonally Constrained SDPs","created":"2021-06-16","cited_by_count":0,"area":null},{"id":"2107.14442","title":"Distribution free optimality intervals for clustering","created":"2021-07-30","cited_by_count":0,"area":null},{"id":"2208.03622","title":"Parabolic Relaxation for Quadratically-constrained Quadratic Programming -- Part I: Definitions & Basic Properties","created":"2022-08-07","cited_by_count":0,"area":null},{"id":"2208.03625","title":"Parabolic Relaxation for Quadratically-constrained Quadratic Programming -- Part II: Theoretical & Computational Results","created":"2022-08-07","cited_by_count":0,"area":null},{"id":"2305.20003","title":"A Novel Black Box Process Quality Optimization Approach based on Hit Rate","created":"2023-05-31","cited_by_count":0,"area":null},{"id":"2306.01986","title":"A Novel Correlation-optimized Deep Learning Method for Wind Speed Forecast","created":"2023-06-03","cited_by_count":0,"area":null},{"id":"2308.08852","title":"Learning the hub graphical Lasso model with the structured sparsity via an efficient algorithm","created":"2023-08-17","cited_by_count":0,"area":null},{"id":"2508.05493","title":"Exact and Heuristic Algorithms for Constrained Biclustering","created":"2025-08-07","cited_by_count":0,"area":null},{"id":"2609.36074","title":"GEM-KMeans: Memory-Efficient and Accurate Clustering on Massive Scale with GPU Optimization","created":"2026-09-28","cited_by_count":0,"area":null}],"next_cursor":null}