Monotonicity of primal–dual interior-point algorithms for semidefinite programming problems

DOI10.1080/10556789808805715zbMATH Open0942.90032OpenAlexW2078452707MaRDI QIDQ4946709FDOQ4946709

Authors: Masakazu Kojima, Levent Tunçel 

Publication date: 20 August 2000

Published in: Optimization Methods \& Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556789808805715

Recommendations

• On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
• A primal-dual infeasible interior point algorithm for semidefinite programming
• scientific article; zbMATH DE number 741122
• Symmetric primal-dual path-following algorithms for semidefinite programming
• A wide neighbourhood interior-point method with iteration-complexity bound for semidefinite programming

zbMATH Keywords

semidefinite programminginterior-point methodspolynomial complexityprimal-dual algorithms

Mathematics Subject Classification ID

Interior-point methods (90C51) Semidefinite programming (90C22) Abstract computational complexity for mathematical programming problems (90C60)

Cited In (1)

• Title not available (Why is that?)

Uses Software

• SDPA

This page was built for publication: Monotonicity of primal–dual interior-point algorithms for semidefinite programming problems

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