Pages that link to "Item:Q1634776"
From MaRDI portal
The following pages link to Concise complexity analyses for trust region methods (Q1634776):
Displaying 14 items.
- On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization (Q494338) (← links)
- Regional complexity analysis of algorithms for nonconvex smooth optimization (Q2020615) (← links)
- An active set trust-region method for bound-constrained optimization (Q2169274) (← links)
- Convergence and evaluation-complexity analysis of a regularized tensor-Newton method for solving nonlinear least-squares problems (Q2419539) (← links)
- Analysis of inexact trust-region SQP algorithms (Q2784412) (← links)
- (Q3837885) (← links)
- Complexity and global rates of trust-region methods based on probabilistic models (Q4555983) (← links)
- (Q4842456) (← links)
- A Proximal Quasi-Newton Trust-Region Method for Nonsmooth Regularized Optimization (Q5081096) (← links)
- Finding stationary points on bounded-rank matrices: a geometric hurdle and a smooth remedy (Q6038660) (← links)
- Worst-Case Complexity of TRACE with Inexact Subproblem Solutions for Nonconvex Smooth Optimization (Q6046826) (← links)
- Complexity analysis of interior-point methods for second-order stationary points of nonlinear semidefinite optimization problems (Q6051305) (← links)
- Detecting negative eigenvalues of exact and approximate Hessian matrices in optimization (Q6057628) (← links)
- The effect of smooth parametrizations on nonconvex optimization landscapes (Q6665380) (← links)