An efficient parameterized logarithmic kernel function for semidefinite optimization

DOI10.1007/s10255-020-0955-yzbMath1466.90066OpenAlexW3082995987MaRDI QIDQ2023749

Louiza Derbal, Zakia Kebbiche

Publication date: 3 May 2021

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

Full work available at URL: https://doi.org/10.1007/s10255-020-0955-y

zbMATH Keywords

interior-point algorithmskernel functionsemidefinite optimizationcomplexity boundprimal-dual methods

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• 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
• Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term
• A new kind of simple kennel function yielding good iteration bounds for primal-dual interior-point methods
• Complexity analysis of an interior-point algorithm for linear optimization based on a new proximity function
• A class of large-update and small-update primal-dual interior-point algorithms for linear optimization
• Symmetric primal-dual path-following algorithms for semidefinite programming
• Aspects of semidefinite programming. Interior point algorithms and selected applications
• Self-regular functions and new search directions for linear and semidefinite optimization
• A large-update interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function
• Complexity of interior-point methods for linear optimization based on a new trigonometric kernel function
• Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function
• Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
• A class of polynomial primal-dual interior-point algorithms for semidefinite optimization
• A new proximity function generating the best known iteration bounds for both large-update and small-update interior-point methods
• On the Nesterov--Todd Direction in Semidefinite Programming
• On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
• A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier
• 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
• Full Nesterov–Todd step feasible interior-point method for the CartesianP_*(κ)-SCLCP
• Theoretical and Numerical Result for Linear Optimization Problem Based on a New Kernel Function
• Handbook of semidefinite programming. Theory, algorithms, and applications

This page was built for publication: An efficient parameterized logarithmic kernel function for semidefinite optimization