A Steepest-Ascent Method for Solving Optimum Programming Problems

DOI10.1115/1.3640537zbMath0112.20003OpenAlexW1996647346MaRDI QIDQ3850805

Publication date: 1962

Published in: Journal of Applied Mechanics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1115/1.3640537

zbMATH Keywords

fluid mechanics

Related Items (51)

Classification of temporal trajectories by continuous-time recurrent nets ⋮ Optimal control of systems with state-dependent time delay† ⋮ Estimation of system parameters; with unknown inputs using steepest descent technique† ⋮ Computational and approximate methods of optimal control ⋮ Multi-objective optimization of electrochemical discharge machining processes: a posteriori approach based on bird mating optimizer ⋮ An Efficient and Robust Scalar Auxialiary Variable Based Algorithm for Discrete Gradient Systems Arising from Optimizations ⋮ A sweeping gradient method for ordinary differential equations with events ⋮ A computational method for optimal structural design. I. Piecewise uniform structures ⋮ Invariance, adjoints, and the necessary conditions for an extremum † ⋮ Optimization of the reachable set of a linear system with respect to another set ⋮ A generalized sensitivity approach to feedback systems in Hilbert space ⋮ The projection operator applied to gradient methods for solving optimal control problems with terminal state constraints ⋮ New optimal control synthesis techniques for distributed systems ⋮ A numerical method for solving optimal control problems with unspecified terminal time† ⋮ Panel flutter optimization by gradient projection ⋮ Shifted Legendre direct method for variational problems ⋮ Laguerre series direct method for variational problems ⋮ Haar wavelet direct method for solving variational problems. ⋮ Active rocket trajectory arcs: a review ⋮ The quasidifferential descent method in a control problem with nonsmooth objective functional ⋮ A gradient method for neutral systems ⋮ Stochastic finite-state systems in control theory ⋮ Dynamics of Learning in MLP: Natural Gradient and Singularity Revisited ⋮ Unnamed Item ⋮ Recent advances in gradient algorithms for optimal control problems ⋮ A steepest-descent method for optimization of mechanical systems ⋮ Unnamed Item ⋮ Steepest-descent failure analysis ⋮ A case study for constrained learning neural root finders ⋮ An approach to reducing the high-speed memory requirement of dynamic programming ⋮ Comparison of several numerical optimization methods ⋮ Successive approximation method in optimum distributed-parameter systems ⋮ The restoration of constraints in holonomic and nonholonomic problems ⋮ Second-variation methods in dynamic optimization ⋮ Axisymmetric bodies of minimum drag in hypersonic flow ⋮ The successive sweep method and dynamic programming ⋮ Sequential gradient-restoration algorithm for optimal control problems ⋮ Modified quasilinearization and optimal initial choice of the multipliers. II: Optimal control problems ⋮ Numerical computational methods of optimisation in control ⋮ Sequential gradient-restoration algorithm for optimal control problems with nondifferential constraints ⋮ Trajectory optimization for maneuvering satellites ⋮ An optimal linear feedback guidance scheme ⋮ Interplanetary patched-conic approximation with an intermediary swing-by maneuver with the Moon ⋮ Fighter evasive boundaries against missiles ⋮ Successive approximation methods for the solution of optimal control problems ⋮ Calculation method for dynamic optimization, using quadratic approximations to the minimum surface ⋮ A survey of some recent results in linear multivariable feedback theory ⋮ Minimum-time speed optimisation over a fixed path ⋮ Optimization of stochastic jump diffusion systems nonlinear in the control ⋮ Shifted Chebyshev direct method for solving variational problems ⋮ A predictive Min-H method to improve convergence to optimal solutions

This page was built for publication: A Steepest-Ascent Method for Solving Optimum Programming Problems