{"total":16,"rows":[{"id":"2103.05041","title":"Advances in Inference and Representation for Simultaneous Localization and Mapping","created":"2021-03-08","cited_by_count":16,"area":null},{"id":"2204.00846","title":"Chordal Sparsity for Lipschitz Constant Estimation of Deep Neural Networks","created":"2022-04-02","cited_by_count":15,"area":null},{"id":"2109.12701","title":"Sparse Plus Low Rank Matrix Decomposition: A Discrete Optimization Approach","created":"2021-09-26","cited_by_count":14,"area":null},{"id":"2602.14662","title":"Advances in Global Solvers for 3D Vision","created":"2026-02-16","cited_by_count":13,"area":null},{"id":"2108.02335","title":"Advances in Trajectory Optimization for Space Vehicle Control","created":"2021-08-05","cited_by_count":5,"area":null},{"id":"2410.00117","title":"An Overview of the Burer-Monteiro Method for Certifiable Robot Perception","created":"2024-09-30","cited_by_count":5,"area":null},{"id":"2505.04514","title":"Quantum thermodynamics and semi-definite optimization","created":"2025-05-07","cited_by_count":5,"area":null},{"id":"2207.05257","title":"Accelerating Certifiable Estimation with Preconditioned Eigensolvers","created":"2022-07-12","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":"2308.14486","title":"Rebalancing Social Feed to Minimize Polarization and Disagreement","created":"2023-08-28","cited_by_count":2,"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":"2312.05034","title":"Grasp Force Optimization as a Bilinear Matrix Inequality Problem: A Deep Learning Approach","created":"2023-12-08","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":"2512.05926","title":"BalLOT: Balanced $k$-means clustering with optimal transport","created":"2025-12-05","cited_by_count":0,"area":null},{"id":"2603.01267","title":"Certifiable Factor Graph Optimization","created":"2026-03-01","cited_by_count":0,"area":null}],"next_cursor":null}