Generic Primal-dual Interior Point Methods Based on a New Kernel Function

DOI10.1051/ro:2008009zbMath1211.90117OpenAlexW2131995325MaRDI QIDQ3539807

M. El Ghami, Cornelis Roos

Publication date: 19 November 2008

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/105396

zbMATH Keywords

linear optimizationprimal-dual interior-point algorithmlarge and small-update method

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05)

Related Items

Kernel-function-based primal-dual interior-point methods for convex quadratic optimization over symmetric cone, An interior point algorithm for solving linear optimization problems using a new trigonometric kernel function, The accuracy of interior-point methods based on kernel functions, Complexity analysis of interior point methods for linear programming based on a parameterized kernel function, Complexity of primal-dual interior-point algorithm for linear programming based on a new class of kernel functions, A Numerical Implementation of an Interior Point Methods for Linear Programming Based on a New Kernel Function, Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term, A PRIMAL-DUAL INTERIOR-POINT ALGORITHM BASED ON A NEW KERNEL FUNCTION, Complexity of interior-point methods for linear optimization based on a new trigonometric kernel function, An interior-point algorithm for linear optimization based on a new barrier function, Complexity analysis of an interior-point algorithm for linear optimization based on a new proximity function, Kernel-function Based Algorithms for Semidefinite Optimization, An interior-point method for \(P_*(\kappa)\)-linear complementarity problem based on a trigonometric kernel function, A class of path-following interior-point methods for \(P_*(\kappa)\)-horizontal linear complementarity problems

Cites Work

• Interior path following primal-dual algorithms. I: Linear programming
• 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
• Path-Following Methods for Linear Programming
• A primal‐dual interior-point method for linear optimization based on a new proximity function
• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item