检索结果-内蒙古大学图书馆

3rd World Congress of Global Optimization (WCGO)

作者： Liu, Qunfeng Zhang, Jianxiong Chen, Fen Dongguan Univ Technol Dongguan Peoples R China

ISBN: (纸本)9783319083773;9783319083766

direct is a popular deterministic algorithm for global optimization problems. It can find the basins of attraction for global or local optima efficiently, especially when dimension is small. Recently, we have proposed a class of modified direct algorithms to eliminate the sensitivities of the original direct to linear scaling of the objective function. In this paper, we devote to find a specific algorithm with best performance among this class. We compare the performance of the modified direct algorithms on the GKLS test set. Numerical results show that direct-median performs outstanding among this class. What is more, numerical results also show that direct-median can find solutions with high accuracy much more efficiently than the original direct.

关键词： Global optimization direct algorithm Linear scaled objective function

来源：评论

学校读者我要写书评

暂无评论

A Computational Study on Different Penalty Functions with direct algorithm

A Computational Study on Different Penalty Functions with DI...

引用

13th International Conference on Computational Science and Its Applications (ICCSA)

作者： Rocha, Ana Maria A. C. Vilaca, Rita Univ Minho Sch Engn Dept Prod & Syst P-4710057 Braga Portugal Univ Minho Algoritmi R&D Ctr P-4710057 Braga Portugal

ISBN: (纸本)9783642396373

The most common approach for solving constrained optimization problems is based on penalty functions, where the constrained problem is transformed into an unconstrained problem by penalizing the objective function when constraints are violated. In this paper, we analyze the implementation of penalty functions, within the direct algorithm. In order to assess the applicability and performance of the proposed approaches, some benchmark problems from engineering design optimization are considered.

关键词： Global optimization constrained optimization direct algorithm penalty function.

来源：评论

学校读者我要写书评

暂无评论

LFM Signal Parameters Estimation using an Improved direct algorithm 4

LFM Signal Parameters Estimation using an Improved DIRECT Al...

引用

4th IEEE International Conference on Information Science and Technology (ICIST)

作者： Ding, Dan Cheng, Naiping Acad Equipment Dept Opt & Elect Equipment Beijing Peoples R China

ISBN: (纸本)9781479948086

In the paper, the widely used numerical optimization method for linear frequency modulated (LFM) signal parameters estimation is modified. To this purpose, an improved Dividing RECTangles (direct) algorithm is proposed to substitute for the commonly used grid search method. The proposed global optimization algorithm can provide initial estimates for local optimization algorithms such as Newton and Simplex. Based on classical direct algorithm, the improved version, called Lipschitz constant assisted direct (L-direct) algorithm, eliminates hopeless areas, suspends unlikely areas, and concentrates on more promising areas in search space, finding the range of attraction (ROA) with lower SNR threshold or less computational burden for local optimization algorithms. The effect of the modification is validated by simulation results.

关键词： Linear frequency modulated signal direct algorithm Global optimization Local optimization

来源：评论

学校读者我要写书评

暂无评论

Linear scaling and the direct algorithm

Linear scaling and the DIRECT algorithm

引用

Global Optimization Workshops (GOWs)

作者： Liu, Qunfeng Dongguan Univ Technol Sch Comp Dongguan 523808 Peoples R China

In this paper, we discuss the performance of the direct global optimization algorithm on problems with linear scaling. We show with computations that the performance of direct can be affected by linear scaling of the objective function. We also provide a theoretical result which shows that direct does not perform well when the absolute value of the objective function is large enough. Then we present direct-a, a modification of direct, to eliminate the sensitivity to linear scaling of the objective function. We prove theoretically that linear scaling of the objective function does not affect the performance of direct-a. Similarly, we prove that some modifications of direct are also unaffected by linear scaling of the objective function, while the original direct algorithm is sensitive to linear scaling. Numerical results in this paper show that direct-a is more robust than the original direct algorithm, which support the theoretical results. Numerical results also show that careful choices of the parameter epsilon can help direct perform well when the objective function is poorly linearly scaled.

关键词： direct algorithm Global optimization Linear scaling

来源：评论

学校读者我要写书评

暂无评论

Application of modified direct algorithm for multi-objective optimization of air bearings

Application of modified direct algorithm for multi-objective...

引用

Society of Tribologists and Lubrication Engineers Annual Meeting and Exhibition 2009

作者： Wang, Nenzi Chang, Shih-Hung Cha, Kuo-Chiang Chang Gung University

来源：评论

学校读者我要写书评

暂无评论

Dynamic data structures for a direct search algorithm

引用

COMPUTATIONAL OPTIMIZATION AND APPLICATIONS 2002年第1期23卷 5-25页

作者： He, J Watson, LT Ramakrishnan, N Shaffer, CA Verstak, A Jiang, J Bae, K Tranter, WH Virginia Polytech Inst & State Univ Dept Comp Sci Blacksburg VA 24061 USA Virginia Polytech Inst & State Univ Dept Math Blacksburg VA 24061 USA Virginia Polytech Inst & State Univ Bradley Dept Elect & Comp Engn Blacksburg VA 24061 USA

