{"total":36,"rows":[{"id":"2309.07835","title":"Learning to Warm-Start Fixed-Point Optimization Algorithms","created":"2023-09-14","cited_by_count":32,"area":null},{"id":"2307.06324","title":"Provably Faster Gradient Descent via Long Steps","created":"2023-07-12","cited_by_count":20,"area":null},{"id":"2302.08580","title":"Online Learning Guided Curvature Approximation: A Quasi-Newton Method with Global Non-Asymptotic Superlinear Convergence","created":"2023-02-16","cited_by_count":11,"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":"2203.12633","title":"Q-FW: A Hybrid Classical-Quantum Frank-Wolfe for Quadratic Binary Optimization","created":"2022-03-23","cited_by_count":8,"area":null},{"id":"2105.01420","title":"Training Quantized Neural Networks to Global Optimality via Semidefinite Programming","created":"2021-05-04","cited_by_count":6,"area":null},{"id":"2208.07469","title":"Semidefinite Programming versus Burer-Monteiro Factorization for Matrix Sensing","created":"2022-08-15","cited_by_count":5,"area":null},{"id":"2301.02750","title":"Principal Component Analysis in Space Forms","created":"2023-01-06","cited_by_count":5,"area":null},{"id":"2306.02212","title":"Accelerated Quasi-Newton Proximal Extragradient: Faster Rate for Smooth Convex Optimization","created":"2023-06-03","cited_by_count":4,"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":"2104.11079","title":"Randomized Algorithms for Scientific Computing (RASC)","created":"2021-04-19","cited_by_count":3,"area":null},{"id":"2311.06374","title":"Higher-Order Newton Methods with Polynomial Work per Iteration","created":"2023-11-10","cited_by_count":3,"area":null},{"id":"2106.07255","title":"Federated Myopic Community Detection with One-shot Communication","created":"2021-06-14","cited_by_count":2,"area":null},{"id":"2205.15215","title":"Support Recovery in Sparse PCA with Incomplete Data","created":"2022-05-30","cited_by_count":2,"area":null},{"id":"2202.13212","title":"Faster One-Sample Stochastic Conditional Gradient Method for Composite Convex Minimization","created":"2022-02-26","cited_by_count":1,"area":null},{"id":"2212.00746","title":"Learning Transition Operators From Sparse Space-Time Samples","created":"2022-12-01","cited_by_count":1,"area":null},{"id":"2303.10030","title":"How robust is randomized blind deconvolution via nuclear norm minimization against adversarial noise?","created":"2023-03-17","cited_by_count":1,"area":null},{"id":"2306.03949","title":"Partial Inference in Structured Prediction","created":"2023-06-06","cited_by_count":1,"area":null},{"id":"2308.14981","title":"Sub-universal variational circuits for combinatorial optimization problems","created":"2023-08-29","cited_by_count":1,"area":null},{"id":"2408.04819","title":"Interventional Causal Structure Discovery over Graphical Models with Convergence and Optimality Guarantees","created":"2024-08-09","cited_by_count":1,"area":null},{"id":"2601.16510","title":"Learning to Optimize by Differentiable Programming","created":"2026-01-23","cited_by_count":1,"area":null},{"id":"2602.04236","title":"Cascading Robustness Verification: Toward Efficient Model-Agnostic Certification","created":"2026-02-04","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":"2207.03101","title":"A conditional gradient homotopy method with applications to Semidefinite Programming","created":"2022-07-07","cited_by_count":0,"area":null},{"id":"2208.09449","title":"A Novel Plug-and-Play Approach for Adversarially Robust Generalization","created":"2022-08-19","cited_by_count":0,"area":null},{"id":"2302.01535","title":"Support Recovery in Sparse PCA with Non-Random Missing Data","created":"2023-02-03","cited_by_count":0,"area":null},{"id":"2306.17470","title":"Oblivious Stochastic Composite Optimization","created":"2023-06-30","cited_by_count":0,"area":null},{"id":"2308.07343","title":"Conic Descent Redux for Memory-Efficient Optimization","created":"2023-08-13","cited_by_count":0,"area":null},{"id":"2309.01657","title":"Locally Stationary Graph Processes","created":"2023-09-04","cited_by_count":0,"area":null},{"id":"2406.10407","title":"Suboptimality bounds for trace-bounded SDPs enable a faster and scalable low-rank SDP solver SDPLR+","created":"2024-06-14","cited_by_count":0,"area":null},{"id":"2412.13928","title":"Subspace Langevin Monte Carlo","created":"2024-12-18","cited_by_count":0,"area":null},{"id":"2504.03592","title":"Optimistic Online Learning in Symmetric Cone Games","created":"2025-04-04","cited_by_count":0,"area":null},{"id":"2507.23017","title":"A Smoothing Newton Method for Rank-one Matrix Recovery","created":"2025-07-30","cited_by_count":0,"area":null},{"id":"2510.11910","title":"Simplifying Optimal Transport through Schatten-$p$ Regularization","created":"2025-10-13","cited_by_count":0,"area":null},{"id":"2602.03138","title":"SATORIS-N: Spectral Analysis based Traffic Observation Recovery via Informed Subspaces and Nuclear-norm minimization","created":"2026-02-03","cited_by_count":0,"area":null},{"id":"2606.31390","title":"Direction-Magnitude Decomposition for Low-Rank Matrix Optimization: Faster Convergence and Saddle-to-saddle Dynamics","created":"2026-06-30","cited_by_count":0,"area":null}],"next_cursor":null}