AI Paper Atlas

Research map / Optimization / Nonconvex and smooth optimization

Quadratic Optimization with Orthogonality Constraints: Explicit Lojasiewicz Exponent and Linear Convergence of Line-Search Methods

Huikang Liu, Weijie Wu, Anthony Man-Cho So

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

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 a dimension-independent local error bound to establish a Łojasiewicz exponent of 1/2Stiefel line-search methods for quadratic optimization with orthogonality constraints · Quadratic optimization with orthogonality constraintsconvergence rateImproved
Use the analyzed retracted line-search methodQuadratic optimization with orthogonality constraints · Synthetic thin and fat matrix problemsobjective and solution convergence rateImproved

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