AI Paper Atlas

Research map / Optimization / Nonconvex and smooth optimization

A Single-Loop Gradient Descent and Perturbed Ascent Algorithm for Nonconvex Functional Constrained Optimization

ICML 2022 · Optimization › Nonconvex and smooth optimization · approach: Complexity of nonconvex first-order 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
single-loop primal-dual GDPA with perturbed dual update instead of double/triple-loop inner solversnonconvex functional inequality constrained problems · theoretical convergenceiteration complexity to approximate KKT pointNo clear effect
dual perturbation term (tau, gamma_r) in the dual update (ablation)GDPA dual variable · theoretical analysisdual variable bound / convergenceHelped
GDPA vs. IALM, IQRC, IPPP on MNIST multi-class Neyman-Pearson classificationGDPA · mNPC on MNISTcomputing time convergenceHelped
GDPA vs. IQRC and IPPP on constraint satisfaction in mNPCGDPA · mNPC on MNISTfeasibility convergenceMixed
GDPA vs. baselines on neural net training with budget constraintsGDPA · MNIST fair training with accuracy budgetscomputing time convergenceHelped

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