Primal-dual interior point methods for Semidefinite programming based on a new type of kernel functions

DOI10.2298/FIL2012957TzbMath1499.90148OpenAlexW3146742797MaRDI QIDQ5081279

Wided Chikouche, Imene Touil

Publication date: 14 June 2022

Published in: Filomat (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2298/fil2012957t

zbMATH Keywords

complexity analysisprimal-dual interior point methodslinear semidefinite programminglarge- and small-update methodshyperbolic-logarithmic kernel function

Mathematics Subject Classification ID

Semidefinite programming (90C22) Sensitivity, stability, parametric optimization (90C31) Interior-point methods (90C51)

Related Items (2)

A full-Newton step infeasible interior-point algorithm based on a kernel function with a new barrier term ⋮ Complexity of primal-dual interior-point algorithm for linear programming based on a new class of kernel functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a trigonometric barrier term
• A feasible primal-dual interior point method for linear semidefinite programming
• On complexity analysis of the primal-dual interior-point method for semidefinite optimization problem based on a new proximity function
• Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term
• Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term
• Complexity analysis of primal-dual interior-point methods for linear optimization based on a new parametric kernel function with a trigonometric barrier term
• Interior-point algorithm for linear optimization based on a new trigonometric kernel function
• A primal-dual interior-point method for semidefinite optimization based on a class of trigonometric barrier functions
• Self-regular functions and new search directions for linear and semidefinite optimization
• Novel kernel function with a hyperbolic barrier term to primal-dual interior point algorithm for SDP problems
• Complexity of interior-point methods for linear optimization based on a new trigonometric kernel function
• A new kernel function yielding the best known iteration bounds for primal-dual interior-point algorithms
• Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function
• On the Nesterov--Todd Direction in Semidefinite Programming
• A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier
• 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
• Complexity analysis of interior-point algorithm based on a new kernel function for semidefinite optimization
• Handbook of semidefinite programming. Theory, algorithms, and applications

This page was built for publication: Primal-dual interior point methods for Semidefinite programming based on a new type of kernel functions