A PRIMAL-DUAL INTERIOR-POINT ALGORITHM BASED ON A NEW KERNEL FUNCTION

DOI10.1017/S1446181110000908zbMath1237.90154MaRDI QIDQ2996870

No author found.

Publication date: 4 May 2011

Published in: The ANZIAM Journal (Search for Journal in Brave)

zbMATH Keywords

complexitykernel functionpolynomial algorithmlinear optimization problemprimal-dual interior-point method

Mathematics Subject Classification ID

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

Related Items (3)

Kernel function based interior-point methods for horizontal linear complementarity problems ⋮ A generic interior-point algorithm for monotone symmetric cone linear complementarity problems based on a new kernel function ⋮ New parameterized kernel functions for linear optimization

Cites Work

• 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
• Exploring complexity of large update interior-point methods for \(P_*(\kappa )\) linear complementarity problem based on kernel function
• 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: A PRIMAL-DUAL INTERIOR-POINT ALGORITHM BASED ON A NEW KERNEL FUNCTION