Implementation of an interior point method with basis preconditioning

No abstract is available for this paper.

• Publication year

  2020

• Venue

  Mathematical Programming Computation

• Publication date

  2020-02-24

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/s12532-020-00181-8
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Basis preconditioning in interior point methods

  2019cited by this paper
• Maintaining a Basis Matrix in the Linear Programming Interior Point Method

  2017influential reference
• Permuting Spiked Matrices to Triangular Form and its Application to the Forrest-Tomlin Update

  2017cited by this paper
• Estimating the Largest Elements of a Matrix

  2016cited by this paper
• Preconditioning Linear Least-Squares Problems by Identifying a Basis Matrix

  2015cited by this paper
• CG Versus MINRES: An Empirical Comparison

  2012cited by this paper
• How to find a good submatrix

  2010cited by this paper
• Dantzig-Wolfe and block coordinate-descent decomposition in large-scale integrated refinery-planning

  2009cited by this paper
• Preconditioning indefinite systems in interior point methods for large scale linear optimisation

  2008cited by this paper
• A new class of preconditioners for large-scale linear systems from interior point methods for linear programming

  2005cited by this paper
• Optimization

  2005cited by this paper
• Hyper-Sparsity in the Revised Simplex Method and How to Exploit it

  2005cited by this paper
• Iterative methods for sparse linear systems

  2003cited by this paper
• On the existence and computation of rank-revealing LU factorizations

  2000cited by this paper
• MIP: Theory and Practice - Closing the Gap

  1999cited by this paper
• Primal-Dual Interior-Point Methods

  1997cited by this paper
• Multiple centrality corrections in a primal-dual method for linear programming

  1996cited by this paper
• Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming

  1995cited by this paper
• Recovering an optimal LP basis from an interior point solution

  1994cited by this paper
• On the Implementation of a Primal-Dual Interior Point Method

  1992cited by this paper
• On Finding Primal- and Dual-Optimal Bases

  1991cited by this paper
• Semi-optimal bases for linear dependencies

  1985cited by this paper
• On Algorithms for Obtaining a Maximum Transversal

  1981cited by this paper
• Solution of Sparse Indefinite Systems of Linear Equations

  1975cited by this paper
• Pivot selection methods of the Devex LP code

  1973cited by this paper
• The Conjugate Residual Method for Constrained Minimization Problems

  1970cited by this paper
• An Experimental Comparison of Techniques for the Assignment of Facilities to Locations

  1968cited by this paper
• Methods of conjugate gradients for solving linear systems

  1952cited by this paper

• Adaptive reduced order modelling of acoustic LTI systems with input–output dead time

  2026cites this paper
• Exploiting block triangular submatrices in KKT systems

  2026cites this paper
• A Linear Programming Approach to Backtracking for Single-Axis Trackers on Rolling Terrain

  2026influential citation
• Randomized Nyström Preconditioned Interior Point-Proximal Method of Multipliers

  2026cites this paper
• Interior point methods in the year 2025

  2025cites this paper
• Adaptive Reduced Order Modelling of Discrete-Time Systems with Input-Output Dead Time

  2025cites this paper
• A factorisation-based regularised interior point method using the augmented system

  2025influential citation
• Variant Predictor-Corrector Method for Linear Predictive Control Using Modified Uzawa Algorithm

  2024cites this paper
• Using Parallel Branch-and-Bound Method to Accelerate Solving Mixed Integer Linear Programming

  2024cites this paper
• Smart Initial Basis Selection for Linear Programs

  2023cites this paper
• Recycling basic columns of the splitting preconditioner in interior point methods

  2023cites this paper
• On the Convergence of Inexact Predictor-Corrector Methods for Linear Programming

  2022influential citation
• From an Interior Point to a Corner Point: Smart Crossover

  2021cites this paper
• Preconditioners for Krylov subspace methods: An overview

  2020cites this paper
• Basis preconditioning in interior point methods

  2019cites this paper
• An Asymptotically Superlinearly Convergent Semismooth Newton Augmented Lagrangian Method for Linear Programming

  2019cites this paper