LOQO:an interior point code for quadratic programming
type: Item
instance of: scholarly article
title: LOQO:an interior point code for quadratic programming
zbMATH Open document ID: 0973.90518
DOI: 10.1080/10556789908805759
author: Robert J. Vanderbei
publication date: 2001-12-09T00:00:00Z
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 65Y15
zbMATH DE Number: 1506386
zbMATH Keywords: software
zbMATH Keywords: package
zbMATH Keywords: linear and quadratic programming
zbMATH Keywords: convex and general nonlinear
zbMATH Keywords: prograsnming
describes a project that uses: NETLIB LP Test Set
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1080/10556789908805759
OpenAlex ID: W2069426496
cites work: Optimizing over three-dimensional subspaces in an interior-point method for linear programming
cites work: CUTE
cites work: Solving symmetric indefinite systems in an interior-point method for linear programming
cites work: The Evolution of the Minimum Degree Ordering Algorithm
cites work: Primal-dual methods for linear programming
cites work: Preconditioners for Indefinite Systems Arising in Optimization
cites work: A primal-dual infeasible-interior-point algorithm for linear programming
cites work: Feasibility issues in a primal-dual interior-point method for linear programming
cites work: Computational experience with a primal-dual interior point method for linear programming
cites work: On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
cites work: On the Implementation of a Primal-Dual Interior Point Method
cites work: Interior path following primal-dual algorithms. II: Convex quadratic programming
cites work: On superlinear convergence of infeasible interior-point algorithms for linearly constrained convex programs
cites work: Q3321331
cites work: A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points
cites work: Computing projections for the Karmarkar algorithm
cites work: Affine-scaling for linear programs with free variables
cites work: Symmetric Quasidefinite Matrices
cites work: Symmetric indefinite systems for interior point methods
cites work: An interior-point algorithm for nonconvex nonlinear programming
cites work: An infeasible-interior-point algorithm for linear complementarity problems
cites work: Q5691079
cites work: On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
published in: Optimization Methods \& Software
description: scientific article; zbMATH DE number 1506386