A polynomial-time algorithm for linear optimization based on a new simple kernel function
From MaRDI portal
Publication:4650623
DOI10.1080/10556780310001639735zbMath1097.90031OpenAlexW2011694001MaRDI QIDQ4650623
Publication date: 18 February 2005
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556780310001639735
interior-point methodprimal-dual methodlinear optimizationpolynomial complexitylarge- and small-update method
Related Items (22)
A primal-dual interior-point algorithm for symmetric optimization based on a new kernel function with trigonometric barrier term yielding the best known iteration bounds ⋮ Interior-point methods based on kernel functions for symmetric optimization ⋮ A class of new large-update primal-dual interior-point algorithms for \(P_\ast(\kappa)\) nonlinear complementarity problems ⋮ Kernel-function-based primal-dual interior-point methods for convex quadratic optimization over symmetric cone ⋮ A kernel function based interior-point methods for solving \(P_{*}(\kappa )\)-linear complementarity problem ⋮ A large-update feasible interior-point algorithm for convex quadratic semi-definite optimization based on a new 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 ⋮ A Numerical Implementation of an Interior Point Methods for Linear Programming Based on a New Kernel Function ⋮ A new kind of simple kennel function yielding good iteration bounds for primal-dual interior-point methods ⋮ A unified kernel function approach to primal-dual interior-point algorithms for convex quadratic SDO ⋮ Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones ⋮ A PRIMAL-DUAL INTERIOR-POINT ALGORITHM BASED ON A NEW KERNEL FUNCTION ⋮ Primal-dual interior-point algorithms for second-order cone optimization based on a new parametric kernel function ⋮ Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term ⋮ An interior-point algorithm for linear optimization based on a new barrier function ⋮ An efficient parameterized logarithmic kernel function for linear optimization ⋮ Exploring complexity of large update interior-point methods for \(P_*(\kappa )\) linear complementarity problem based on kernel function ⋮ Primal-dual interior-point algorithms with dynamic step-size based on kernel functions for linear programming ⋮ A class of large-update and small-update primal-dual interior-point algorithms for linear optimization ⋮ Analysis of complexity of primal-dual interior-point algorithms based on a new kernel function for linear optimization ⋮ A class of path-following interior-point methods for \(P_*(\kappa)\)-horizontal linear complementarity problems
Cites Work
This page was built for publication: A polynomial-time algorithm for linear optimization based on a new simple kernel function
