Multiple centrality corrections in a primal-dual method for linear programming

DOI10.1007/BF00249643zbMath0860.90084OpenAlexW2085548605MaRDI QIDQ1816400

Publication date: 26 November 1996

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

Full work available at URL: https://doi.org/10.1007/bf00249643

zbMATH Keywords

primal-dual interior point method higher-order method multiple centrality corrections

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items (62)

Numerical aspects in developing LP softwares, LPAKO and LPABO ⋮ Koopman operator method for solution of generalized aggregate data inverse problems ⋮ The practical behavior of the homogeneous self-dual formulations in interior point methods ⋮ On enforcing maximum principles and achieving element-wise species balance for advection-diffusion-reaction equations under the finite element method ⋮ Interior Point Methods Can Exploit Structure of Convex Piecewise Linear Functions with Application in Radiation Therapy ⋮ Detecting ``dense columns in interior point methods for linear programs ⋮ Using a hybrid preconditioner for solving large-scale linear systems arising from interior point methods ⋮ Using the primal-dual interior point algorithm within the branch-price-and-cut method ⋮ Trajectory-following methods for large-scale degenerate convex quadratic programming ⋮ An empirical evaluation of walk-and-round heuristics for mixed integer linear programs ⋮ A numerical framework for diffusion-controlled bimolecular-reactive systems to enforce maximum principles and the non-negative constraint ⋮ Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming ⋮ Interactive dynamic optimization server – connecting one modelling language with many solvers ⋮ A polynomial arc-search interior-point algorithm for linear programming ⋮ A new proposal to improve the early iterations in the interior point method ⋮ Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms ⋮ An interior-point implementation developed and tuned for radiation therapy treatment planning ⋮ Optimized choice of parameters in interior-point methods for linear programming ⋮ A step-truncated method in a wide neighborhood interior-point algorithm for linear programming ⋮ Recycling basic columns of the splitting preconditioner in interior point methods ⋮ Proximal stabilized interior point methods and \textit{low-frequency-update} preconditioning techniques ⋮ A polynomial arc-search interior-point algorithm for convex quadratic programming ⋮ Solving \( L_1\)-CTA in 3D tables by an interior-point method for primal block-angular problems ⋮ Interior point methods 25 years later ⋮ An \(O(\sqrt nL)\) iteration primal-dual second-order corrector algorithm for linear programming ⋮ A predictor-corrector algorithm with multiple corrections for convex quadratic programming ⋮ Efficient robust optimization for robust control with constraints ⋮ Implementation of an interior point method with basis preconditioning ⋮ Combining a hybrid preconditioner and a optimal adjustment algorithm to accelerate the convergence of interior point methods ⋮ A variation on the interior point method for linear programming using the continued iteration ⋮ Influence of matrix reordering on the performance of iterative methods for solving linear systems arising from interior point methods for linear programming ⋮ A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method ⋮ Parallel interior-point solver for structured quadratic programs: Application to financial planning problems ⋮ A warm-start approach for large-scale stochastic linear programs ⋮ Exploiting separability in large-scale linear support vector machine training ⋮ Application of a GPU-accelerated hybrid preconditioned conjugate gradient approach for large 3D problems in computational geomechanics ⋮ Identifying superfluous constraints within an interior-point algorithm for convex quadratic programming ⋮ A dynamic large-update primal‐dual interior-point method for linear optimization ⋮ Implementation of interior point methods for mixed semidefinite and second order cone optimization problems ⋮ An interior point-proximal method of multipliers for convex quadratic programming ⋮ Solving linear systems in interior-point methods ⋮ A subzone reconstruction algorithm for efficient staggered compatible remapping ⋮ Computational experience with a modified potential reduction algorithm for linear programming ⋮ Warmstarting for interior point methods applied to the long-term power planning problem ⋮ Matrix-free interior point method for compressed sensing problems ⋮ Some disadvantages of a Mehrotra-type primal-dual corrector interior point algorithm for linear programming ⋮ Exploiting hardware capabilities in interior point methods ⋮ Object Library of Algorithms for Dynamic Optimization Problems: Benchmarking SQP and Nonlinear Interior Point Methods ⋮ Design and implementation of a modular interior-point solver for linear optimization ⋮ Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension ⋮ Further development of multiple centrality correctors for interior point methods ⋮ The augmented system variant of IPMs in two-stage stochastic linear programming computation ⋮ Using an interior point method for the master problem in a decomposition approach ⋮ Quasi-Newton approaches to interior point methods for quadratic problems ⋮ Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning ⋮ High-performance sampling of generic determinantal point processes ⋮ Warm start of the primal-dual method applied in the cutting-plane scheme ⋮ Higher-order derivatives in linear and quadratic programming ⋮ Interior-point methods ⋮ An experimental investigation of a primal–dual exterior point simplexalgorithm ⋮ Material-separating regularizer for multi-energy x-ray tomography ⋮ A new efficient primal dual simplex algorithm

Uses Software

Cites Work

This page was built for publication: Multiple centrality corrections in a primal-dual method for linear programming