Projection methods for non-linear programming
From MaRDI portal
Cites work
- Computational experience with quadratically convergent minimisation methods
- scientific article; zbMATH DE number 3518193 (Why is no real title available?)
- scientific article; zbMATH DE number 3307153 (Why is no real title available?)
- scientific article; zbMATH DE number 3309655 (Why is no real title available?)
- scientific article; zbMATH DE number 3340762 (Why is no real title available?)
- scientific article; zbMATH DE number 3402374 (Why is no real title available?)
- The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
- Variable Metric Method for Minimization
- Variational methods for the solution of problems of equilibrium and vibrations
Cited in
(8)- Variable metric methods for linearly constrained nonlinear minimax approximation
- A class of quadratically convergent algorithms for constrained function minimization
- Minimization methods with constraints
- Comparison of generalized geometric programming algorithms
- A review of techniques for automated structural design
- Optimal measurement policies for control purposes
- Large-scale linearly constrained optimization
- A computational study of active set strategies in nonlinear programming with linear constraints
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)