The restoration of constraints in holonomic and nonholonomic problems
From MaRDI portal
Publication:2532025
DOI10.1007/BF00931372zbMath0172.13001WikidataQ113108489 ScholiaQ113108489MaRDI QIDQ2532025
J. C. Heideman, J. N. Damoulakis, Angelo Miele
Publication date: 1969
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Related Items (8)
Sequential conjugate gradient-restoration algorithm for optimal control problems. I: Theory ⋮ Recent advances in gradient algorithms for optimal control problems ⋮ Minimization methods with constraints ⋮ Sequential gradient-restoration algorithm for the minimization of constrained functions. Ordinary and conjugate gradient versions ⋮ General technique for solving nonlinear, two-point boundary-value problems via the method of particular solutions ⋮ Sequential gradient-restoration algorithm for optimal control problems ⋮ Modifications and extensions of the conjugate gradient-restoration algorithm for mathematical programming problems ⋮ Modifications and extensions of the conjugate gradient-restoration algorithm for mathematical programming problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Method of particular solutions for linear, two-point boundary-value problems
- Use of the method of particular solutions in nonlinear, two-point boundary-value problems
- Gradient Theory of Optimal Flight Paths
- A Steepest-Ascent Method for Solving Optimum Programming Problems
- Variational Approach to the Gradient Method: Theory and Numerical Experiments
- The Gradient Projection Method for Nonlinear Programming. Part II. Nonlinear Constraints
This page was built for publication: The restoration of constraints in holonomic and nonholonomic problems