Solving LP Problems via Weighted Centers

DOI10.1137/S1052623493254273MaRDI QIDQ4717550zbMATH OpenOpenAlexFDO

Authors Aiping Liao, Michael J. Todd

Publication date 8 October 1997

Published in SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s1052623493254273

zbMATH Keywords

algorithmsellipsoid methodlinear inequality systemslinear programmingNewton's method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Recommendations

• On weighted centers for semidefinite programming
• A New Notion of Weighted Centers for Semidefinite Programming
• Interior-point algorithms for a generalization of linear programming and weighted centring
• On weighted rectilinear 2-center and 3-center problems
• Algorithmic Enhancements to the Method of Centers for Linear Programming Problems
• A Polynomial Method of Weighted Centers for Convex Quadratic Programming
• The Weighted Euclidean 1-Center Problem
• Modified predictor-corrector algorithm for locating weighted centers in linear programming
• scientific article; zbMATH DE number 4187480
• Limiting behavior of weighted central paths in linear programming

Cited in

(2)

• The ellipsoid algorithm using parallel cuts
• On weighted centers for semidefinite programming

This page was built for publication: Solving LP Problems via Weighted Centers

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