A feasible descent cone method for linearly constrained minimization problems
type: Item
instance of: scholarly article
title: A feasible descent cone method for linearly constrained minimization problems
zbMATH Open document ID: 0808.90091
DOI: 10.1016/0898-1221(94)00150-2
author: V. Pereyra
publication date: 1994-11-06T00:00:00Z
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90-08
zbMATH DE Number: 681871
zbMATH Keywords: feasible directions minimization
zbMATH Keywords: feasible descent cone algorithm
MaRDI profile type: Publication
full work available at URL: 0898-1221(94)00150-2
OpenAlex ID: W2081019490
cites work: The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
cites work: The Gradient Projection Method for Nonlinear Programming. Part II. Nonlinear Constraints
cites work: Extension of Davidon’s Variable Metric Method to Maximization Under Linear Inequality and Equality Constraints
cites work: A convergence theorem of Rosen’s gradient projection method
cites work: Global convergence of Rosen's gradient projection method
cites work: An interior feasible direction method with constraint projections for linear programming
cites work: A new first‐order interior feasible direction method for structural optimization
cites work: Q3844775
cites work: The Convex Simplex Method
cites work: A new polynomial-time algorithm for linear programming
cites work: A polynomial method of approximate centers for linear programming
cites work: Q3134873
Wikidata QID: Q127389579
published in: Computers & Mathematics with Applications
description: scientific article; zbMATH DE number 681871