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-4zbMATH Open1308.65086OpenAlexW2398974498MaRDI QIDQ2018886FDOQ2018886
Authors: 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
Recommendations
- Complexity analysis of interior-point algorithm based on a new kernel function for semidefinite optimization
- Kernel function based interior-point algorithms for semidefinite optimization
- Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function
- Complexity analysis of primal-dual interior-point methods for semidefinite optimization based on a parametric kernel function with a trigonometric barrier term
- A path following interior-point algorithm for semidefinite optimization problem based on new kernel function
semidefinite optimizationprimal-dual interior point methodskernel functionscomplexity of algorithmslarge and small-update algorithms
Numerical mathematical programming methods (65K05) Convex programming (90C25) Interior-point methods (90C51) Semidefinite programming (90C22)
Cites Work
- Semidefinite Programming
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
- Title not available (Why is that?)
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- A new kind of simple kennel function yielding good iteration bounds for primal-dual interior-point methods
- A study of search directions in primal-dual interior-point methods for semidefinite programming
- Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions
- 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 primal‐dual interior-point method for linear optimization based on a new proximity function
- A new class of polynomial primal-dual methods for linear and semidefinite optimization
Cited In (10)
- Interior-point algorithm for semidefinite programming based on a logarithmic kernel function
- An interior-point algorithm for semidefinite least-squares problems.
- Complexity analysis of interior-point algorithm based on a new kernel function for semidefinite optimization
- Complexity analysis of primal-dual interior-point methods for semidefinite optimization based on a parametric kernel function with a trigonometric barrier term
- A Complexity Analysis for Interior-Point Algorithms Based on Karmarkar’s Potential Function
- A full-Newton step feasible interior-point algorithm for monotone horizontal linear complementarity problems
- An efficient hyperbolic kernel function yielding the best known iteration bounds for linear programming
- Complexity analysis of primal-dual interior-point methods for convex quadratic programming based on a new twice parameterized kernel function
- An interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new trigonometric kernel function with a double barrier term
- Complexity analysis and numerical implementation of large-update interior-point methods for SDLCP based on a new parametric barrier kernel function
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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2018886)
