The complexity of self-regular proximity based infeasible IPMs
From MaRDI portal
Publication:2506182
DOI10.1007/s10589-005-3064-1zbMath1111.90074OpenAlexW2024962211MaRDI QIDQ2506182
Guoqing Zhang, Maziar Salahi, Tamás Terlaky
Publication date: 28 September 2006
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-005-3064-1
linear optimizationpolynomial complexityinfeasible interior point methodself-regular proximity function
Related Items
Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier, A new infeasible interior-point algorithm with full step for linear optimization based on a simple function, An entire space polynomial-time algorithm for linear programming, New complexity analysis of IIPMs for linear optimization based on a specific self-regular function, An infeasible interior-point algorithm with full-Newton step for linear optimization, On self-regular IPMs (with comments and rejoinder)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new polynomial-time algorithm for linear programming
- Feasibility issues in a primal-dual interior-point method for linear programming
- Computational experience with a primal-dual interior point method for linear programming
- Interior path following primal-dual algorithms. I: Linear programming
- Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming
- A primal-dual infeasible-interior-point algorithm for linear programming
- An infeasible-interior-point algorithm for linear complementarity problems
- Polynomiality of infeasible-interior-point algorithms for linear programming
- Interior point methods of mathematical programming
- A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points
- Self-regular functions and new search directions for linear and semidefinite optimization
- Basic lemmas in polynomial-time infeasible-interior-point methods for linear programs
- A superquadratic infeasible-interior-point method for linear complementarity problems
- An infeasible-interior-point potential-reduction algorithm for linear programming
- On the Implementation of a Primal-Dual Interior Point Method
- Solving large-scale linear programs by interior-point methods under the Matlab∗Environment†
- 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
- An Infeasible Path-Following Method for Monotone Complementarity Problems
- An Infeasible-Interior-Point Method for Linear Complementarity Problems
- A dynamic large-update primal‐dual interior-point method for linear optimization
- User'S guide To Lipsol linear-programming interior point solvers V0.4
