Complexity bounds for second-order optimality in unconstrained optimization (Q657654): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.jco.2011.06.001 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jco.2011.06.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2082877410 / 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: On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptive cubic regularization algorithm for nonconvex optimization with convex constraints and its function-evaluation complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trust-region and other regularisations of linear least-squares problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Oracle Complexity of First-Order and Derivative-Free Algorithms for Smooth Nonconvex Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trust Region Methods / 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: Introductory lectures on convex optimization. A basic course. / 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: Cubic regularization of Newton method and its global performance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4279211 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for indefinite quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Black-Box Complexity of Local Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst case complexity of direct search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Affine conjugate adaptive Newton methods for nonlinear elastomechanics / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.JCO.2011.06.001 / rank
 
Normal rank

Latest revision as of 00:03, 10 December 2024

scientific article
Language Label Description Also known as
English
Complexity bounds for second-order optimality in unconstrained optimization
scientific article

    Statements

    Complexity bounds for second-order optimality in unconstrained optimization (English)
    0 references
    0 references
    10 January 2012
    0 references
    The authors examine the worst-case evaluation bounds for finding weak minimizers in unconstrained optimization. They show that this bound can be derived for a version of the algorithms, which only uses one-dimensional global optimization of the cubic model and that it is sharp. They also consider the standard trust-region method and show that a bound of the same type may also be derived for this method, and that it is sharp in some cases. They also compare the bounds on the worst-case behavior of the cubic regularization and trust-region algorithms favor the first of these methods. The paper is an important topic in the theory of optimization. Introduction and concluding sections of the paper, respectively, containing both historical notes and remarks on the topic of research are interesting and useful.
    0 references
    0 references
    worst-case analysis
    0 references
    nonconvex optimization
    0 references
    second-order optimally conditions
    0 references
    unconstrained optimization
    0 references
    algorithms
    0 references
    global optimization
    0 references
    regularization
    0 references
    trust-region
    0 references

    Identifiers