Improved full-Newton step \(O(nL)\) infeasible interior-point method for linear optimization

DOI10.1007/s10957-009-9634-0zbMath1205.90194OpenAlexW2118960201MaRDI QIDQ987511

J. Martínez

Publication date: 13 August 2010

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-009-9634-0

zbMATH Keywords

homotopy methodlinear optimizationinfeasible interior point methodfull Newton step

Mathematics Subject Classification ID

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

Related Items (15)

A modified infeasible interior-point algorithm with full-Newton step for semidefinite optimization ⋮ A new infeasible interior-point algorithm with full step for linear optimization based on a simple function ⋮ Infeasible interior-point methods for linear optimization based on large neighborhood ⋮ A new complexity analysis for full-Newton step infeasible interior-point algorithm for horizontal linear complementarity problems ⋮ Improved complexity analysis of full Nesterov-Todd step feasible interior-point method for symmetric optimization ⋮ A modified infeasible-interior-point algorithm for linear optimization problems ⋮ Simplified analysis for full-Newton step infeasible interior-point algorithm for semidefinite programming ⋮ A full-Newton step infeasible interior-point algorithm based on darvay directions for linear optimization ⋮ Adaptive full newton-step infeasible interior-point method for sufficient horizontal LCP ⋮ A full-modified-Newton step infeasible interior-point algorithm for linear optimization ⋮ Simplified infeasible interior-point algorithm for linear optimization based on a simple function ⋮ A full-Newton step infeasible interior-point method for the special weighted linear complementarity problem ⋮ A full-modified-Newton step \(O(n)\) infeasible interior-point method for the special weighted linear complementarity problem ⋮ Improved complexity analysis of full Nesterov-Todd step interior-point methods for semidefinite optimization ⋮ A MODIFIED FULL-NEWTON STEP INFEASIBLE INTERIOR-POINT ALGORITHM FOR LINEAR OPTIMIZATION

Cites Work

• Unnamed Item
• Feasibility issues in a primal-dual interior-point method for linear programming
• A primal-dual infeasible-interior-point algorithm for linear programming
• Polynomiality of infeasible-interior-point algorithms for linear programming
• Predictor-corrector algorithm for solving \(P_ *(\kappa)\)-matrix LCP from arbitrary positive starting points
• On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
• A Large-Step Infeasible-Interior-Point Method for the P*-Matrix LCP
• An Infeasible-Interior-Point Predictor-Corrector Algorithm for Linear Programming
• SimplifiedO(nL) infeasible interior-point algorithm for linear optimization using full-Newton steps
• A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization

This page was built for publication: Improved full-Newton step \(O(nL)\) infeasible interior-point method for linear optimization