An infeasible interior-point algorithm with full-Newton step for linear optimization

DOI10.1007/s11075-007-9135-xzbMath1133.65033OpenAlexW1965802713MaRDI QIDQ2464638

Zhongyi Liu, Wen-Yu Sun

Publication date: 17 December 2007

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11075-007-9135-x

zbMATH Keywords

linear optimizationpolynomial complexityinfeasible interior-point methodprimal-dual

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Interior-point methods (90C51)

Related Items (10)

A full step infeasible interior-point method for Cartesian \(P_{*}(\kappa)\)-SCLCP ⋮ A FULL NT-STEP INFEASIBLE INTERIOR-POINT ALGORITHM FOR SEMIDEFINITE OPTIMIZATION BASED ON A SELF-REGULAR PROXIMITY ⋮ A full-Newton step infeasible interior-point algorithm for linear programming based on a kernel function ⋮ A full-Newton step infeasible interior-point algorithm based on a kernel function with a new barrier term ⋮ Simplified infeasible interior-point algorithm for SDO using full Nesterov-Todd step ⋮ A full-NT-step infeasible interior-point algorithm for SDP based on kernel functions ⋮ A unified kernel function approach to primal-dual interior-point algorithms for convex quadratic SDO ⋮ A predictor-corrector algorithm with multiple corrections for convex quadratic programming ⋮ A new class of infeasible interior-point algorithm for linear complementarity problem ⋮ A predictor-corrector algorithm for \(P_{\ast}(\kappa)\)-linear complementarity problems based on a specific self-regular proximity function

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new primal-dual path-following method for convex quadratic programming
• Polynomiality of infeasible-interior-point algorithms for linear programming
• A new class of polynomial primal-dual methods for linear and semidefinite optimization
• A lower bound on the number of iterations of long-step primal-dual linear programming algorithms
• Optimization theory and methods. Nonlinear programming
• The complexity of self-regular proximity based infeasible IPMs
• 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
• New complexity analysis of the primal-dual Newton method for linear optimization

This page was built for publication: An infeasible interior-point algorithm with full-Newton step for linear optimization