atlas

Research map / Optimization / Nonconvex and smooth optimization

Fast Projection Onto Convex Smooth Constraints

ICML 2021 · Optimization › Nonconvex and smooth optimization · approach: Adaptive first-order convex methods · 3 citations (OpenAlex)

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 changedWhereMeasuredEffect
Fast projection (primal-dual with cutting plane on dual and AGD inner solves) instead of IPMprojection onto few smooth constraints · Synthetic projection m=2, n from 10 to 12000run-time (s)Mixed
Fast projection instead of IPMkernel learning QCQP, doc-rna · m=3, n=4000 vs n=11000run-time (s)Mixed
Fast projection instead of IPM at target accuracy 1e-6kernel learning QCQP, m=3, n=11000 · accuracy 1e-6run-time (s)Helped
Tightening target accuracy from 1e-6 to 1e-8 for fast projectionFast projection on kernel learning · m=3, n=11000run-time (s): 83.2 -> 1216.9Hurt
Fast projection instead of ADMMsynthetic projection m=2 · n=10 to 1000run-time (s)Helped
Fast projection instead of SLSQPsynthetic projection m=2 · n=5000run-time (s)Helped

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