An interior point method for linear programming based on a class of Kernel functions

DOI10.1017/S0004972700038090zbMath1070.90131MaRDI QIDQ4654260

Keyvan Amini, M. Reza Peyghami

Publication date: 3 March 2005

Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

complexitylinear programminginterior point methodskernel functions

Mathematics Subject Classification ID

Linear programming (90C05) Interior-point methods (90C51)

Related Items

A full-Newton step infeasible interior-point algorithm for linear programming based on a kernel function ⋮ A kernel function based interior-point methods for solving \(P_{*}(\kappa )\)-linear complementarity problem ⋮ Complexity of primal-dual interior-point algorithm for linear programming based on a new class of kernel functions ⋮ AN INTERIOR POINT APPROACH FOR SEMIDEFINITE OPTIMIZATION USING NEW PROXIMITY FUNCTIONS

Cites Work

• A new polynomial-time algorithm for linear programming
• A new class of polynomial primal-dual methods for linear and semidefinite optimization
• Self-regular functions and new search directions for linear and semidefinite optimization
• A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An interior point method for linear programming based on a class of Kernel functions