Research map / Optimization / Nonconvex and smooth optimization
Extensions to the Proximal Distance Method of Constrained Optimization
Alfonso Landeros, Oscar Hernan Madrid Padilla, 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 |
|---|---|---|---|
| use steepest descent (SD) instead of MM for metric projection | proximal distance · Metric projection m=256 | time (s): 1670 -> 1570 | Improved |
| use SD instead of ADMM for metric projection | proximal distance · Metric projection m=256 | time (s): 9110 -> 1570 | Improved |
| use SD instead of MM for convex regression d=2, m=400 | proximal distance · Convex regression | time (s): 200 -> 50.3 | Improved |
| use SD instead of MM for convex regression d=10, m=400 | proximal distance · Convex regression | time (s): 26.8 -> 3.17 | Improved |
| use SD instead of MM for convex clustering on spiral500 | proximal distance · Convex clustering | time (s): 715 -> 561 | Improved |
| use SD instead of MM for image denoising on cameraman | proximal distance · TV denoising | time (s): 557 -> 181 | Improved |
| use SD instead of MM for denoising, quality | proximal distance · TV denoising cameraman | PSNR: 25.5 -> 25.5 | No clear effect |
| use MM instead of SD for condition number projection p=1000 | proximal distance · Condition number projection | time (ms): 75.3 -> 60.3 | Improved |
| use SD on convex clustering zoo instead of MM | proximal distance · Convex clustering zoo | ARI: 0.841 -> 0.848 | No clear effect |
| use MM with subspace variant instead of Nesterov-accelerated MM (ablation) | MM · constrained examples | time and accuracy | Hurt |
| use conjugate gradients instead of LSQR for linear systems (ablation) | ADMM · linear systems | accuracy and time | Improved |
Closest papers by meaning
- Proximal Distance Algorithms: Theory and Practice (JMLR 2019 · similarity 0.93)
- Stochastic Proximal Methods for Non-Smooth Non-Convex Constrained Sparse Optimization (JMLR 2021 · similarity 0.90)
- A Hybrid Stochastic-Deterministic Minibatch Proximal Gradient Method for Efficient Optimization and Generalization (TPAMI 2021 · similarity 0.89)
- RandProx: Primal-Dual Optimization Algorithms with Randomized Proximal Updates (ICLR 2023 · similarity 0.89)
- A Feasible Level Proximal Point Method for Nonconvex Sparse Constrained Optimization (NeurIPS 2020 · similarity 0.89)
- Adaptive Proximal Gradient Method for Convex Optimization (NeurIPS 2024 · similarity 0.89)
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.
