A robust superlinearly convergent algorithm for linearly constrained optimization problems under degeneracy

DOI10.1007/BF02683819zbMath0948.90119OpenAlexW2023963453MaRDI QIDQ1299844

Qingguang Zeng, Fang Wu, Guo-Ping He

Publication date: 27 November 2000

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02683819

zbMATH Keywords

degeneracysuperlinear convergenceoptimization problemdual simplex methodlinearly constrained

Mathematics Subject Classification ID

Convex programming (90C25)

Cites Work

• Unnamed Item
• Unnamed Item
• A super-linear convergent gradient projection type algorithm for linearly constrained problems
• A superlinearly convergent method to linearly constrained optimization problems under degeneracy
• The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
• Extension of Davidon’s Variable Metric Method to Maximization Under Linear Inequality and Equality Constraints

This page was built for publication: A robust superlinearly convergent algorithm for linearly constrained optimization problems under degeneracy