Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
113
Lagrangean decomposition using an improved Nelder–Mead approach for Lagrangean multiplier update
, 2005
"... Lagrangean decomposition has been recognized as a promising approach for solving large-scale optimization problems. However, Lagrangean decomposition is critically dependent on the method of updating the Lagrangean multipliers used to decompose the original model. This paper presents a Lagrangean de ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
decomposition approach based on Nelder–Mead optimization algorithm to update the Lagrangean multipliers. The main advantage of the proposed approach is that it results in improved objective function values for the majority of iterations. The efficiency of the proposed approach is illustrated with examples from
Differential Evolution - A simple and efficient adaptive scheme for global optimization over continuous spaces
, 1995
"... A new heuristic approach for minimizing possibly nonlinear and non differentiable continuous space functions is presented. By means of an extensive testbed, which includes the De Jong functions, it will be demonstrated that the new method converges faster and with more certainty than Adaptive Simula ..."
Abstract
-
Cited by 427 (5 self)
- Add to MetaCart
Simulated Annealing as well as the Annealed Nelder&Mead approach, both of which have a reputation for being very powerful. The new method requires few control variables, is robust, easy to use and lends itself very well to parallel computation. ________________________________________ 1) International
The Nelder Mead Downhill Simplex Method
"... Error correcting codes prevent loss of integrity in data transmission. Low Density Parity Check codes are a family of codes that are specified by sparse matrices. Using the Nelder-Mead Downhill Simplex Evolution to design an irregular Low Density Parity Check code, we hope to improve upon the accura ..."
Abstract
- Add to MetaCart
Error correcting codes prevent loss of integrity in data transmission. Low Density Parity Check codes are a family of codes that are specified by sparse matrices. Using the Nelder-Mead Downhill Simplex Evolution to design an irregular Low Density Parity Check code, we hope to improve upon
Constrained globalized Nelder–Mead method for simultaneous structural and manufacturing optimization of a composite bracket
- J Compos Mater
"... ABSTRACT: The optimized design of composite structures is a difficult task. It requires optimizing simultaneously both structural and manufacturing objectives. The objectives do not have closed form solutions and have multiple local optima that calls for a global search. This paper improves the glob ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
the global search method called GBNM [1], which is based on several restarts of the Nelder–Mead method. Two issues are addressed here. First, the restart procedure is improved by using a one-dimensional probability function and a weighted selection procedure. Second, nonlinear constraints are included
5 Indian Iris Image Segmentation using Nelder-Mead Simplex Method
"... In this paper, we describe a new approach of employing Nelder-Mead optimization (NMO) simplex method in Iris image segmentation. In this paper we are using modified way of Libor masek method. In modified Libor masek method mainly in preprocessing phase in segmentation we are using Nelder-Mead search ..."
Abstract
- Add to MetaCart
In this paper, we describe a new approach of employing Nelder-Mead optimization (NMO) simplex method in Iris image segmentation. In this paper we are using modified way of Libor masek method. In modified Libor masek method mainly in preprocessing phase in segmentation we are using Nelder-Mead
Paper 65 Globalized Nelder-Mead Method for Engineering Optimization
"... One of the fundamental difficulties in engineering design is the multiplicity of local solutions. This has triggered great efforts to develop global search algorithms. Globality, however, often has a prohibitively high numerical cost for real problems. A fixed cost local search, which sequentially b ..."
Abstract
- Add to MetaCart
becomes global is developed. Globalization is achieved by probabilistic restart. A spacial probability of starting a local search is built based on past searches. An improved Nelder-Mead algorithm makes the local optimizer. It accounts for variable bounds. It is additionally made more robust
NELDER-MEAD METHOD WITH LOCAL SELECTION USING NEIGHBORHOOD AND MEMORY FOR STOCHASTIC OPTIMIZATION
"... We consider the Nelder-Mead (NM) simplex algorithm for optimization of discrete-event stochastic simulation models. We propose new modifications of NM to reduce computational time and to improve quality of the estimated optimal solutions. Our means include utilizing past information of already seen ..."
Abstract
- Add to MetaCart
We consider the Nelder-Mead (NM) simplex algorithm for optimization of discrete-event stochastic simulation models. We propose new modifications of NM to reduce computational time and to improve quality of the estimated optimal solutions. Our means include utilizing past information of already seen
FAST LONG-TERM MOTION ESTIMATION FOR HIGH DEFINITION VIDEO SEQUENCES BASED ON SPATIO-TEMPORAL TUBES AND USING THE NELDER-MEAD SIMPLEX ALGORITHM
, 2008
"... Multi-frame motion estimation is a new method incorporated into the video coding standard H.264/MPEG-4 Advanced Video Coding (AVC) to improve compression performances. Depending on content, the motion estimation can be short or long-term. For long-term motion estimation, the initial search point in ..."
Abstract
- Add to MetaCart
initial search point for the longterm motion estimation that follows. Then, the search is refined using the Nelder-Mead Simplex method. The global approach reduces computational cost and improves the accuracy of motion estimation.
Asl. A hybrid modified genetic-nelder mead simplex algorithm for large-scale truss optimization
- Int. J. Optim. Civil Eng
"... In this paper a hybrid algorithm based on exploration power of the Genetic algorithms and exploitation capability of Nelder Mead simplex is presented for global optimization of multi-variable functions. Some modifications are imposed on genetic algorithm to improve its capability and efficiency whil ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
In this paper a hybrid algorithm based on exploration power of the Genetic algorithms and exploitation capability of Nelder Mead simplex is presented for global optimization of multi-variable functions. Some modifications are imposed on genetic algorithm to improve its capability and efficiency
OPTIMAL SWITCHING CURVE FOR A MULTIPLE LINK WALKING ROBOT USING NELDER MEAD OPTIMIZATION
"... Over the past several years, legged mechanisms have shown remarkable progress towards practicality. The need now is for efficient means of controlling these mechanisms. In previous papers, we have found the optimal switching curve for controlling a simplified model of walking called the rimless whee ..."
Abstract
- Add to MetaCart
wheel model. In this paper, we again find the optimal switching curve for the rimless wheel using another approach--Nelder and Mead’s simplex algorithm, a technique for global optimization. We compare the results from Nelder Mead with those obtained from our previous research using Pontryagin’s Maximum
Results 1 - 10
of
113
