Pages that link to "Item:Q1634776"

The following pages link to Concise complexity analyses for trust region methods (Q1634776):

Displaying 8 items.

• 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)
• 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)