A full-Newton step infeasible interior-point algorithm based on darvay directions for linear optimization

DOI10.1007/s10852-013-9227-7zbMath1291.90127OpenAlexW2009334985MaRDI QIDQ2016468

Yanyan Li

Publication date: 20 June 2014

Published in: Journal of Mathematical Modelling and Algorithms in Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10852-013-9227-7

zbMATH Keywords

polynomial complexityinfeasible interior-point methodsfull-Newton stepdarvay~search~directions

Mathematics Subject Classification ID

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

Related Items (6)

Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier ⋮ Complexity analysis of a full-{N}ewton step interior-point method for linear optimization ⋮ A New Search Direction for Full-Newton Step Interior-Point Method in P*(κ)-HLCP ⋮ An infeasible interior point method for the monotone SDLCP based on a transformation of the central path ⋮ A New Infeasible Interior-Point Method Based on a Non-Coercive Kernel Function with Improved Centering Steps for Second-Order Cone Optimization ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A polynomial interior-point algorithm for monotone linear complementarity problems
• A new primal-dual path-following method for convex quadratic programming
• A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step
• 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
• A new primal-dual path-following interior-point algorithm for semidefinite optimization
• A primal-dual infeasible-interior-point algorithm for linear programming
• Polynomiality of infeasible-interior-point algorithms for linear programming
• Self-regular functions and new search directions for linear and semidefinite optimization
• A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
• A Polynomial-time Interior-point Algorithm for Convex Quadratic Semidefinite Optimization
• 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
• Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities
• A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization

This page was built for publication: A full-Newton step infeasible interior-point algorithm based on darvay directions for linear optimization