The direct (DIviding RECTangles) algorithm of Jones, Perttunen, and Stuckman (Journal of Optimization Theory and Applications, vol. 79, no. 1, pp. 157-181, 1993), a variant of Lipschitzian methods for bound constrained global optimization, has proved effective even in higher dimensions. However, the performance of a direct implementation in real applications depends on the characteristics of the objective function, the problem dimension, and the desired solution accuracy. Implementations with static data structures often fail in practice, since it is difficult to predict memory resource requirements in advance. This is especially critical in multidisciplinary engineering design applications, where the direct optimization is just one small component of a much larger computation, and any component failure aborts the entire design process. To make the direct global optimization algorithm efficient and robust on large-scale, multidisciplinary engineering problems, a set of dynamic data structures is proposed here to balance the memory requirements with execution time, while simultaneously adapting to arbitrary problem size. The focus of this paper is on design issues of the dynamic data structures, and related memory management strategies. Numerical computing techniques and modifications of Jones' original direct algorithm in terms of stopping rules and box selection rules are also explored. Performance studies are done for synthetic test problems with multiple local optima. Results for application to a site-specific system simulator for wireless communications systems ((SW)-W-4) are also presented to demonstrate the effectiveness of the proposed dynamic data structures for an implementation of direct.

关键词： global optimization direct algorithm direct search dynamic data structures

来源：评论

学校读者我要写书评

暂无评论

Extraction of 2.1D Sketch from Monocular Images using direct Optimization algorithm 7

Extraction of 2.1D Sketch from Monocular Images using DIRECT...

引用

7th IEEE International Advance Computing Conference (IACC)

作者： Deshpande, Rashmi R. Bhatt, Mahabaleswara R. Visvesvaraya Technol Univ Reg Res Ctr Bangalore Karnataka India BMS Coll Engn Dept Med Elect Bangalore Karnataka India

ISBN: (纸本)9781509015603

A performance and time efficient 2.1D sketch extraction from a given monocular image is proposed in a global optimization framework that exploits the divided rectangles (directs) but otherwise extracted by heuristic global optimization methods, like genetic algorithms, particle swarm evolution algorithms, and simulated annealing. An appeal of these algorithms is that they are guaranteed to yield the global minimum in probability one sense. The flip side of these algorithms is that they are usually time consuming and also may not reproduce the results consistently. Contrastingly, the currently proposed in this paper, we formulate 2.1D sketch extraction using direct algorithm, which not only apparently aims at providing the better global minimum but as a deterministic approach. Further, the extraction of 2.1D sketch are found to yield comparatively better than the results obtained by the hybrid differential evolution algorithm [1]. Interestingly, the proposed algorithm is superior since it takes far less computations in converging to either same global minimum or far better global minimum value that gives a 2.1 D sketch extraction.

关键词： 2.1D sketch direct algorithm global optimization

来源：评论

学校读者我要写书评

暂无评论

Design and optimal sizing of hybrid PV/wind/diesel system with battery storage by using direct search algorithm

Design and optimal sizing of hybrid PV/wind/diesel system wi...

引用

15th International Power Electronics and Motion Control Conference and Exposition (EPE-PEMC ECCE Europe)

作者： Zhang, Lu Barakat, Georges Yassine, Adnan Univ Le Havre Fac Sci & Technol Dept Elect Energy Engn Syst Le Havre Elect & Automat Res Grp GREAH 25 Rue Philippe LebonBP 1123 F-76063 Le Havre France

ISBN: (纸本)9781467319720

This paper focuses on the development of a methodology for sizing and optimization of four hybrid systems (PV/wind/diesel/battery, PV/wind/diesel, PV/diesel/battery and wind/diesel/battery). This approach makes use of the Dividing RECTangles (direct) algorithm to suggest, among a list of commercially available system devices, the optimal numbers and types of system components ensuring that the total cost objective function is minimized. These four hybrid systems are assumed to be installed at the city of Le Havre (France), with the collection of hourly environment data (solar radiation, wind speed and ambient temperature) for a period of 5-year. Finally, an impact of optimum system configuration on system performance are compared and discussed in the case studied.

关键词： direct algorithm Hybrid systems Optimization

来源：评论

学校读者我要写书评

暂无评论

Design and optimal sizing of hybrid PV/wind/diesel system with battery storage by using direct search algorithm

Design and optimal sizing of hybrid PV/wind/diesel system wi...

引用

International Power Electronics and Motion Control Conference

作者： Lu Zhang Georges Barakat Adnan Yassine Le Havre Electrical and Automatic Research Group (GREAH) Department of Electrical Energy engineering Systems Faculty of Science and Technology University of Le Havre

ISBN: (纸本)9781467319706

关键词： direct algorithm Hybrid systems Optimization

来源：评论

学校读者我要写书评

暂无评论

direct algorithms to solve the two-sided obstacle problem for an M-matrix

引用

NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS 2006年第7期13卷 543-551页

作者： Zeng, J. P. Jiang, Y. J. Hunan Univ Coll Math & Econometr Changsha 410082 Hunan Peoples R China Changsha Univ Sci & Technol Coll Math & Comp Sci Changsha Peoples R China Hunan Univ State Key Lab Adv Design & Mfg Vehicle Body Changsha Peoples R China

In this paper, two direct algorithms for solving the two-sided obstacle problem with an M-matrix are presented. The algorithms are well defined and have polynomial computational complexity. Copyright (C) 2006 John Wil... 详细信息

关键词： two-sided obstacle problem direct algorithm M-matrix polynomial computational complexity

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：