Pages that link to "Item:Q2419564"
From MaRDI portal
The following pages link to A Newton-like method with mixed factorizations and cubic regularization for unconstrained minimization (Q2419564):
Displaying 7 items.
- An accelerated first-order method with complexity analysis for solving cubic regularization subproblems (Q2044484) (← links)
- On large-scale unconstrained optimization and arbitrary regularization (Q2070329) (← links)
- On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization (Q2089862) (← links)
- Several accelerated subspace minimization conjugate gradient methods based on regularization model and convergence rate analysis for nonconvex problems (Q2098802) (← links)
- Block coordinate descent for smooth nonconvex constrained minimization (Q2162523) (← links)
- A novel robust fixed-time convergent zeroing neural network for solving time-varying noise-polluted nonlinear equations (Q5033402) (← links)
- Iteration and evaluation complexity for the minimization of functions whose computation is intrinsically inexact (Q5235099) (← links)
