A full-Newton step infeasible interior-point algorithm for linear programming based on a kernel function
From MaRDI portal
Publication:843962
DOI10.1007/s00245-009-9069-xzbMath1206.90084OpenAlexW2066936785MaRDI QIDQ843962
Zhongyi Liu, Wen-Yu Sun, Fang-Bao Tian
Publication date: 18 January 2010
Published in: Applied Mathematics and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00245-009-9069-x
Related Items (11)
A new infeasible interior-point algorithm with full step for linear optimization based on a simple function ⋮ Complexity analysis and numerical implementation of large-update interior-point methods for SDLCP based on a new parametric barrier kernel function ⋮ A full-Newton step infeasible interior-point algorithm for \(P_\ast (\kappa)\) linear complementarity problem ⋮ A full-Newton step infeasible interior-point algorithm based on a kernel function with a new barrier term ⋮ A full-Newton step infeasible interior-point method based on a trigonometric kernel function without centering steps ⋮ A new search direction for full-Newton step infeasible interior-point method in linear optimization ⋮ Complexity analysis of infeasible interior-point method for semidefinite optimization based on a new trigonometric kernel function ⋮ A FULL-NEWTON STEP INFEASIBLE INTERIOR-POINT METHOD FOR LINEAR OPTIMIZATION BASED ON AN EXPONENTIAL KERNEL FUNCTION ⋮ A full-Newton step infeasible interior-point method for linear optimization based on a trigonometric kernel function ⋮ An infeasible interior-point method for the $P*$-matrix linear complementarity problem based on a trigonometric kernel function with full-Newton step ⋮ A MODIFIED FULL-NEWTON STEP INFEASIBLE INTERIOR-POINT ALGORITHM FOR LINEAR OPTIMIZATION
Cites Work
- Unnamed Item
- Polynomiality of infeasible-interior-point algorithms for linear programming
- Self-regular functions and new search directions for linear and semidefinite optimization
- New complexity analysis of IIPMs for linear optimization based on a specific self-regular function
- An infeasible interior-point algorithm with full-Newton step for linear optimization
- 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
- SimplifiedO(nL) infeasible interior-point algorithm for linear optimization using full-Newton steps
- A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
This page was built for publication: A full-Newton step infeasible interior-point algorithm for linear programming based on a kernel function
