AI Paper Atlas

Research map / Optimization / Nonconvex and smooth optimization

Proximal Distance Algorithms: Theory and Practice

Kevin L. Keys, Hua Zhou, Kenneth Lange

JMLR 2019 · Optimization › Nonconvex and smooth optimization · approach: Adaptive first-order convex methods · 21 citations (OpenAlex)

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 changedWhereMeasuredEffect
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.52Improved
add Nesterov acceleration (PD2 vs PD1) (ablation)proximal distance for kinship matrix · Closest kinship matrix (n=32)CPU time (s): 4.36 -> 0.61Improved
use proximal distance instead of IPOPT on large dense-to-sparse problemssimplex-constrained least squares · n=16384, p=8192CPU time (s): 732.1039 -> 6.8739Improved
use proximal distance (PD) instead of Gurobi barriersimplex-constrained least squares · n=16384, p=8192CPU time (s): 412.3612 -> 6.8739Improved
use proximal distance instead of Gurobi/SCS on low-dimensional LPslinear programming · m=2, n=4 to small sizesCPU time (s): 0.0142 -> 0.0038Hurt
use proximal distance over affine domain (PD1) instead of nonnegative domain (PD2) (ablation)linear programming · Linear programmingaccuracy of optimumImproved
add Nesterov acceleration (aPD vs PD) (ablation)Horn variational index · Horn matrix n=64optimum: 0.054195 -> 0.000026Mixed
use proximal distance instead of MosekHorn variational index · Horn matrix n=64CPU time (s): 3.6284 -> 0.0415Improved
use proximal distance instead of Gurobilinear complementarity problem · n=64CPU time (s): 360.5183 -> 2.6846Improved
use proximal distance instead of SCSsecond-order cone projection · dense problemsaccuracyImproved
use proximal distance instead of Dykstrakinship matrix · Closest kinship matrixspeed and accuracy: 0.52 -> 0.37Hurt

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy