Worst-Case Complexity of TRACE with Inexact Subproblem Solutions for Nonconvex Smooth Optimization (Q6046826): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1137/22m1492428 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W4385985705 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Trust-Region Subproblem By a Generalized Eigenvalue Problem / 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: Accelerated Methods for NonConvex Optimization / 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: Evaluation Complexity of Algorithms for Nonconvex Optimization: Theory, Computation and Perspectives / 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: Q4762511 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trust Region Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concise complexity analyses for trust region methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trust-Region Newton-CG with Strong Second-Order Complexity Guarantees for Nonconvex 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: An inexact regularized Newton framework with a worst-case iteration complexity of $ {\mathscr O}(\varepsilon^{-3/2}) $ for nonconvex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inexact Newton Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: ARC<sub>q</sub>: a new adaptive regularization by cubics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Trust-Region Subproblem using the Lanczos Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Updating the regularization parameter in the adaptive cubic regularization algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error estimates for iterative algorithms for minimizing regularized quadratic subproblems / 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: The Convergence of the Generalized Lanczos Trust-Region Method for the Trust-Region Subproblem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimating the Largest Eigenvalue by the Power and Lanczos Algorithms with a Random Start / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Bounds on the Extremal Eigenvalues and Condition Number by the Lanczos Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing a Trust Region Step / 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: Q5491447 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Newton-CG algorithm with complexity guarantees for smooth unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Analysis of Second-Order Line-Search Algorithms for Smooth Nonconvex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Conjugate Gradient Method and Trust Regions in Large Scale Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3914337 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Generalized Lanczos Trust-Region Method / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1137/22M1492428 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:59, 30 December 2024

scientific article; zbMATH DE number 7734879
Language Label Description Also known as
English
Worst-Case Complexity of TRACE with Inexact Subproblem Solutions for Nonconvex Smooth Optimization
scientific article; zbMATH DE number 7734879

    Statements

    Worst-Case Complexity of TRACE with Inexact Subproblem Solutions for Nonconvex Smooth Optimization (English)
    0 references
    6 September 2023
    0 references
    nonlinear optimization
    0 references
    nonconvex optimization
    0 references
    worst-case iteration complexity
    0 references
    worst-case evaluation complexity
    0 references
    trust-region methods
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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