Convergence of a cyclic ellipsoid algorithm for systems of linear equalities

DOI10.1007/BF01581042zbMath0475.90072OpenAlexW2000275471MaRDI QIDQ3931030

Jean-Louis Goffin

Publication date: 1982

Published in: Mathematical Programming (Search for Journal in Brave)

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

zbMATH Keywords

convergencenondifferentiable functionssystems of linear equalitiescyclic ellipsoid algorithmcyclic implementationvariable metric optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Iterative numerical methods for linear systems (65F10) Linear equations (linear algebraic aspects) (15A06)

Related Items

Variable metric relaxation methods, part II: The ellipsoid method

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient search for rationals
• Family of algorithms for solving convex programming problems
• On convergence rates of subgradient optimization methods
• The Relaxation Method for Linear Inequalities
• The Relaxation Method for Linear Inequalities