New complexity analysis of the primal-dual Newton method for linear optimization

DOI10.1023/A:1019280614748MaRDI QIDQ5933827zbMATH OpenOpenAlexFDO

Authors Jiming Peng, C. Roos, Tamás Terlaky

Publication date 14 June 2001

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1019280614748

zbMATH Keywords

interior-point methodlinear optimizationpolynomial complexityprimal-dual methodproximity measure

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1489801
• A new class of polynomial primal-dual methods for linear and semidefinite optimization
• A primal‐dual interior-point method for linear optimization based on a new proximity function
• A new and efficient large-update interior-point method for linear optimization
• A dynamic large-update primal‐dual interior-point method for linear optimization

Cited in

(25)

• Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions
• A full Nesterov-Todd-step feasible primal-dual interior point algorithm for convex quadratic semi-definite optimization
• A new class of polynomial primal-dual methods for linear and semidefinite optimization
• A large-update interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function
• Primal-dual Newton method with steepest descent for the linear semidefinite programming problem: Newton's system of equations
• A new primal-dual interior-point method for semidefinite optimization based on a parameterized kernel function
• A full-Newton step feasible weighted primal-dual interior point algorithm for monotone LCP
• An infeasible interior-point algorithm with full-Newton step for linear optimization
• A new feasible interior-point algorithm with full step for linear optimization based on a simple function
• A full-step interior-point algorithm for linear complementarity problem based on a simple function
• Complexity analysis and numerical implementation of large-update interior-point methods for SDLCP based on a new parametric barrier kernel function
• Interior Point Methods for Nonlinear Optimization
• A full-Newton step interior-point algorithm based on modified Newton direction
• scientific article; zbMATH DE number 1489801 (Why is no real title available?)
• Interior-point methods for Cartesian \(P_{\ast}(\kappa)\)-linear complementarity problems over symmetric cones based on the eligible kernel functions
• A primal-dual interior-point method based on a new kernel function for linear complementarity problem
• A full-step interior-point algorithm for second-order cone optimization based on a simple locally kernel function
• An easy way to teach interior-point methods.
• Convergence of the primal-dual Newton method for linear programming problems
• New complexity analysis of the primal-dual method for semidefinite optimization based on the Nesterov-Todd direction
• A new kind of simple kennel function yielding good iteration bounds for primal-dual interior-point methods
• A unified kernel function approach to primal-dual interior-point algorithms for convex quadratic SDO
• Comprehensive analysis of kernel-based interior-point methods for the P_*()-LCP
• Complexity analysis and numerical implementation of a full-Newton step interior-point algorithm for LCCO
• On central-path proximity measures in interior-point methods

This page was built for publication: New complexity analysis of the primal-dual Newton method for linear optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5933827)