A full-Newton step interior-point algorithm based on modified Newton direction

DOI10.1016/j.orl.2011.06.006zbMath1235.90083OpenAlexW2029804256MaRDI QIDQ408387

Yinghong Xu, Lipu Zhang

Publication date: 5 April 2012

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2011.06.006

zbMATH Keywords

complexity analysiscentral pathinterior-point algorithmfull-Newton step

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05) Interior-point methods (90C51)

Related Items (19)

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 ⋮ A new conjugate gradient hard thresholding pursuit algorithm for sparse signal recovery ⋮ Interior-point algorithm for linear programming based on a new descent direction ⋮ A full-Newton step interior-point algorithm for linear optimization based on a finite barrier ⋮ 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 ⋮ New complexity analysis of a full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-LCP ⋮ An adaptive updating full-Newton step interior-point algorithm with modified Newton direction ⋮ A full-Newton step feasible weighted primal-dual interior point algorithm for monotone LCP ⋮ New method for determining search directions for interior-point algorithms in linear optimization ⋮ A predictor-corrector algorithm for linear optimization based on a modified Newton direction ⋮ 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 new full-Newton step interior-point method for \(P_*(\kappa)\)-LCP based on a positive-asymptotic kernel function ⋮ An improved and modified infeasible interior-point method for symmetric optimization ⋮ Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique ⋮ A full-modified-Newton step \(O(n)\) infeasible interior-point method for the special weighted linear complementarity problem ⋮ A MODIFIED FULL-NEWTON STEP INFEASIBLE INTERIOR-POINT ALGORITHM FOR LINEAR OPTIMIZATION

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier
• A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
• New complexity analysis of the primal-dual Newton method for linear optimization

This page was built for publication: A full-Newton step interior-point algorithm based on modified Newton direction