AI Paper Atlas

Research map / Optimization / Nonconvex and smooth optimization

A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints

Ganzhao Yuan

ICLR 2026 · Optimization › Nonconvex and smooth optimization · approach: Adaptive first-order convex methods

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
use OBCD-R (random working-set block coordinate descent) instead of LADMM/RADMM/SPML0-regularized SPCA · 10 real/synthetic datasets (r=20, lambda 10-500)objective value after 40s: w1a, lambda=100: 2199.819 -> 1999.667Improved
OBCD-R vs baselines on some datasets (e.g. lambda=10 and lambda=500 on Gisette, tied with others)L0-regularized SPCA · Gisette-3000-1000objective value: 199.979 vs 199.980 (lambda=10)No clear effect
use OBCD, a greedy monotone descent method, rather than methods with fluctuating objectivesL0-regularized SPCA · convergence curves (lambda=100)objective trajectoryImproved

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