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

From MaRDI portal

Jump to:navigation, search

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

scholarly article

0 references

Worst-Case Complexity of TRACE with Inexact Subproblem Solutions for Nonconvex Smooth Optimization (English)

0 references

SIAM Journal on Optimization

0 references

publication date

6 September 2023

0 references

full work available at URL

https://arxiv.org/abs/2204.11322

0 references

zbMATH Keywords

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

MaRDI profile type

0 references

Solving the Trust-Region Subproblem By a Generalized Eigenvalue Problem

0 references

Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models

0 references

The Use of Quadratic Regularization with a Cubic Descent Condition for Unconstrained Optimization

0 references

Accelerated Methods for NonConvex Optimization

0 references

On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems

0 references

Evaluation Complexity of Algorithms for Nonconvex Optimization: Theory, Computation and Perspectives

0 references

Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results

0 references

Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity

0 references

0 references

Trust Region Methods

0 references

Concise complexity analyses for trust region methods

0 references

Trust-Region Newton-CG with Strong Second-Order Complexity Guarantees for Nonconvex Optimization

0 references

A trust region algorithm with a worst-case iteration complexity of \(\mathcal{O}(\epsilon ^{-3/2})\) for nonconvex optimization

0 references

An inexact regularized Newton framework with a worst-case iteration complexity of $ {\mathscr O}(\varepsilon^{-3/2}) $ for nonconvex optimization

0 references

Inexact Newton Methods

0 references

Benchmarking optimization software with performance profiles.

0 references

ARC<sub>q</sub>: a new adaptive regularization by cubics

0 references

Solving the Trust-Region Subproblem using the Lanczos Method

0 references

CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization

0 references

Updating the regularization parameter in the adaptive cubic regularization algorithm

0 references

Error estimates for iterative algorithms for minimizing regularized quadratic subproblems

0 references

On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization

0 references

The Convergence of the Generalized Lanczos Trust-Region Method for the Trust-Region Subproblem

0 references

Estimating the Largest Eigenvalue by the Power and Lanczos Algorithms with a Random Start

0 references

Probabilistic Bounds on the Extremal Eigenvalues and Condition Number by the Lanczos Algorithm

0 references

Computing a Trust Region Step

0 references

Cubic regularization of Newton method and its global performance

0 references

0 references

A Newton-CG algorithm with complexity guarantees for smooth unconstrained optimization

0 references

Complexity Analysis of Second-Order Line-Search Algorithms for Smooth Nonconvex Optimization

0 references

The Conjugate Gradient Method and Trust Regions in Large Scale Optimization

0 references

0 references

On the Generalized Lanczos Trust-Region Method

0 references

Identifiers

zbMATH Open document ID

0 references

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

10.1137/22M1492428

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6046826

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q6046826&oldid=39670789"