A two-step improved Newton method to solve convex unconstrained optimization problems
type: Item
instance of: scholarly article
title: A two-step improved Newton method to solve convex unconstrained optimization problems
zbMATH Open document ID: 1481.90249
author: Yanyan Li
published in: Journal of Applied Mathematics and Computing
publication date: 2021-11-29T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C53
zbMATH DE Number: 7435247
zbMATH Keywords: Newton method
zbMATH Keywords: unconstrained optimization problems
zbMATH Keywords: convergence analysis
describes a project that uses: minpack
MaRDI profile type: Publication
full work available at URL: s12190-019-01272-z
OpenAlex ID: W2954827872
cites work: Q5732060
cites work: Q5491447
cites work: Q4841246
cites work: Q4868581
cites work: Superlinear convergence of a Newton-type algorithm for monotone equations
cites work: Convergence rate of the trust region method for nonlinear equations under local error bound condition
cites work: Regularized Newton methods for convex minimization problems with singular solutions
cites work: On the convergence of a modified regularized Newton method for convex optimization with singular solutions
cites work: Q4324980
cites work: Cubic regularization of Newton method and its global performance
cites work: Regularized Newton method for unconstrained convex optimization
cites work: Q4625416
cites work: Q4963427
cites work: Atangana-Baleanu fractional approach to the solutions of Bagley-Torvik and Painlevé equations in Hilbert space
cites work: Numerical solutions of integrodifferential equations of Fredholm operator type in the sense of the Atangana-Baleanu fractional operator
cites work: Solutions of time‐fractional Tricomi and Keldysh equations of Dirichlet functions types in Hilbert space
cites work: 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
cites work: New classes of iterative methods for nonlinear equations
cites work: An iterative method with cubic convergence for nonlinear equations
cites work: A new modified Halley method without second derivatives for nonlinear equation
cites work: Q5840810
cites work: Q3539529
cites work: Testing Unconstrained Optimization Software
cites work: Benchmarking optimization software with performance profiles.
cites work: An efficient fifth order method for solving systems of nonlinear equations
cites work: A new class of methods with higher order of convergence for solving systems of nonlinear equations
cites work: New two-parameter Chebyshev-Halley-like family of fourth and sixth-order methods for systems of nonlinear equations
Wikidata QID: Q127592477
DOI: 10.1007/S12190-019-01272-Z
description: scientific article; zbMATH DE number 7435247