A robust superlinearly convergent algorithm for linearly constrained optimization problems under degeneracy
type: Item
instance of: scholarly article
title: A robust superlinearly convergent algorithm for linearly constrained optimization problems under degeneracy
zbMATH Open document ID: 0948.90119
DOI: 10.1007/BF02683819
author: Qingguang Zeng
author: Fang Wu
author: Guoping He
published in: Acta Mathematicae Applicatae Sinica. English Series
publication date: 2000-11-27T00:00:00Z
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 1328407
zbMATH Keywords: linearly constrained
zbMATH Keywords: optimization problem
zbMATH Keywords: degeneracy
zbMATH Keywords: dual simplex method
zbMATH Keywords: superlinear convergence
MaRDI profile type: Publication
cites work: Extension of Davidon’s Variable Metric Method to Maximization Under Linear Inequality and Equality Constraints
cites work: The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
cites work: A super-linear convergent gradient projection type algorithm for linearly constrained problems
cites work: A superlinearly convergent method to linearly constrained optimization problems under degeneracy
cites work: Q3361813
cites work: Q4107408
full work available at URL: https://doi.org/10.1007/bf02683819
OpenAlex ID: W2023963453
description: scientific article; zbMATH DE number 1328407