A full-Newton step feasible IPM for semidefinite optimization based on a kernel function with linear growth term

DOI10.19823/J.CNKI.1007-1202.2020.0065MaRDI QIDQ4996876zbMATH OpenFDO

Authors Jie Geng, Mingwang Zhang, Jinjuan Pang

Publication date 1 July 2021

Full work available at URL https://doi.org/10.19823/J.CNKI.1007-1202.2020.0065

zbMATH Keywords

interior-point algorithmiteration complexitykernel functionsemidefinite optimization

Mathematics Subject Classification ID

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

Recommendations

• Simplified full Nesterov-Todd step infeasible interior-point algorithm for semidefinite optimization based on a kernel function
• Kernel function based interior-point algorithms for semidefinite optimization
• A new primal-dual interior-point method for semidefinite optimization based on a parameterized kernel function
• A modified full-NT-step infeasible interior-point algorithm for SDP based on a specific kernel function
• AN INTERIOR POINT APPROACH FOR SEMIDEFINITE OPTIMIZATION USING NEW PROXIMITY FUNCTIONS

Cited in

(1)

• Simplified full Nesterov-Todd step infeasible interior-point algorithm for semidefinite optimization based on a kernel function

This page was built for publication: A full-Newton step feasible IPM for semidefinite optimization based on a kernel function with linear growth term

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