Projection methods for non-linear programming
From MaRDI portal
Publication:4060749
DOI10.1007/BF01584669zbMATH Open0304.90097OpenAlexW2008668325MaRDI QIDQ4060749FDOQ4060749
Authors: 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
Cites Work
- The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
- Variable Metric Method for Minimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Variational methods for the solution of problems of equilibrium and vibrations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computational experience with quadratically convergent minimisation methods
Cited In (8)
- A computational study of active set strategies in nonlinear programming with linear constraints
- Large-scale linearly constrained optimization
- Minimization methods with constraints
- Comparison of generalized geometric programming algorithms
- A class of quadratically convergent algorithms for constrained function minimization
- Variable metric methods for linearly constrained nonlinear minimax approximation
- Optimal measurement policies for control purposes
- A review of techniques for automated structural design
This page was built for publication: Projection methods for non-linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4060749)