An interior point method for quadratic programs based on conjugate projected gradients
type: Item
instance of: scholarly article
title: An interior point method for quadratic programs based on conjugate projected gradients
zbMATH Open document ID: 0778.90048
DOI: 10.1007/BF01299140
author: Tamra J. Carpenter
author: David F. Shanno
published in: Computational Optimization and Applications
publication date: 1993-08-30T00:00:00Z
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90-08
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 370410
zbMATH Keywords: interior point method
zbMATH Keywords: large-scale convex quadratic programming
zbMATH Keywords: conjugate projected gradient procedure
describes a project that uses: MINOS
describes a project that uses: GAMS
describes a project that uses: ALPO
MaRDI profile type: Publication
cites work: A variation on Karmarkar’s algorithm for solving linear programming problems
cites work: Separable Quadratic Programming via a Primal-Dual Interior Point Method and its Use in a Sequential Procedure
cites work: Truncated-Newton algorithms for large-scale unconstrained optimization
cites work: Q5583564
cites work: Q4226179
cites work: On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
cites work: Q4739659
cites work: An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming
cites work: Q5185900
cites work: Large Step Path-Following Methods for Linear Programming, Part I: Barrier Function Method
cites work: A new polynomial-time algorithm for linear programming
cites work: Q3688092
cites work: On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
cites work: Q3348699
cites work: Computational experience with a primal-dual interior point method for linear programming
cites work: An Implementation of a Primal-Dual 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. I: Linear programming
cites work: Interior path following primal-dual algorithms. II: Convex quadratic programming
cites work: Q3835293
cites work: The Mehrotra Predictor-Corrector Interior-Point Method As a Perturbed Composite Newton Method
cites work: ALPO: Another Linear Program Optimizer
cites work: Symmetric indefinite systems for interior point methods
cites work: A modification of Karmarkar's linear programming algorithm
cites work: An extension of Karmarkar's projective algorithm for convex quadratic programming
Recommended article: An interior point-proximal method of multipliers for convex quadratic programming
Recommended article: A New Practically Efficient Interior Point Method for Convex Quadratic Programming
Recommended article: Solving quadratically constrained convex optimization problems with an interior-point method
Recommended article: Q5320362
Recommended article: Q4848874
Recommended article: Q4311922
Recommended article: A primal-dual regularized interior-point method for convex quadratic programs
Recommended article: Interior proximal algorithm for quasiconvex programming problems and variational inequalities with linear constraints
Recommended article: An interior point algorithm for convex quadratic programming with strict equilibrium constraints
Recommended article: An interior point method for general large-scale quadratic programming problems
description: scientific article; zbMATH DE number 370410