Dual versus primal-dual interior-point methods for linear and conic programming

DOI10.1007/S10107-006-0067-3zbMATH Open1163.90797OpenAlexW2069972878MaRDI QIDQ2467157FDOQ2467157

Authors: Michael J. Todd 

Publication date: 21 January 2008

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

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

Recommendations

• Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems
• Primal-Dual Interior-Point Methods for Self-Scaled Cones
• Detecting infeasibility in infeasible-interior-point methods for optimization
• scientific article; zbMATH DE number 1322753
• scientific article; zbMATH DE number 1064582

Mathematics Subject Classification ID

Interior-point methods (90C51) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Cites Work

• Solving semidefinite-quadratic-linear programs using SDPT3
• Title not available (Why is that?)
• Title not available (Why is that?)
• Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
• Title not available (Why is that?)
• A polynomial-time algorithm, based on Newton's method, for linear programming
• Title not available (Why is that?)
• Barrier Functions in Interior Point Methods
• Path-Following Methods for Linear Programming
• An implementation of Karmarkar's algorithm for linear programming
• An $O(\sqrt{n} L)$-Iteration Large-Step Primal-Dual Affine Algorithm for Linear Programming
• Detecting infeasibility in infeasible-interior-point methods for optimization

Cited In (2)

• Polynomial time solvability of non-symmetric semidefinite programming
• Title not available (Why is that?)

Uses Software

• SDPT3
• COL

This page was built for publication: Dual versus primal-dual interior-point methods for linear and conic programming

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