A modified full-NT-step infeasible interior-point algorithm for SDP based on a specific kernel function

DOI10.11916/J.ISSN.1005-9113.17078MaRDI QIDQ5209519zbMATH OpenOpenAlexFDO

Authors

Publication date 22 January 2020

Full work available at URL http://hit.alljournals.cn/html/jhit_cn/2019/2/20190204.html

zbMATH Keywords

semidefinite programmingpolynomial complexityinfeasible interior-point methodskernel functionsfull Nesterov-Todd steps

Mathematics Subject Classification ID

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

Recommendations

• A full-NT-step infeasible interior-point algorithm for SDP based on kernel functions
• Simplified infeasible interior-point algorithm for SDO using full Nesterov-Todd step
• Simplified full Nesterov-Todd step infeasible interior-point algorithm for semidefinite optimization based on a kernel function
• A full NT-step infeasible interior-point algorithm for semidefinite optimization
• A full Nesterov-Todd step infeasible interior-point algorithm for symmetric optimization based on a specific kernel function

Cited in

(4)

• Full-NT step infeasible interior-point method for SOCO based on a specific kernel function
• A full-NT-step infeasible interior-point algorithm for SDP based on kernel functions
• A full-Newton step feasible IPM for semidefinite optimization based on a kernel function with linear growth term
• A full Nesterov-Todd step infeasible interior-point algorithm for symmetric optimization based on a specific kernel function

This page was built for publication: A modified full-NT-step infeasible interior-point algorithm for SDP based on a specific kernel function

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