Pith. sign in

REVIEW 3 cited by

Accelerated Methods for $\alpha$-Weakly-Quasi-Convex Problems

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1710.00797 v7 pith:6LZWFCRA submitted 2017-10-02 math.OC

classification math.OC
keywords alphaconvergenceproblemsweakly-quasi-convexknownmethodminimizationoptimal
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

We provide a quick overview of the class of $\alpha$-weakly-quasi-convex problems and its relationships with other problem classes. We show that the previously known Sequential Subspace Optimization method retains its optimal convergence rate when applied to minimization problems with smooth $\alpha$-weakly-quasi-convex objectives. We also show that Nemirovski's conjugate gradients method of strongly convex minimization achieves its optimal convergence rate under weaker conditions of $\alpha$-weak-quasi-convexity and quad\-ratic growth. Previously known results only capture the special case of 1-weak-quasi-convexity or give convergence rates with worse dependence on the parameter $\alpha$.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Near-optimal Approximate Discrete and Continuous Submodular Function Minimization

    cs.DS 2019-08 accept novelty 7.0 of 10

    A data-structure trick based on binary segment decomposition yields near-optimal ~O(n/ε²) oracle complexity for approximate submodular function minimization, down from ~O(n^{3/2}/ε²), with extensions to continuous sub...

  2. A geodesic convexity-like structure for the polar decomposition of a square matrix

    math.NA 2024-12 accept novelty 6.0 of 10

    The orthogonal Procrustes problem satisfies weak-quasi-strong-convexity, yielding linear convergence of Riemannian gradient descent for invertible matrices and O(1/t) function-value convergence for singular ones.

  3. Star Quasiconvexity: a Unified Approach for Linear Convergence of First-Order Methods Beyond Convexity

    math.OC 2025-10 conditional novelty 4.0 of 10

    A function class whose sublevel sets are star-shaped at a minimizer unifies several generalized convexity conditions and yields linear convergence of first-order methods, including a new proximal point result on star-...

Pith tools