A feasible and superlinear algorithm for inequality constrained minimization problems
type: Item
instance of: scholarly article
title: A feasible and superlinear algorithm for inequality constrained minimization problems
zbMATH Open document ID: 0962.90047
DOI: 10.1007/BF02670962
author: Wei Wang
author: Yifan Xu
published in: Acta Mathematicae Applicatae Sinica. English Series
publication date: 2001-06-24T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C55
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 1462492
zbMATH Keywords: strict complementary condition
zbMATH Keywords: global convergence
zbMATH Keywords: superlinear convergence
MaRDI profile type: Publication
cites work: Local analysis of Newton-type methods for variational inequalities and nonlinear programming
cites work: A surperlinearly convergent algorithm for constrained optimization problems
cites work: Superlinearly convergent variable metric algorithms for general nonlinear programming problems
cites work: On combining feasibility, descent and superlinear convergence in inequality constrained optimization
cites work: A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems
cites work: Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
cites work: Sequential Quadratic Programming with Penalization of the Displacement
cites work: Avoiding the Maratos Effect by Means of a Nonmonotone Line Search. II. Inequality Constrained Problems—Feasible Iterates
cites work: Generalized equations and their solutions, part II: Applications to nonlinear programming
cites work: The watchdog technique for forcing convergence in algorithms for constrained optimization
full work available at URL: https://doi.org/10.1007/bf02670962
OpenAlex ID: W1965274645
description: scientific article; zbMATH DE number 1462492