Monotonicity of Primal and Dual Objective Values in Primal-dual Interior-point Algorithms

DOI10.1137/0804034MaRDI QIDQ4308558zbMATH OpenOpenAlexFDO

Authors Shinji Mizuno, Michael J. Todd, Levent Tunçel

Publication date 4 October 1994

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

Full work available at URL https://hdl.handle.net/1813/8899

zbMATH Keywords

centering componentinterior point methodsprimal-dual algorithms

Mathematics Subject Classification ID

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

Recommendations

• Convergence of Interior Point Algorithms for the Monotone Linear Complementarity Problem
• scientific article; zbMATH DE number 4164543
• Interior path following primal-dual algorithms. I: Linear programming
• Dual interior point algorithms
• A Superlinearly Convergent Polynomial Primal-Dual Interior-Point Algorithm for Linear Programming

Cited in

(2)

• scientific article; zbMATH DE number 772736 (Why is no real title available?)
• A new potential reduction algorithm for smooth convex programming

This page was built for publication: Monotonicity of Primal and Dual Objective Values in Primal-dual Interior-point Algorithms

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