Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models (Q526842): Difference between revisions

From MaRDI portal
Removed claim: author (P16): Item:Q634728
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10107-016-1065-8 / 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-016-1065-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2510806995 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of a Regularized Euclidean Residual Algorithm for Nonlinear Least-Squares / 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: 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: Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results / 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: 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: Complexity bounds for second-order optimality in unconstrained optimization / 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: 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: 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: Modified Gauss–Newton scheme with worst case guarantees for global performance / 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: 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 / DOI
 
Property / DOI: 10.1007/S10107-016-1065-8 / rank
 
Normal rank

Latest revision as of 20:29, 9 December 2024

scientific article
Language Label Description Also known as
English
Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models
scientific article

    Statements

    Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    15 May 2017
    0 references
    nonlinear optimization
    0 references
    unconstrained optimization
    0 references
    evaluation complexity
    0 references
    high-order models
    0 references
    regularization
    0 references

    Identifiers

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