A new parametric kernel function with trigonometric barrier term for convex quadratic symmetric cone optimization

MaRDI QIDQ5070387zbMATH OpenFDO

Authors M. El Ghami, Trond Steihaug, Guoqiang Wang

Publication date 11 April 2022

Full work available at URL http://yokohamapublishers.jp/online2/opaao/vol1/p19.html

zbMATH Keywords

convex quadratic optimizationEuclidean Jordan algebrasinterior-point methodslarge- and small-update methodspolynomial complexitysymmetric cone

Mathematics Subject Classification ID

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

Recommendations

• A primal-dual interior-point algorithm for symmetric optimization based on a new kernel function with trigonometric barrier term yielding the best known iteration bounds
• Kernel-function-based primal-dual interior-point methods for convex quadratic optimization over symmetric cone
• An Interior Point Algorithm for Solving Convex Quadratic Semidefinite Optimization Problems Using a New Kernel Function
• Complexity analysis of primal-dual interior-point methods for linear optimization based on a new parametric kernel function with a trigonometric barrier term
• A new parametric kernel function yielding the best known iteration bounds of interior-point methods for the Cartesian \(P_\ast( \kappa)\)-SCLCP

Cited in

(2)

• Kernel-function-based primal-dual interior-point methods for convex quadratic optimization over symmetric cone
• Comprehensive analysis of kernel-based interior-point methods for the P_*()-LCP

This page was built for publication: A new parametric kernel function with trigonometric barrier term for convex quadratic symmetric cone optimization

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