Pages that link to "Item:Q504812"
From MaRDI portal
The following pages link to Nonlinear stepsize control algorithms: complexity bounds for first- and second-order optimality (Q504812):
Displaying 15 items.
- Concise complexity analyses for trust region methods (Q1634776) (← links)
- On the worst-case evaluation complexity of non-monotone line search algorithms (Q1694392) (← links)
- Improved optimization methods for image registration problems (Q1717565) (← links)
- Second-order optimality and beyond: characterization and evaluation complexity in convexly constrained nonlinear optimization (Q1785005) (← links)
- Optimality of orders one to three and beyond: characterization and evaluation complexity in constrained nonconvex optimization (Q2001208) (← links)
- Regional complexity analysis of algorithms for nonconvex smooth optimization (Q2020615) (← links)
- A generalized worst-case complexity analysis for non-monotone line searches (Q2028039) (← links)
- An adaptive trust-region method without function evaluations (Q2125064) (← links)
- An active set trust-region method for bound-constrained optimization (Q2169274) (← links)
- A decoupled first/second-order steps technique for nonconvex nonlinear unconstrained optimization with improved complexity bounds (Q2288191) (← links)
- Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary (Q2330649) (← links)
- Complexity Analysis of Second-Order Line-Search Algorithms for Smooth Nonconvex Optimization (Q4641667) (← links)
- A Proximal Quasi-Newton Trust-Region Method for Nonsmooth Regularized Optimization (Q5081096) (← links)
- A concise second-order complexity analysis for unconstrained optimization using high-order regularized models (Q5210739) (← links)
- A proximal trust-region method for nonsmooth optimization with inexact function and gradient evaluations (Q6165597) (← links)
