Research map / Optimization / Nonconvex and smooth optimization
Epigraph projections for fast general convex programming
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (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 |
|---|---|---|---|
| Epigraph projection solver (Epsilon) instead of cone-form solvers | general DCP problems · Lasso, MNIST, sparse inv. cov., robust SVM, robust regression, SVDD, sum-k-largest softmax | running time to same objective | Helped |
| Epigraph projection solver (Epsilon) instead of cone-form solvers | Robust SVM · Robust SVM | running time (s) | Mixed |
| Epigraph projection solver (Epsilon) instead of cone-form solvers | Sum-k-largest softmax · Sum-k-largest softmax | running time (s) | Mixed |
| Epigraph projection solver (Epsilon) instead of cone-form solvers | Robust regression · Robust regression | running time (s) | No clear effect |
Closest papers by meaning
- Fast Projection Onto Convex Smooth Constraints (ICML 2021 · similarity 0.89)
- A Richer Theory of Convex Constrained Optimization with Reduced Projections and Improved Rates (ICML 2017 · similarity 0.87)
- RECAPP: Crafting a More Efficient Catalyst for Convex Optimization (ICML 2022 · similarity 0.87)
- Fast Projection-Free Approach (without Optimization Oracle) for Optimization over Compact Convex Set (NeurIPS 2025 · similarity 0.87)
- Adaptive Proximal Gradient Method for Convex Optimization (NeurIPS 2024 · similarity 0.87)
- A Study of First-Order Methods with a Deterministic Relative-Error Gradient Oracle (ICML 2024 · similarity 0.85)
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.