Pages that link to "Item:Q2494519"
From MaRDI portal
The following pages link to Cubic regularization of Newton method and its global performance (Q2494519):
Displayed 15 items.
- Global complexity bound analysis of the Levenberg-Marquardt method for nonsmooth equations and its application to the nonlinear complementarity problem (Q415364) (← links)
- A trust region algorithm with adaptive cubic regularization methods for nonsmooth convex minimization (Q429459) (← links)
- Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results (Q535013) (← links)
- On a global complexity bound of the Levenberg-marquardt method (Q620432) (← links)
- Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity (Q652287) (← links)
- Complexity bounds for second-order optimality in unconstrained optimization (Q657654) (← links)
- On solving trust-region and other regularised subproblems in optimization (Q977328) (← links)
- Accelerating the cubic regularization of Newton's method on convex problems (Q995787) (← links)
- Trust-region and other regularisations of linear least-squares problems (Q1014897) (← links)
- Regularized Newton method for unconstrained convex optimization (Q1016344) (← links)
- Newton's iterates can converge to non-stationary points (Q2465652) (← links)
- Evaluation complexity of adaptive cubic regularization methods for convex unconstrained optimization (Q2885470) (← links)
- Characterizations of Łojasiewicz inequalities: Subgradient flows, talweg, convexity (Q3566718) (← links)
- Modified Gauss–Newton scheme with worst case guarantees for global performance (Q5436914) (← links)
- Primal–dual exterior point method for convex optimization (Q5459822) (← links)