Efficient regularized Newton-type algorithm for solving convex optimization problem
From MaRDI portal
Publication:2089188
DOI10.1007/s12190-021-01620-yzbMath1496.65070OpenAlexW3196907865MaRDI QIDQ2089188
Publication date: 6 October 2022
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12190-021-01620-y
Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30)
Uses Software
Cites Work
- Convergence of Newton-like methods for singular operator equations using outer inverses
- A regularization Newton method for solving nonlinear complementarity problems
- Regularized Newton methods for convex minimization problems with singular solutions
- Optimization theory and methods. Nonlinear programming
- An Algorithm for Least-Squares Estimation of Nonlinear Parameters
- Correction of trust region method with a new modified Newton method
- A regularized Newton method for monotone nonlinear equations and its application
- A method for the solution of certain non-linear problems in least squares
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Efficient regularized Newton-type algorithm for solving convex optimization problem