A newton based distributed optimization method with local interactions for large-scale networked optimization problems

Author(s):  
Baisravan HomChaudhuri ◽  
Manish Kumar
2011 ◽  
Vol 48-49 ◽  
pp. 25-28
Author(s):  
Wei Jian Ren ◽  
Yuan Jun Qi ◽  
Wei Lv ◽  
Cheng Da Li

According to the phenomenon of falling into local optimum during solving large-scale optimization problems and the shortcomings of poor convergence of Immune Genetic Algorithm, a new kind of probability selection method based on the concentration for the genetic operation is presented. Considering the features of chaos optimization method, such like not requiring the solved problems with continuity or differentiability, which is unlike the conventional method, and also with a solving process within a certain range traverse in order to find the global optimal solution, a kind of Chaos Immune Genetic Algorithm based on Logistic map and Hénon map is proposed. Through the application to TSP problem, the results have showed the superior to other algorithms.


SPE Journal ◽  
2018 ◽  
Vol 23 (02) ◽  
pp. 467-481 ◽  
Author(s):  
Jianlin Fu ◽  
Xian-Huan Wen

Summary Model-based production optimization has become a promising technique in recent years for improving reservoir management and asset development in the petroleum industry. A variety of methods have been developed to address production-optimization problems. However, many solutions resulting from these methods are not ready to be accepted by (operations) engineers because they are difficult to understand and implement in practice. A typical example is the erratically oscillatory, bang-bang-type solution of well-control optimization problems. For this challenge, a regularized optimization problem is formulated in this work with two purposes: to create smooth solutions and to improve the convergence speed. Furthermore, the original, high-dimensional optimization problems can be reduced to low-dimensional ones by a principal-component-analysis (PCA) -based regularization method such that some population-based methods, including genetic algorithm (GA) and particle-swarm optimization (PSO), can be used as search engines to find optimal or improved solutions that tend to have less chance of trapping in local optima. Examples show that the methodology proposed can ensure a continuous transition over time between variables (e.g., well controls) such that the generated solution is more acceptable to the (operations) engineers. Moreover, it significantly speeds up the convergence of the optimization process, allowing large-scale problems to be addressed efficiently.


2004 ◽  
Vol 12 (2) ◽  
pp. 121-131 ◽  
Author(s):  
Caijun Xue ◽  
Hong Nie ◽  
Qingying Qiu ◽  
Peien Feng

It is difficult to solve design optimization problems of complex systems by using a traditional computing method because complex simulation processes usually lead to large-scale computation. Therefore the distributed computing technology based on decomposition-coordination theory has received much attention by design engineers. This paper studies a peer-to-peer collaborative optimization method based on distributed computing technology in order to examine flexible optimization. A new distributed collaborative optimization framework is proposed, and a coordination method is developed and used to deal with the conflict of related variables among sub-optimization problems. A multi-agent based distributed computing environment is implemented. The implementation of an optimization agent, in which CORBA technology is used to implement communication between the components of the optimization agent, is discussed in detail. Two examples are used to demonstrate the efficiency of the computing method and the reliability and flexibility of the multi-agent system.


1999 ◽  
Vol 121 (4) ◽  
pp. 492-501 ◽  
Author(s):  
F. B. Ouezdou ◽  
S. Re´gnier ◽  
C. Mavroidis

In this paper, the rigid body guidance problem of general 6 degree of freedom manipulators is studied. A new method, called Distributed Optimization Method (DOM), is used to determine the dimensional parameters of general manipulators that are able to reach a finite number of given six degree of freedom position and orientation tasks. It is shown that the global multi-variable optimization problem of kinematic synthesis can be solved as a sequence of local, one variable, optimization problems. The new method allows the possibility to include additional criteria in the manipulator kinematic synthesis such as joint limits, range of dimensional parameters, obstacles avoidance, isotropy and number of configurations to reach a specific end-effector task. Two examples are given to illustrate the validity of the method.


Author(s):  
Angelia Nedić ◽  
Ji Liu

Advances in wired and wireless technology have necessitated the development of theory, models, and tools to cope with the new challenges posed by large-scale control and optimization problems over networks. The classical optimization methodology works under the premise that all problem data are available to a central entity (a computing agent or node). However, this premise does not apply to large networked systems, where each agent (node) in the network typically has access only to its private local information and has only a local view of the network structure. This review surveys the development of such distributed computational models for time-varying networks. To emphasize the role of the network structure in these approaches, we focus on a simple direct primal (sub)gradient method, but we also provide an overview of other distributed methods for optimization in networks. Applications of the distributed optimization framework to the control of power systems, least squares solutions to linear equations, and model predictive control are also presented.


Author(s):  
Paul Cronin ◽  
Harry Woerde ◽  
Rob Vasbinder

1999 ◽  
Vol 9 (3) ◽  
pp. 755-778 ◽  
Author(s):  
Paul T. Boggs ◽  
Anthony J. Kearsley ◽  
Jon W. Tolle

Sign in / Sign up

Export Citation Format

Share Document