Simplified infeasible interior-point algorithm for linear optimization based on a simple function
From MaRDI portal
Publication:2294231
DOI10.1016/j.orl.2018.08.009zbMath1476.90351OpenAlexW2890311227MaRDI QIDQ2294231
Hongmei Bi, Hong-Wei Liu, Wei-wei Wang
Publication date: 10 February 2020
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2018.08.009
Cites Work
- Infeasible interior-point methods for linear optimization based on large neighborhood
- A full-Newton step interior-point algorithm based on modified Newton direction
- A full-NT-step infeasible interior-point algorithm for SDP based on kernel functions
- A new polynomial-time algorithm for linear programming
- Feasibility issues in a primal-dual interior-point method for linear programming
- Improved full-Newton step \(O(nL)\) infeasible interior-point method for linear optimization
- On quadratic convergence of the \(O(\sqrt nL)\)-iteration homogeneous and self-dual linear programming algorithm
- A primal-dual infeasible-interior-point algorithm for linear programming
- Polynomiality of infeasible-interior-point algorithms for linear programming
- A full-Newton step interior-point algorithm for linear optimization based on a finite barrier
- New complexity analysis of IIPMs for linear optimization based on a specific self-regular function
- A new infeasible interior-point algorithm with full step for linear optimization based on a simple function
- An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
- On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
- A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Simplified infeasible interior-point algorithm for linear optimization based on a simple function
