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

DOI10.1051/RO:2008009MaRDI QIDQ3539807zbMATH OpenOpenAlexFDO

Authors M. El Ghami, C. 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, http://resolver.tudelft.nl/uuid:ad6fd841-d17d-4d5c-bb6d-1b12438e2868

zbMATH Keywords

large and small-update methodlinear optimizationprimal-dual interior-point algorithm

Mathematics Subject Classification ID

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

Recommendations

• A primal‐dual interior-point method for linear optimization based on a new proximity function
• A PRIMAL-DUAL INTERIOR-POINT ALGORITHM BASED ON A NEW KERNEL FUNCTION
• Analysis of complexity of primal-dual interior-point algorithms based on a new kernel function for linear optimization
• Primal-dual interior-point algorithm for LO based on a new kernel function
• An eligible primal-dual interior-point method for linear optimization

Cites work

• A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
• A new and efficient large-update interior-point method for linear optimization
• A new class of polynomial primal-dual methods for linear and semidefinite optimization
• A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier
• A primal‐dual interior-point method for linear optimization based on a new proximity function
• scientific article; zbMATH DE number 3972641 (Why is no real title available?)
• scientific article; zbMATH DE number 590363 (Why is no real title available?)
• scientific article; zbMATH DE number 1017028 (Why is no real title available?)
• scientific article; zbMATH DE number 1047679 (Why is no real title available?)
• scientific article; zbMATH DE number 1131479 (Why is no real title available?)
• scientific article; zbMATH DE number 4119923 (Why is no real title available?)
• scientific article; zbMATH DE number 1862745 (Why is no real title available?)
• Interior path following primal-dual algorithms. I: Linear programming
• Path-Following Methods for Linear Programming
• Self-regular functions and new search directions for linear and semidefinite optimization

Cited in

(25)

• The accuracy of interior-point methods based on kernel functions
• A generic kernel function for interior point methods
• 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
• An interior-point method for P_*()-linear complementarity problem based on a trigonometric kernel function
• A class of path-following interior-point methods for \(P_*(\kappa)\)-horizontal linear complementarity problems
• Kernel-function-based primal-dual interior-point methods for convex quadratic optimization over symmetric cone
• An eligible kernel based primal-dual interior-point method for linear optimization
• Complexity analysis of interior point methods for linear programming based on a parameterized kernel function
• A PRIMAL-DUAL INTERIOR-POINT ALGORITHM BASED ON A NEW KERNEL FUNCTION
• A new proximity function generating the best known iteration bounds for both large-update and small-update interior-point methods
• Interior point methods for self-dual linear optimization problems based on kernel functions
• Kernel-function Based Algorithms for Semidefinite Optimization
• Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term
• A primal‐dual interior-point method for linear optimization based on a new proximity function
• A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
• An interior point method for linear programming based on a class of Kernel functions
• An interior point algorithm for solving linear optimization problems using a new trigonometric kernel function
• A numerical implementation of an interior point methods for linear programming based on a new kernel function
• An eligible primal-dual interior-point method for linear optimization
• Complexity of primal-dual interior-point algorithm for linear programming based on a new class of kernel functions
• A new kind of simple kennel function yielding good iteration bounds for primal-dual interior-point methods
• An efficient hyperbolic kernel function yielding the best known iteration bounds for linear programming
• 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

This page was built for publication: Generic Primal-dual Interior Point Methods Based on a New Kernel Function

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3539807)