A modified infeasible-interior-point algorithm for linear optimization problems

DOI10.1007/S10957-015-0719-7MaRDI QIDQ493065zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

central pathinfeasible-interior-point methodfull-Newton stepperturbed problemssearch directions

Mathematics Subject Classification ID

Linear programming (90C05) Interior-point methods (90C51)

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

• scientific article; zbMATH DE number 1131479 (Why is no real title available?)
• A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
• A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems
• A full-Newton step interior-point algorithm based on modified Newton direction
• A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization
• A new polynomial-time algorithm for linear programming
• A primal-dual infeasible-interior-point algorithm for linear programming
• An Infeasible-Interior-Point Predictor-Corrector Algorithm for Linear Programming
• An adaptive infeasible interior-point algorithm with full-Newton step for linear optimization
• 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 the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
• Polynomiality of infeasible-interior-point algorithms for linear programming

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)