Primal-dual interior point algorithms for semidefinite optimization based on a kernel function with quadratic growth rate

zbMATH Open1288.90061MaRDI QIDQ5403347FDOQ5403347

Authors: Adama Coulibaly, David Paul Tuo 

Publication date: 25 March 2014

Recommendations

• Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function
• Kernel function based interior-point algorithms for semidefinite optimization
• Numerical results of primal-dual interior-point algorithms for semidefinite optimization based on kernel functions
• A class of polynomial primal-dual interior-point algorithms for semidefinite optimization
• A new primal-dual interior-point method for semidefinite optimization based on a parameterized kernel function

zbMATH Keywords

iteration boundlarge-and small-update methods

Mathematics Subject Classification ID

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

Cited In (8)

• A unified kernel function approach to primal-dual interior-point algorithms for convex quadratic SDO
• Numerical results of primal-dual interior-point algorithms for semidefinite optimization based on kernel functions
• Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function
• An Interior Point Algorithm for Solving Convex Quadratic Semidefinite Optimization Problems Using a New Kernel Function
• Self-regular interior-point methods for semidefinite optimization
• Kernel function based interior-point algorithms for semidefinite optimization
• Title not available (Why is that?)
• New complexity analysis for primal-dual interior-point methods for self-scaled optimization problems

This page was built for publication: Primal-dual interior point algorithms for semidefinite optimization based on a kernel function with quadratic growth rate

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