Polynomial-time interior-point algorithm based on a local self-concordant finite barrier function

DOI10.1007/s11741-009-0416-1zbMath1212.90302OpenAlexW1480029324MaRDI QIDQ3051677

Zhengjing Jin, Yan-Qin Bai

Publication date: 5 November 2010

Published in: Journal of Shanghai University (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11741-009-0416-1

zbMATH Keywords

interior-point methodslinear optimizationpolynomial-time complexityfinite barrierself-concordant function

Mathematics Subject Classification ID

Convex programming (90C25) Interior-point methods (90C51)

Related Items (1)

An entire space polynomial-time algorithm for linear programming

Cites Work

• Introductory lectures on convex optimization. A basic course.
• 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
• A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
• Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities
• Unnamed Item
• Unnamed Item

This page was built for publication: Polynomial-time interior-point algorithm based on a local self-concordant finite barrier function