An eligible primal-dual interior-point method for linear optimization

DOI10.7858/EAMJ.2013.019MaRDI QIDQ5747057zbMATH OpenOpenAlexFDO

Authors

Publication date 11 February 2014

Published in East Asian mathematical journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.7858/eamj.2013.019

zbMATH Keywords

complexitykernel functionpolynomial algorithmlinear optimizationprimal-dual interior point method

Mathematics Subject Classification ID

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

Recommendations

• An eligible kernel based primal-dual interior-point method for linear optimization
• A PRIMAL-DUAL INTERIOR-POINT ALGORITHM BASED ON A NEW KERNEL FUNCTION
• Primal-dual interior-point algorithm for LO based on a new kernel function
• Generic Primal-dual Interior Point Methods Based on a New Kernel Function
• Analysis of complexity of primal-dual interior-point algorithms based on a new kernel function for linear optimization

Cited in

(8)

• An adaptive-step primal-dual interior point algorithm for linear optimization
• Primal-dual interior-point algorithm for LO based on a new kernel function
• An Efficient Primal-Dual Interior-Point Method for Minimizing a Sum of Euclidean Norms
• scientific article; zbMATH DE number 7266921 (Why is no real title available?)
• A primal-dual augmented Lagrangian penalty-interior-point filter line search algorithm
• An eligible kernel based primal-dual interior-point method for linear optimization
• Generic Primal-dual Interior Point Methods Based on a New Kernel Function
• Computational experience with a primal-dual interior point method for linear programming

This page was built for publication: An eligible primal-dual interior-point method for linear optimization

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