Pages that link to "Item:Q494338"

The following pages link to On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization (Q494338):

Displaying 13 items.

• Nonlinear stepsize control algorithms: complexity bounds for first- and second-order optimality (Q504812) (← links)
• Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models (Q526842) (← links)
• Concise complexity analyses for trust region methods (Q1634776) (← links)
• Global complexity bound of the inexact Levenberg-Marquardt method (Q1656193) (← 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)
• A derivative-free trust-region algorithm for composite nonsmooth optimization (Q2013620) (← links)
• Regional complexity analysis of algorithms for nonconvex smooth optimization (Q2020615) (← links)
• Worst-case complexity bounds of directional direct-search methods for multiobjective optimization (Q2026717) (← links)
• A generalized worst-case complexity analysis for non-monotone line searches (Q2028039) (← links)
• On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization (Q2089862) (← links)
• Complexity of gradient descent for multiobjective optimization (Q5198047) (← links)
• Derivative-free separable quadratic modeling and cubic regularization for unconstrained optimization (Q6489314) (← links)