A full-modified-Newton step infeasible interior-point algorithm for linear optimization
From MaRDI portal
Publication:2515270
DOI10.3934/jimo.2016.12.103zbMath1394.90423OpenAlexW2313656068MaRDI QIDQ2515270
Lipu Zhang, Jing Zhang, Yinghong Xu
Publication date: 31 July 2015
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2016.12.103
linear optimizationcomplexity analysisfull-Newton stepinfeasible interior-point algorithmmodified-Newton-direction
Related Items (2)
The new full-Newton step interior-point algorithm for the Fisher market equilibrium problems based on a kernel function ⋮ A full-modified-Newton step \(O(n)\) infeasible interior-point method for the special weighted linear complementarity problem
Cites Work
- Unnamed Item
- A full-Newton step interior-point algorithm based on modified Newton direction
- Improved full-Newton step \(O(nL)\) infeasible interior-point method for linear optimization
- A new infeasible interior-point algorithm with full step for linear optimization based on a simple function
- An Improved and Simplified Full-Newton Step $O(n)$ Infeasible Interior-Point Method for Linear Optimization
- An adaptive infeasible interior-point algorithm with full-Newton step for linear optimization
- SimplifiedO(nL) infeasible interior-point algorithm for linear optimization using full-Newton steps
- A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
This page was built for publication: A full-modified-Newton step infeasible interior-point algorithm for linear optimization