Implementable tensor methods in unconstrained convex optimization (Q2227532): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Algorithm 566 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10107-019-01449-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2808862920 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oracle complexity of second-order methods for smooth convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for finding stationary points I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluation complexity of adaptive cubic regularization methods for convex unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal Regularization Methods: Varying the Power, the Smoothness and the Accuracy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trust Region Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularized Newton Methods for Minimizing Functions with Hölder Continuous Hessians / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluating Derivatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: On large-scale unconstrained optimization problems and higher order methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relatively Smooth Convex Optimization by First-Order Methods, and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Higher order necessary conditions in abstract mathematical programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3395491 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Accelerated Hybrid Proximal Extragradient Method for Convex Optimization and Its Implications to Second-Order Methods / 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: Accelerating the cubic regularization of Newton's method on convex problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gradient methods for minimizing composite functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal gradient methods for convex optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4324980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cubic regularization of Newton method and its global performance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tensor Methods for Unconstrained Optimization Using Second Derivatives / rank
 
Normal rank

Latest revision as of 13:53, 24 July 2024

scientific article
Language Label Description Also known as
English
Implementable tensor methods in unconstrained convex optimization
scientific article

    Statements

    Implementable tensor methods in unconstrained convex optimization (English)
    0 references
    0 references
    15 February 2021
    0 references
    high-order methods
    0 references
    tensor methods
    0 references
    convex optimization
    0 references
    worst-case complexity bounds
    0 references
    lower complexity bounds
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers