An interior-point algorithm for linear optimization based on a new barrier function

DOI10.1016/j.amc.2011.05.075zbMath1226.65053OpenAlexW2154587717MaRDI QIDQ720625

Gyeong-Mi Cho

Publication date: 11 October 2011

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2011.05.075

zbMATH Keywords

complexitykernel functionpolynomial algorithmlinear optimizationprimal-dual interior point method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Related Items (4)

An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a trigonometric barrier term ⋮ Kernel-function-based primal-dual interior-point methods for convex quadratic optimization over symmetric cone ⋮ 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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• A polynomial-time algorithm for linear optimization based on a new class of kernel functions
• Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions
• A class of large-update and small-update primal-dual interior-point algorithms for linear optimization
• Self-regular functions and new search directions for linear and semidefinite optimization
• A new proximity function generating the best known iteration bounds for both large-update and small-update interior-point methods
• Generic Primal-dual Interior Point Methods Based on a New Kernel Function
• Path-Following Methods for Linear Programming
• A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier
• A polynomial-time algorithm for linear optimization based on a new simple kernel function
• A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization

This page was built for publication: An interior-point algorithm for linear optimization based on a new barrier function