A modified infeasible-interior-point algorithm for linear optimization problems
From MaRDI portal
Publication:493065
DOI10.1007/S10957-015-0719-7zbMATH Open1329.90082OpenAlexW2002366599MaRDI QIDQ493065FDOQ493065
Authors: Yong-Cai Geng, Sumit K. Garg 
Publication date: 11 September 2015
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-015-0719-7
Recommendations
- An improved infeasible interior-point method with full-Newton step for linear optimization
- Improved full-Newton step \(O(nL)\) infeasible interior-point method for linear optimization
- An infeasible interior-point algorithm with full-Newton step for linear optimization
- SimplifiedO(nL) infeasible interior-point algorithm for linear optimization using full-Newton steps
- An improved and simplified full-Newton step \(O(n)\) infeasible interior-point method for linear optimization
Cites Work
- A new polynomial-time algorithm for linear programming
- A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
- On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
- A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems
- Feasibility issues in a primal-dual interior-point method for linear programming
- Title not available (Why is that?)
- A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization
- Polynomiality of infeasible-interior-point algorithms for linear programming
- An Infeasible-Interior-Point Predictor-Corrector Algorithm for Linear Programming
- A primal-dual infeasible-interior-point algorithm for linear programming
- Improved full-Newton step \(O(nL)\) infeasible interior-point method for linear optimization
- An adaptive infeasible interior-point algorithm with full-Newton step for linear optimization
- A full-Newton step interior-point algorithm based on modified Newton direction
Cited In (7)
- A modified infeasible interior-point algorithm with full-Newton step for semidefinite optimization
- An infeasible interior-point algorithm for linear optimization over Cartesian symmetric cones
- An improved and simplified full-Newton step \(O(n)\) infeasible interior-point method for linear optimization
- A full NT-step infeasible interior-point algorithm for semidefinite optimization
- A modified infeasible interior-point algorithm for \(P_\ast(\kappa)\)-HLCP over symmetric cones
- An improved infeasible interior-point method with full-Newton step for linear optimization
- A full-Newton step interior-point algorithm for linear optimization based on a finite barrier
This page was built for publication: A modified infeasible-interior-point algorithm for linear optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q493065)
