A two-step improved Newton method to solve convex unconstrained optimization problems

DOI10.1007/s12190-019-01272-zzbMath1481.90249OpenAlexW2954827872WikidataQ127592477 ScholiaQ127592477MaRDI QIDQ2053267

Yanyan Li

Publication date: 29 November 2021

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12190-019-01272-z

zbMATH Keywords

convergence analysisNewton methodunconstrained optimization problems

Mathematics Subject Classification ID

Convex programming (90C25) Methods of quasi-Newton type (90C53)

Related Items (3)

A multi-stage descent algorithm for discrete and continuous optimization applied to truss structures optimal design ⋮ Two nonmonotone trust region algorithms based on an improved Newton method ⋮ A smoothing Newton method with a mixed line search for monotone weighted complementarity problems

Uses Software

• minpack

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An efficient fifth order method for solving systems of nonlinear equations
• Fitted reproducing kernel Hilbert space method for the solutions of some certain classes of time-fractional partial differential equations subject to initial and Neumann boundary conditions
• New two-parameter Chebyshev-Halley-like family of fourth and sixth-order methods for systems of nonlinear equations
• Convergence rate of the trust region method for nonlinear equations under local error bound condition
• An iterative method with cubic convergence for nonlinear equations
• New classes of iterative methods for nonlinear equations
• Regularized Newton method for unconstrained convex optimization
• A new class of methods with higher order of convergence for solving systems of nonlinear equations
• Superlinear convergence of a Newton-type algorithm for monotone equations
• Regularized Newton methods for convex minimization problems with singular solutions
• On the convergence of a modified regularized Newton method for convex optimization with singular solutions
• Numerical solutions of integrodifferential equations of Fredholm operator type in the sense of the Atangana-Baleanu fractional operator
• Atangana-Baleanu fractional approach to the solutions of Bagley-Torvik and Painlevé equations in Hilbert space
• A new modified Halley method without second derivatives for nonlinear equation
• Cubic regularization of Newton method and its global performance
• Testing Unconstrained Optimization Software
• Solutions of time‐fractional Tricomi and Keldysh equations of Dirichlet functions types in Hilbert space
• Benchmarking optimization software with performance profiles.

This page was built for publication: A two-step improved Newton method to solve convex unconstrained optimization problems