Crash start of interior point methods
type: Item
instance of: scholarly article
title: Crash start of interior point methods
zbMATH Open document ID: 1346.90813
author: Jacek Gondzio
published in: European Journal of Operational Research
publication date: 2016-10-07T00:00:00Z
full work available at URL: ipmCrashUofE.pdf
Mathematics Subject Classification ID: 90C51
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C20
zbMATH DE Number: 6636551
zbMATH Keywords: interior point methods
zbMATH Keywords: initial point
zbMATH Keywords: crash start
zbMATH Keywords: linear programming
zbMATH Keywords: quadratic programming
describes a project that uses: IPM
MaRDI profile type: Publication
OpenAlex ID: W2394807440
cites work: Inexact interior-point method
cites work: Implementing the Simplex Method: The Initial Basis
cites work: Using a hybrid preconditioner for solving large-scale linear systems arising from interior point methods
cites work: A Specialized Interior-Point Algorithm for Multicommodity Network Flows
cites work: On mutual impact of numerical linear algebra and large-scale optimization with focus on interior point methods
cites work: Inexact Newton Methods
cites work: Indefinitely preconditioned conjugate gradient method for large sparse equality and inequality constrained quadratic problems
cites work: Preconditioners for Indefinite Systems Arising in Optimization
cites work: Interior point methods 25 years later
cites work: Matrix-free interior point method
cites work: Convergence analysis of an inexact feasible interior point method for convex quadratic programming
cites work: Path-Following Methods for Linear Programming
cites work: New crash procedures for large systems of linear constraints
cites work: Towards a practical parallelisation of the simplex method
cites work: Q4940821
cites work: Strategies for Creating Advanced Bases for Large-Scale Linear Programming Problems
cites work: On the Implementation of a Primal-Dual Interior Point Method
cites work: A new class of preconditioners for large-scale linear systems from interior point methods for linear programming
cites work: Warmstarting the homogeneous and self-dual interior point method for linear and conic quadratic problems
cites work: Q5691079
cites work: An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
DOI: 10.1016/J.EJOR.2016.05.030
description: scientific article; zbMATH DE number 6636551