Computing Methods in Optimization Problems (PDF)

Computing Methods in Optimization Problems deals with hybrid computing methods and optimization techniques using computers. One paper discusses different numerical approaches to optimizing trajectories, including the gradient method, the second variation method, and a generalized Newton-Raphson method. The paper cites the advantages and disadvantages of each method, and compares the second variation method (a direct method) with the generalized Newton-Raphson method (an indirect method). An example problem illustrates the application of the three methods in minimizing the transfer time of a low-thrust ion rocket between the orbits of Earth and Mars. Another paper discusses an iterative process for steepest-ascent optimization of orbit transfer trajectories to minimize storage requirements such as in reduced memory space utilized in guidance computers. By eliminating state variable storage and control schedule storage, the investigator can achieve reduced memory requirements. Other papers discuss dynamic programming, invariant imbedding, quasilinearization, Hilbert space, and the computational aspects of a time-optimal control problem. The collection is suitable for computer programmers, engineers, designers of industrial processes, and researchers involved in aviation or control systems technology.