A feasible primal-dual interior point method for linear semidefinite programming

DOI10.1016/j.cam.2016.05.008zbMath1355.90061OpenAlexW2402955565MaRDI QIDQ329782

Djamel Benterki, Adnan Yassine, Imene Touil

Publication date: 21 October 2016

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2016.05.008

zbMATH Keywords

primal-dual interior point methodscentral trajectory methodslinear semidefinite programming

Mathematics Subject Classification ID

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

Related Items (8)

Primal-dual interior point methods for Semidefinite programming based on a new type of kernel functions ⋮ A logarithmic barrier interior-point method based on majorant functions for second-order cone programming ⋮ A primal-dual interior-point method based on various selections of displacement step for symmetric optimization ⋮ Complexity of primal-dual interior-point algorithm for linear programming based on a new class of kernel functions ⋮ Logarithmic barrier method via minorant function for linear semidefinite programming ⋮ Unnamed Item ⋮ A unified complexity analysis of interior point methods for semidefinite problems based on trigonometric kernel functions ⋮ Novel kernel function with a hyperbolic barrier term to primal-dual interior point algorithm for SDP problems

Cites Work

• Unnamed Item
• Unnamed Item
• Some structural properties of a Newton-type method for semidefinite programs
• Bounds for eigenvalues using traces
• A note on the existence of the Alizadeh-Haeberly-Overton direction for semidefinite programming
• Some New Search Directions for Primal-Dual Interior Point Methods in Semidefinite Programming
• Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
• A Family of Polynomial Affine Scaling Algorithms for Positive SemiDefinite Linear Complementarity Problems
• A logarithm barrier method for semi-definite programming
• A primal interior point method for the linear semidefinite programming problem
• Matrix Analysis
• On the Nesterov--Todd Direction in Semidefinite Programming
• Polynomial Convergence of Primal-Dual Algorithms for Semidefinite Programming Based on the Monteiro and Zhang Family of Directions
• On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
• A numerical feasible interior point method for linear semidefinite programs
• Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
• Quadratic Convergence of a Nonsmooth Newton-Type Method for Semidefinite Programs Without Strict Complementarity
• Handbook of semidefinite programming. Theory, algorithms, and applications

This page was built for publication: A feasible primal-dual interior point method for linear semidefinite programming