Variable metric relaxation methods, part II: The ellipsoid method

DOI10.1007/BF02591882zbMath0567.90068OpenAlexW2063768452MaRDI QIDQ3683896

Jean-Louis Goffin

Publication date: 1984

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

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

zbMATH Keywords

linear inequalitiesrelaxation methodspolynomialityleast shallow, cut ellipsoid methodvariable metric quasi-Newton method

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Linear programming (90C05)

Related Items

On the possibilistic approach to linear regression models involving uncertain, indeterminate or interval data, Non-standard approaches to integer programming, Unnamed Item, A deep cut ellipsoid algorithm for convex programming: Theory and applications, Unnamed Item

Cites Work

• Über das Löwnersche Ellipsoid und sein Analogon unter den einem Eikörper einbeschriebenen Ellipsoiden
• Über die affine Exzentrizität konvexer Körper
• On the relationship between the Hausdorff distance and matrix distances of ellipsoids
• The ellipsoid method and its consequences in combinatorial optimization
• Integer Programming with a Fixed Number of Variables
• The Relaxation Method for Solving Systems of Linear Inequalities
• Feature Article—The Ellipsoid Method: A Survey
• On the non-polynomiality of the relaxation method for systems of linear inequalities
• Convergence of a cyclic ellipsoid algorithm for systems of linear equalities
• A Bound on Solutions of Linear Integer Equalities and Inequalities
• On Minimum Volume Ellipsoids Containing Part of a Given Ellipsoid
• The Relaxation Method for Linear Inequalities
• The Relaxation Method for Linear Inequalities
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item