Showing papers on "Multi-swarm optimization published in 1979"
46 citations
TL;DR: A discrete variable form of the machine parameter optimization problem is presented and it is shown how this model can be optimized expediently using a dynamic programming rationale.
Abstract: This paper presents a discrete variable form of the machine parameter optimization problem and shows how this model can be optimized expediently using a dynamic programming rationale. An example problem is given to illustrate the results of optimization using this approach.
27 citations
01 Jan 1979
TL;DR: This book, as a source that may involve the facts, opinion, literature, religion, and many others are the great friends to join with.
Abstract: New updated! The latest book from a very famous author finally comes out. Book of optimization of design and computation of control networks, as an amazing reference becomes what you need to get. What's for is this book? Are you still thinking for what the book is? Well, this is what you probably will get. You should have made proper choices for your better life. Book, as a source that may involve the facts, opinion, literature, religion, and many others are the great friends to join with.
15 citations
TL;DR: In this article, a discrete dynamic optimization approach for problems with a fixed initial and final state is proposed, which is based on the Nicholsok concept of Nicholsok and is shown to achieve an essential reduction of the storage requirement compared to the conventional dynamic optimization.
Abstract: This paper deals with the application of discrete dynamic optimization to problems with a fixed initial and final state. The basic concept of Nicholsok demands an interpretation of the problem like an N-stage decision process with monotonous separability, unique stage transformation and unique inverse stage transformation. The solution of this problem follows with simultaneous optimization in two directions- once in the process direction and otherwise in the opposite direction. The proposed algorithm was an automatic selection rule for the direction of the following optimization stet) in order to realize the minimum of the number of all states to be considered with the presented concept. With it, an essential reduction of the storage requirement compared to the conventional dynamic optimization is given.
2 citations
01 Jan 1979
TL;DR: A new worst case design procedure is described that employs Powell's new constrained optimization procedure and is at least superlinearly convergent.
Abstract: A new worst case design procedure is described. This method employs Powell's new constrained optimization procedure and is at least superlinearly convergent. A novel function splitting scheme is described to avoid singularity problems inherent in some previously reported methods.
1 citations