An efficient improvement of the Newton method for solving nonconvex optimization problems
From MaRDI portal
Recommendations
- A two-step improved Newton method to solve convex unconstrained optimization problems
- A modified Newton direction for unconstrained optimization
- On the application of Newton's method to a class of optimization problems
- An improved Newton-type hybrid method
- A new modified trust region algorithm for solving unconstrained optimization problems
Cited in
(12)- On the application of Newton's method to a class of optimization problems
- A two-step improved Newton method to solve convex unconstrained optimization problems
- scientific article; zbMATH DE number 32326 (Why is no real title available?)
- Optimization of newton-raphson methods in RC nonlinear analysis
- Two modified adaptive cubic regularization algorithms by using the nonmonotone Armijo-type line search
- On a modified version of the Henrici's transformation into optimization
- Newton-type methods for non-convex optimization under inexact Hessian information
- Newton Sketch: A Near Linear-Time Optimization Algorithm with Linear-Quadratic Convergence
- An improvement of adaptive cubic regularization method for unconstrained optimization problems
- Combined methods for solving degenerate unconstrained optimization problems
- A smoothing Newton method with a mixed line search for monotone weighted complementarity problems
- Two nonmonotone trust region algorithms based on an improved Newton method
This page was built for publication: An efficient improvement of the Newton method for solving nonconvex optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4625416)
