Some improved projected quasi-Newton algorithms and their convergence. II: Local convergence rate and numerical tests
type: Item
instance of: scholarly article
title: Some improved projected quasi-Newton algorithms and their convergence. II: Local convergence rate and numerical tests
zbMATH Open document ID: 0683.65047
DOI: 10.1007/BF02006186
author: Shaoping Hou
author: Jianzhong Zhang
author: Detong Zhu
published in: Acta Mathematicae Applicatae Sinica. English Series
publication date: 1989-01-01T00:00:00Z
review text: It is proved that the improved two-sided projected quasi-Newton algorithms for the problem min f(x), \(c(x)=0\), which were presented in part I [ibid. 5, No.1, 33-45 (1989; reviewed above)], are locally one- step or two-step superlinearly convergent. Furthermore, numerical results for some test problems, which are selected from the literature, are given.
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 4119514
zbMATH Keywords: superlinear convergence
zbMATH Keywords: numerical examples
zbMATH Keywords: projected quasi-Newton algorithms
zbMATH Keywords: test problems
reviewed by: Hans Benker
MaRDI profile type: Publication
cites work: Projected Hessian Updating Algorithms for Nonlinearly Constrained Optimization
cites work: Some improved projected quasi-Newton algorithms and their convergence. I: Methods and global behavior
cites work: On the Local Convergence of a Quasi-Newton Method for the Nonlinear Programming Problem
cites work: Q5652460
cites work: Algorithms for nonlinear constraints that use lagrangian functions
cites work: Augmented Lagrangians which are quadratic in the multiplier
cites work: Q3321851
cites work: On the convergence of a sequential quadratic programming method with an augmented lagrangian line search function
cites work: Q3337235
cites work: Recursive quadratic programming methods based on the augmented lagrangian
description: scientific article; zbMATH DE number 4119514