An adaptive-step primal-dual interior point algorithm for linear optimization
type: Item
instance of: scholarly article
title: An adaptive-step primal-dual interior point algorithm for linear optimization
zbMATH Open document ID: 1239.90072
published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods
publication date: 2012-06-09T00:00:00Z
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C51
zbMATH DE Number: 6044659
zbMATH Keywords: adaptive-step
zbMATH Keywords: primal-dual interior point method
zbMATH Keywords: large-update
zbMATH Keywords: kernel function
zbMATH Keywords: polynomial algorithm
zbMATH Keywords: worst-case complexity
zbMATH Keywords: linear optimization problem
MaRDI profile type: Publication
full work available at URL: j.na.2009.05.021
OpenAlex ID: W2077264651
cites work: A new polynomial-time algorithm for linear programming
cites work: Primal-dual target-following algorithms for linear programming
cites work: Q5691079
cites work: Q4382667
cites work: Q3491304
cites work: Q4206561
cites work: Q4791754
cites work: A dynamic large-update primal‐dual interior-point method for linear optimization
cites work: An adaptive self-regular proximity-based large-update IPM for LO
cites work: A self-adjusting primal–dual interior point method for linear programs
cites work: Q4347846
cites work: A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
cites work: On the Implementation of a Primal-Dual Interior Point Method
DOI: 10.1016/J.NA.2009.05.021
author: Min Kyung Kim
author: Yong-Hoon Lee
author: Gyeong-Mi Cho
description: scientific article; zbMATH DE number 6044659