Complexity analysis of an interior point algorithm for the semidefinite optimization based on a kernel function with a double barrier term

DOI10.1007/s10114-015-1314-4zbMath1308.65086OpenAlexW2398974498MaRDI QIDQ2018886

Mohamed Achache

Publication date: 25 March 2015

Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10114-015-1314-4

zbMATH Keywords

semidefinite optimizationprimal-dual interior point methodskernel functionscomplexity of algorithmslarge and small-update algorithms

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Convex programming (90C25) Interior-point methods (90C51)

Related Items (4)

Complexity analysis and numerical implementation of large-update interior-point methods for SDLCP based on a new parametric barrier kernel function ⋮ An interior-point algorithm for semidefinite least-squares problems. ⋮ An interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new trigonometric kernel function with a double barrier term ⋮ A full-Newton step feasible interior-point algorithm for monotone horizontal linear complementarity problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On complexity analysis of the primal-dual interior-point method for semidefinite optimization problem based on a new proximity function
• A new primal-dual path-following method for convex quadratic programming
• A new kind of simple kennel function yielding good iteration bounds for primal-dual interior-point methods
• Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions
• A new class of polynomial primal-dual methods for linear and semidefinite optimization
• Self-regular functions and new search directions for linear and semidefinite optimization
• A generic primal–dual interior-point method for semidefinite optimization based on a new class of kernel functions
• A primal‐dual interior-point method for linear optimization based on a new proximity function
• A study of search directions in primal-dual interior-point methods for semidefinite programming
• A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
• Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
• Semidefinite Programming

This page was built for publication: Complexity analysis of an interior point algorithm for the semidefinite optimization based on a kernel function with a double barrier term