New computational guarantees for solving convex optimization problems with first order methods, via a function growth condition measure (Q1659678): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2964164027 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1511.02974 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smoothing and First Order Methods: A Unified Framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856857 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5478968 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak sharp minima revisited. II: Application to linear regularity and error bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak sharp minima revisited. III: Error bounds for differentiable convex inclusions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak Sharp Minima in Mathematical Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Gauss-Newton method for convex composite optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal stability and eigenvalue multiplicity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite termination of the proximal point algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: First-order algorithm with \({\mathcal{O}(\ln(1/\epsilon))}\) convergence for \({\epsilon}\)-equilibrium in two-person zero-sum games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hoffman's Error Bound, Local Controllability, and Sensitivity Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smoothing technique and its applications in semidefinite optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introductory lectures on convex optimization. A basic course. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smooth minimization of non-smooth functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive restart for accelerated gradient schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3491338 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ``Efficient” Subgradient Methods for General Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perturbation theory of nonlinear programs when the set of optimal solutions is not a singleton / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perturbation analysis of optimization problems in banach spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Differential Equation for Modeling Nesterov's Accelerated Gradient Method: Theory and Insights / rank
 
Normal rank

Latest revision as of 10:01, 16 July 2024

scientific article
Language Label Description Also known as
English
New computational guarantees for solving convex optimization problems with first order methods, via a function growth condition measure
scientific article

    Statements

    New computational guarantees for solving convex optimization problems with first order methods, via a function growth condition measure (English)
    0 references
    0 references
    0 references
    22 August 2018
    0 references
    growth constant
    0 references
    subgradient descent method
    0 references
    accelerated gradient method
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references