Research map / Optimization / Nonconvex and smooth optimization
Proximal Distance Algorithms: Theory and Practice
Kevin L. Keys, Hua Zhou, Kenneth Lange
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| fold PSD constraint into loss domain and add acceleration (PD3 vs PD1) (ablation) | proximal distance for kinship matrix · Closest kinship matrix (n=32) | CPU time (s): 4.36 -> 0.52 | Improved |
| add Nesterov acceleration (PD2 vs PD1) (ablation) | proximal distance for kinship matrix · Closest kinship matrix (n=32) | CPU time (s): 4.36 -> 0.61 | Improved |
| use proximal distance instead of IPOPT on large dense-to-sparse problems | simplex-constrained least squares · n=16384, p=8192 | CPU time (s): 732.1039 -> 6.8739 | Improved |
| use proximal distance (PD) instead of Gurobi barrier | simplex-constrained least squares · n=16384, p=8192 | CPU time (s): 412.3612 -> 6.8739 | Improved |
| use proximal distance instead of Gurobi/SCS on low-dimensional LPs | linear programming · m=2, n=4 to small sizes | CPU time (s): 0.0142 -> 0.0038 | Hurt |
| use proximal distance over affine domain (PD1) instead of nonnegative domain (PD2) (ablation) | linear programming · Linear programming | accuracy of optimum | Improved |
| add Nesterov acceleration (aPD vs PD) (ablation) | Horn variational index · Horn matrix n=64 | optimum: 0.054195 -> 0.000026 | Mixed |
| use proximal distance instead of Mosek | Horn variational index · Horn matrix n=64 | CPU time (s): 3.6284 -> 0.0415 | Improved |
| use proximal distance instead of Gurobi | linear complementarity problem · n=64 | CPU time (s): 360.5183 -> 2.6846 | Improved |
| use proximal distance instead of SCS | second-order cone projection · dense problems | accuracy | Improved |
| use proximal distance instead of Dykstra | kinship matrix · Closest kinship matrix | speed and accuracy: 0.52 -> 0.37 | Hurt |
Closest papers by meaning
- Extensions to the Proximal Distance Method of Constrained Optimization (JMLR 2022 · similarity 0.93)
- A Feasible Level Proximal Point Method for Nonconvex Sparse Constrained Optimization (NeurIPS 2020 · similarity 0.85)
- On Acceleration for Convex Composite Minimization with Noise-Corrupted Gradients and Approximate Proximal Mapping (JMLR 2022 · similarity 0.85)
- RECAPP: Crafting a More Efficient Catalyst for Convex Optimization (ICML 2022 · similarity 0.85)
- Adaptive Proximal Gradient Method for Convex Optimization (NeurIPS 2024 · similarity 0.83)
- MetricEmbedding: Accelerate Metric Nearness by Tropical Inner Product (ICML 2025 · similarity 0.82)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
