Projection methods for non-linear programming
From MaRDI portal
Publication:4060749
DOI10.1007/BF01584669zbMath0304.90097OpenAlexW2008668325MaRDI QIDQ4060749
R. W. H. Sargent, Bruce A. Murtagh
Publication date: 1973
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01584669
Related Items (8)
A class of quadratically convergent algorithms for constrained function minimization ⋮ Optimal measurement policies for control purposes ⋮ Minimization methods with constraints ⋮ Comparison of generalized geometric programming algorithms ⋮ Large-scale linearly constrained optimization ⋮ A review of techniques for automated structural design ⋮ A computational study of active set strategies in nonlinear programming with linear constraints ⋮ Variable metric methods for linearly constrained nonlinear minimax approximation
Cites Work
- The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
- Variable Metric Method for Minimization
- Computational experience with quadratically convergent minimisation methods
- Variational methods for the solution of problems of equilibrium and vibrations
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Projection methods for non-linear programming