On the worst-case evaluation complexity of non-monotone line search algorithms (Q1694392): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A class of nonmonotone Armijo-type line search method for unconstrained optimization / 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: The Use of Quadratic Regularization with a Cubic Descent Condition for Unconstrained Optimization / 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: Evaluation complexity of adaptive cubic regularization methods for convex unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case evaluation complexity of non-monotone gradient-related algorithms for unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A trust region algorithm with a worst-case iteration complexity of \(\mathcal{O}(\epsilon ^{-3/2})\) for nonconvex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst case complexity of direct search under convexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / 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: On the worst-case complexity of nonlinear stepsize control algorithms for convex unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear stepsize control algorithms: complexity bounds for first- and second-order optimality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive Trust-Region Methods for Multiscale Nonlinear Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Nonmonotone Line Search Technique for Newton’s Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incorporating nonmonotone strategies into the trust region method for unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cubic-regularization counterpart of a variable-norm trust-region method for unconstrained minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A nonmonotone trust region method based on nonincreasing technique of weighted average of the successive function values / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing Unconstrained Optimization Software / 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: Cubic regularization of Newton method and its global performance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5500903 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization theory and methods. Nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst case complexity of direct search / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization / rank
 
Normal rank

Revision as of 02:03, 15 July 2024

scientific article
Language Label Description Also known as
English
On the worst-case evaluation complexity of non-monotone line search algorithms
scientific article

    Statements

    On the worst-case evaluation complexity of non-monotone line search algorithms (English)
    0 references
    1 February 2018
    0 references
    nonlinear optimization
    0 references
    unconstrained optimization
    0 references
    non-monotone line search
    0 references
    worst-case complexity
    0 references
    0 references

    Identifiers