Fixed-Point Quasi-Newton Methods

DOI10.1137/0729081zbMath0758.65043OpenAlexW2169019464MaRDI QIDQ4020503

José Mario Martínez

Publication date: 17 January 1993

Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0729081

zbMATH Keywords

nonlinear systemssequential quadratic programmingiterative methodslocal convergencequasi-Newton methodssuperlinear convergencenonlinear complementarityleast-change fixed-point iterations

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Numerical computation of solutions to systems of equations (65H10) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items

Difference equations and local convergence of inexact Newton methods ⋮ A generalized univariate Newton method motivated by proximal regularization ⋮ Accelerating the solution of a physics model inside a tokamak using the (inverse) column updating method ⋮ Solving nonlinear systems of equations by means of quasi-neston methods with a nonmonotone stratgy^∗ ⋮ New theoretical results on recursive quadratic programming algorithms ⋮ On preconditioned Uzawa methods and SOR methods for saddle-point problems ⋮ Practical quasi-Newton methods for solving nonlinear systems ⋮ Parallel projection methods and the resolution of ill-posed problems

This page was built for publication: Fixed-Point Quasi-Newton Methods