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

DOI10.1007/S11741-009-0416-1zbMATH Open1212.90302OpenAlexW1480029324MaRDI QIDQ3051677FDOQ3051677

Zhengjing Jin, Yanqin 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

Recommendations

• A full-Newton step polynomial-time algorithm based on a local self-concordant barrier function for linear optimization
• Improving complexity of structured convex optimization problems using self-concordant barriers
• Some results of convex programming complexity
• scientific article
• A sufficient condition for self-concordance, with application to some classes of structured convex programming problems

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Introductory lectures on convex optimization. A basic course.
• Self-regular functions and new search directions for linear and semidefinite optimization
• Title not available (Why is that?)
• 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

Cited In (5)

• Convergence analysis of a regularized interior point algorithm for the barrier problems with singular solutions
• Log-Barrier Interior Point Methods Are Not Strongly Polynomial
• Improving complexity of structured convex optimization problems using self-concordant barriers
• An entire space polynomial-time algorithm for linear programming
• A full-Newton step polynomial-time algorithm based on a local self-concordant barrier function for linear optimization

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

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