Pages that link to "Item:Q708864"
From MaRDI portal
The following pages link to Convergence properties of the regularized Newton method for the unconstrained nonconvex optimization (Q708864):
Displaying 18 items.
- The Levenberg-Marquardt-type methods for a kind of vertical complementarity problem (Q410763) (← links)
- Global complexity bound analysis of the Levenberg-Marquardt method for nonsmooth equations and its application to the nonlinear complementarity problem (Q415364) (← links)
- An inexact proximal regularization method for unconstrained optimization (Q522090) (← links)
- On a global complexity bound of the Levenberg-marquardt method (Q620432) (← links)
- A regularized Newton method without line search for unconstrained optimization (Q742310) (← links)
- A new method with sufficient descent property for unconstrained optimization (Q1725328) (← links)
- Second-order optimality and beyond: characterization and evaluation complexity in convexly constrained nonlinear optimization (Q1785005) (← links)
- A new regularized quasi-Newton method for unconstrained optimization (Q1800450) (← links)
- A regularized Newton method for degenerate unconstrained optimization problems (Q1926636) (← links)
- Optimality of orders one to three and beyond: characterization and evaluation complexity in constrained nonconvex optimization (Q2001208) (← links)
- Local convergence analysis of a primal-dual method for bound-constrained optimization without SOSC (Q2032022) (← links)
- Two nonmonotone trust region algorithms based on an improved Newton method (Q2053070) (← links)
- A regularized limited memory BFGS method for large-scale unconstrained optimization and its efficient implementations (Q2125067) (← links)
- Global complexity bound of the Levenberg–Marquardt method (Q2829563) (← links)
- A fast and simple modification of Newton's method avoiding saddle points (Q6086150) (← links)
- Regularization of limited memory quasi-Newton methods for large-scale nonconvex minimization (Q6095733) (← links)
- A Regularized Newton Method for \({\boldsymbol{\ell}}_{q}\) -Norm Composite Optimization Problems (Q6116248) (← links)
- A regularized limited memory subspace minimization conjugate gradient method for unconstrained optimization (Q6141538) (← links)