A new parameterized kernel function for LO yielding the best known iteration bound for a large-update interior point algorithm

DOI10.1007/S13370-015-0363-2MaRDI QIDQ1689710zbMATH OpenOpenAlexFDO

Authors Mohamed Achache

Publication date 17 January 2018

Published in Afrika Matematika (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s13370-015-0363-2

zbMATH Keywords

proximitykernel functioncomplexity analysislinear optimizationlarge-update primal-dual algorithm

Mathematics Subject Classification ID

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

Recommendations

• A new parameterized logarithmic kernel function for linear optimization with a double barrier term yielding the best known iteration bound
• Primal-dual interior-point algorithm for LO based on a new kernel function
• A PRIMAL-DUAL INTERIOR-POINT ALGORITHM BASED ON A NEW KERNEL FUNCTION
• A new kernel function yielding the best known iteration bounds for primal-dual interior-point algorithms
• An interior-point algorithm for linear optimization based on a new kernel function

Cites work

• scientific article; zbMATH DE number 1017028 (Why is no real title available?)
• scientific article; zbMATH DE number 1862745 (Why is no real title available?)
• A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
• A new kernel function yielding the best known iteration bounds for primal-dual interior-point algorithms
• A new primal-dual interior-point algorithm for convex quadratic optimization
• A new proximity function generating the best known iteration bounds for both large-update and small-update interior-point methods
• A polynomial-time algorithm for linear optimization based on a new class of kernel functions
• Self-regular functions and new search directions for linear and semidefinite optimization

Cited in

(6)

• A new parameterized logarithmic kernel function for linear optimization with a double barrier term yielding the best known iteration bound
• An interior-point algorithm for semidefinite least-squares problems.
• Theoretical and Numerical Result for Linear Optimization Problem Based on a New Kernel Function
• A new parametric kernel function yielding the best known iteration bounds of interior-point methods for the Cartesian \(P_\ast( \kappa)\)-SCLCP
• Complexity analysis and numerical implementation of large-update interior-point methods for SDLCP based on a new parametric barrier kernel function
• An efficient hyperbolic kernel function yielding the best known iteration bounds for linear programming

This page was built for publication: A new parameterized kernel function for LO yielding the best known iteration bound for a large-update interior point algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1689710)