A feasible descent cone method for linearly constrained minimization problems
From MaRDI portal
Publication:1336880
DOI10.1016/0898-1221(94)00150-2zbMath0808.90091OpenAlexW2081019490WikidataQ127389579 ScholiaQ127389579MaRDI QIDQ1336880
Publication date: 6 November 1994
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0898-1221(94)00150-2
Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- A new polynomial-time algorithm for linear programming
- An interior feasible direction method with constraint projections for linear programming
- A polynomial method of approximate centers for linear programming
- A feasible descent cone method for linearly constrained minimization problems
- Global convergence of Rosen's gradient projection method
- A convergence theorem of Rosen’s gradient projection method
- The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
- A new first‐order interior feasible direction method for structural optimization
- The Convex Simplex Method
- Extension of Davidon’s Variable Metric Method to Maximization Under Linear Inequality and Equality Constraints
- The Gradient Projection Method for Nonlinear Programming. Part II. Nonlinear Constraints
This page was built for publication: A feasible descent cone method for linearly constrained minimization problems
