Pages that link to "Item:Q1730832"
From MaRDI portal
The following pages link to A line-search algorithm inspired by the adaptive cubic regularization framework and complexity analysis (Q1730832):
Displaying 13 items.
- A generalized worst-case complexity analysis for non-monotone line searches (Q2028039) (← links)
- On large-scale unconstrained optimization and arbitrary regularization (Q2070329) (← links)
- A cubic regularization of Newton's method with finite difference Hessian approximations (Q2138398) (← links)
- Large-scale unconstrained optimization using separable cubic modeling and matrix-free subspace minimization (Q2301133) (← links)
- Combining stochastic adaptive cubic regularization with negative curvature for nonconvex optimization (Q2302838) (← links)
- A Newton-like method with mixed factorizations and cubic regularization for unconstrained minimization (Q2419564) (← links)
- A sequential adaptive regularisation using cubics algorithm for solving nonlinear equality constrained optimization (Q2696932) (← links)
- A cubic regularization algorithm for unconstrained optimization using line search and nonmonotone techniques (Q2829572) (← links)
- Complexity Analysis of Second-Order Line-Search Algorithms for Smooth Nonconvex Optimization (Q4641667) (← links)
- On the Complexity of an Inexact Restoration Method for Constrained Optimization (Q5210514) (← links)
- Trust-Region Newton-CG with Strong Second-Order Complexity Guarantees for Nonconvex Optimization (Q5853562) (← links)
- Two modified adaptive cubic regularization algorithms by using the nonmonotone Armijo-type line search (Q6062861) (← links)
- A filter sequential adaptive cubic regularization algorithm for nonlinear constrained optimization (Q6109884) (← links)
