Convergence of a cyclic ellipsoid algorithm for systems of linear equalities

DOI10.1007/BF01581042MaRDI QIDQ3931030zbMATH OpenOpenAlexFDO

Authors 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

convergencecyclic ellipsoid algorithmcyclic implementationnondifferentiable functionssystems of linear equalitiesvariable metric optimization

Mathematics Subject Classification ID

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

Cites work

• Efficient search for rationals
• Family of algorithms for solving convex programming problems
• scientific article; zbMATH DE number 3644821 (Why is no real title available?)
• scientific article; zbMATH DE number 3508265 (Why is no real title available?)
• scientific article; zbMATH DE number 3516928 (Why is no real title available?)
• scientific article; zbMATH DE number 3528040 (Why is no real title available?)
• scientific article; zbMATH DE number 3588394 (Why is no real title available?)
• scientific article; zbMATH DE number 3385445 (Why is no real title available?)
• On convergence rates of subgradient optimization methods
• The Relaxation Method for Linear Inequalities
• The Relaxation Method for Linear Inequalities

Cited in

(1)

• Variable metric relaxation methods, part II: The ellipsoid method

This page was built for publication: Convergence of a cyclic ellipsoid algorithm for systems of linear equalities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3931030)