A polynomial-time algorithm for linear optimization based on a new class of kernel functions
From MaRDI portal
Publication:1002187
DOI10.1016/J.CAM.2008.05.027zbMATH Open1162.65031OpenAlexW2095236018MaRDI QIDQ1002187FDOQ1002187
Authors: M. El Ghami, I. D. Ivanov, J. B. M. Melissen, C. Roos, Trond Steihaug 
Publication date: 25 February 2009
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.2008.05.027
Recommendations
- A class of large-update and small-update primal-dual interior-point algorithms for linear optimization
- A PRIMAL-DUAL INTERIOR-POINT ALGORITHM BASED ON A NEW KERNEL FUNCTION
- A polynomial-time algorithm for linear optimization based on a new simple kernel function
- Analysis of complexity of primal-dual interior-point algorithms based on a new kernel function for linear optimization
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
polynomial complexitykernel functionlinear optimizationpolynomial algorithmslarge-update methodsmall-update methodprimal-dual interior-point algorithm
Numerical mathematical programming methods (65K05) Linear programming (90C05) Interior-point methods (90C51)
Cites Work
- On the Implementation of a Primal-Dual Interior Point Method
- Title not available (Why is that?)
- A new polynomial-time algorithm for linear programming
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Interior path following primal-dual algorithms. I: Linear programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- Linear programming. Foundations and extensions
- Path-Following Methods for Linear Programming
- Title not available (Why is that?)
- A primal‐dual interior-point method for linear optimization based on a new proximity function
- Title not available (Why is that?)
Cited In (32)
- On extending primal-dual interior-point method for linear optimization to convex quadratic symmetric cone optimization
- Complexity of interior point methods for a class of linear complementarity problems using a kernel function with trigonometric growth term
- Polynomial interior-point algorithms for \(P_*(\kappa )\) horizontal linear complementarity problem
- Interior-point algorithms for LO and SDO 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
- A generic kernel function for interior point methods
- An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a finite exponential-trigonometric barrier term
- An Efficient Algorithm for Computing Kernel Function Defined with Anti-unification
- New complexity analysis of interior-point methods for the Cartesian \(P_\ast ({\kappa})\)-SCLCP
- Complexity analysis of interior-point methods for linear optimization based on some conditions on kernel 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
- A new parameterized logarithmic kernel function for linear optimization with a double barrier term yielding the best known iteration bound
- An interior-point algorithm for linear optimization based on a new barrier function
- Title not available (Why is that?)
- A polynomial-time algorithm for linear optimization based on a new simple kernel function
- A PRIMAL-DUAL INTERIOR-POINT ALGORITHM BASED ON A NEW KERNEL FUNCTION
- An infeasible interior-point algorithm with full-Newton steps for \(P_*(\kappa)\) horizontal linear complementarity problems based on a kernel function
- The accuracy of interior-point methods based on kernel functions
- An interior point method for \(P_*(\kappa)\)-horizontal linear complementarity problem based on a new proximity function
- Title not available (Why is that?)
- A wide neighborhood interior-point algorithm for linear optimization based on a specific kernel function
- A polynomial interior-point algorithm with improved iteration bounds for linear optimization
- A new parameterized kernel function for LO yielding the best known iteration bound for a large-update interior point algorithm
- Complexity analysis and numerical implementation of primal-dual interior-point methods for convex quadratic optimization based on a finite barrier
- An efficient hyperbolic kernel function yielding the best known iteration bounds for linear programming
- Complexity analysis of interior point methods for linear programming based on a parameterized kernel function
- Complexity analysis of primal-dual interior-point methods for convex quadratic programming based on a new twice parameterized kernel function
- A class of large-update and small-update primal-dual interior-point algorithms for linear optimization
- Interior-point methods for symmetric optimization based on a class of non-coercive kernel functions
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
- Complexity of primal-dual interior-point algorithm for linear programming based on a new class of kernel functions
Uses Software
This page was built for publication: A polynomial-time algorithm for linear optimization based on a new class of kernel functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1002187)
