Optimized choice of parameters in interior-point methods for linear programming

DOI10.1007/s10589-019-00079-9zbMath1414.90218OpenAlexW2919731206WikidataQ128306733 ScholiaQ128306733MaRDI QIDQ2419556

Luiz-Rafael Santos, Clovis Perin, Fernando R. Villas-Bôas, Aurelio Ribeiro Leite Oliveira

Publication date: 13 June 2019

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

Full work available at URL: https://doi.org/10.1007/s10589-019-00079-9

zbMATH Keywords

linear programminginfeasible interior point methodsoptimized choice of parameters

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Newton-type methods (49M15) Linear programming (90C05) Interior-point methods (90C51)

Related Items (1)

Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming

Uses Software

• PCx

Cites Work

• Unnamed Item
• Unnamed Item
• Interior point methods 25 years later
• Further development of multiple centrality correctors for interior point methods
• A primal-dual infeasible-interior-point algorithm for linear programming
• Superlinear convergence of infeasible-interior-point methods for linear programming
• An infeasible-interior-point algorithm for linear complementarity problems
• Multiple centrality corrections in a primal-dual method for linear programming
• Postponing the choice of penalty parameter and step length
• On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms
• A superquadratic infeasible-interior-point method for linear complementarity problems
• Global Optimization with Polynomials and the Problem of Moments
• A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
• On the Implementation of a Primal-Dual Interior Point Method
• On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
• PCx: an interior-point code for linear programming
• Convergence Conditions and Krylov Subspace--Based Corrections for Primal-Dual Interior-Point Method

This page was built for publication: Optimized choice of parameters in interior-point methods for linear programming