Global convergence analysis of algorithms for finding feasible points in norm-relaxed MFD
type: Item
instance of: scholarly article
title: Global convergence analysis of algorithms for finding feasible points in norm-relaxed MFD
zbMATH Open document ID: 0915.90234
DOI: 10.1023/A:1021778002066
author: Xibin Chen
author: Michael M. Kostreva
published in: Journal of Optimization Theory and Applications
publication date: 1999-05-17T00:00:00Z
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 1260398
zbMATH Keywords: method of feasible directions
zbMATH Keywords: direction-finding subproblem
zbMATH Keywords: global convergence
zbMATH Keywords: feasible points
zbMATH Keywords: nonlinear programming
MaRDI profile type: Publication
cites work: Q3277015
cites work: Q4721081
cites work: An efficient algorithm for solving inequalities
cites work: Methods for finding feasible points in constrained optimization
cites work: On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming
cites work: Rate of Convergence of a Class of Methods of Feasible Directions
cites work: Norm-relaxed method of feasible directions for solving nonlinear programming problems
cites work: Convergence analysis of norm-relaxed method of feasible directions
cites work: Self-tuning norm-relaxed method of feasible directions
cites work: Test examples for nonlinear programming codes
cites work: More test examples for nonlinear programming codes
cites work: Generalization of Murty's direct algorithm to linear and convex quadratic programming
full work available at URL: a:1021778002066
OpenAlex ID: W1517219963
description: scientific article; zbMATH DE number 1260398