A primal-dual infeasible interior point algorithm for semidefinite programming

MaRDI QIDQ5310748zbMATH OpenFDO

Authors Ling Liu, Xiaomin Wang

Publication date 12 October 2007

zbMATH Keywords

infeasible interior point algorithminterior point algorithmsemidefinite programming

Mathematics Subject Classification ID

Semidefinite programming (90C22) Interior-point methods (90C51)

Recommendations

• Polynomiality of an inexact infeasible interior point algorithm for semidefinite programming
• The research of a modified primal-dual interior-point algorithm for SDP
• Infeasible interior point method for semidefinite programs
• A numerical feasible interior point method for linear semidefinite programs
• A new wide neighborhood infeasible interior-point algorithm for semidefinite programming

Cited in

(18)

• An infeasible interior-point algorithm for solving primal and dual geometric programs
• A primal-dual interior point method for parametric semidefinite programming problems
• Convergence of a dual-variable vector sequence in a semi-definite programming problem
• An infeasible primal-dual interior point algorithm for linear programs based on logarithmic equivalent transformation
• Primal-dual affine-scaling algorithms fail for semidefinite programming
• The research of a modified primal-dual interior-point algorithm for SDP
• A feasible primal-dual interior point method for linear semidefinite programming
• An inexact interior-point method for system analysis
• A Superlinearly Convergent Primal-Dual Infeasible-Interior-Point Algorithm for Semidefinite Programming
• An Interior Proximal Algorithm and the Exponential Multiplier Method for Semidefinite Programming
• On homogeneous interrior-point algorithms for semidefinite programming
• scientific article; zbMATH DE number 1782596 (Why is no real title available?)
• A numerical feasible interior point method for linear semidefinite programs
• Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming
• Infeasible potential reduction algorithms for semidefinite programming
• Monotonicity of primal–dual interior-point algorithms for semidefinite programming problems
• A T-Algebraic Approach to Primal-Dual Interior-Point Algorithms
• Computational experience with ill-posed problems in semidefinite programming

This page was built for publication: A primal-dual infeasible interior point algorithm for semidefinite programming

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