Pages that link to "Item:Q742310"

The following pages link to A regularized Newton method without line search for unconstrained optimization (Q742310):

Displaying 16 items.

• 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)
• Descent line search scheme using Geršgorin circle theorem (Q1728356) (← links)
• A new augmented Lagrangian method for equality constrained optimization with simple unconstrained subproblem (Q1784887) (← links)
• A new regularized quasi-Newton method for unconstrained optimization (Q1800450) (← links)
• Local convergence analysis of a primal-dual method for bound-constrained optimization without SOSC (Q2032022) (← links)
• A regularized limited memory BFGS method for large-scale unconstrained optimization and its efficient implementations (Q2125067) (← links)
• Erratum to: ``A regularized Newton method without line search for unconstrained optimization'' (Q2397098) (← links)
• A Perry-type derivative-free algorithm for solving nonlinear system of equations and minimizing ℓ₁regularized problem (Q4999755) (← links)
• Correction of trust region method with a new modified Newton method (Q5030542) (← links)
• A Bregman Forward-Backward Linesearch Algorithm for Nonconvex Composite Optimization: Superlinear Convergence to Nonisolated Local Minima (Q5853567) (← 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)
• Regularized Newton Method with Global \({\boldsymbol{\mathcal{O}(1/{k}^2)}}\) Convergence (Q6116237) (← links)
• Super-Universal Regularized Newton Method (Q6136654) (← links)