An Interior Point Method for Bordered Block-Diagonal Linear Programs

DOI10.1137/S1052623494263609MaRDI QIDQ4717549zbMATH OpenFDO

Authors M. D. Grigoriadis, Leonid G. Khachiyan

Publication date 18 August 1997

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

zbMATH Keywords

interior point methodbordered block-diagonal linear programdisjoint blocks

Mathematics Subject Classification ID

Linear programming (90C05) Large-scale problems in mathematical programming (90C06) Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10) Nonlinear programming (90C30)

Recommendations

• An interior point method for linear programming
• scientific article; zbMATH DE number 4031392
• Boundary Behavior of Interior Point Algorithms in Linear Programming
• An Interior-Point Method for Semidefinite Programming
• scientific article; zbMATH DE number 946715
• scientific article; zbMATH DE number 409894
• An interior point algorithm for semi-infinite linear programming
• scientific article; zbMATH DE number 123966
• Interior dual proximal point algorithm for linear programs

Cited in

(6)

• Interior point methods 25 years later
• Exploiting Special Structure in Primal Dual Interior Point Methods
• A boundary point method to solve semidefinite programs
• A boundary-point LP solution method and its application to dense linear programs
• Exploiting structure in parallel implementation of interior point methods for optimization
• Scientific contributions of Leo Khachiyan (a short overview)

Describes a project that uses

Uses Software

• MINOS

This page was built for publication: An Interior Point Method for Bordered Block-Diagonal Linear Programs

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