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

Design optimization of machinery mounting systems with an elastic support structure

ENGINEERING OPTIMIZATION 2007年第2期39卷 229-244页

作者： Xie, Shilin Or, Siu Wing Chan, Helen Lai Wa Choy, Ping Kong Liu, Peter Chou Kee Hong Kong Polytech Univ Dept Appl Phys Kowloon Hong Kong Peoples R China ASM Assembly Automat Ltd Watson Ctr 3 F Kwai Chung Hong Kong Peoples R China

An elastic support-based optimization model is developed for a machinery mounting system comprising a vibrating machine supported on an elastic structure by multiple resilient mounts. This model is used to investigate the design optimization of an X-Y motion stage mounting system used in microelectronics wire-bonding equipment. By varying the stiffness coefficients of the resilient mounts while constraining the dynamic displacement amplitudes of the X-Y motion stage, the total force transmitted from the X-Y motion stage (the vibrating machine) to the equipment table (the elastic support structure) is minimized at each frequency interval in the frequency range of interest for different stiffnesses of the equipment table. The results show that, when the equipment table is relatively flexible, the total transmitted force minimized by the model developed is significantly lower than that minimized using a conventional rigid support-based optimization model at some critical frequency. When the equipment table is sufficiently rigid, both models provide almost the same predictions of the total transmitted force.

关键词： machinery mounting system microelectronics wire-bonding equipment receptance matrix method sequential quadratic programming vibration isolation X-Y motion stage

来源：评论

学校读者我要写书评

暂无评论

Constraint incorporation in optimization

引用

MATHEMATICAL programming 2007年第3期110卷 615-639页

作者： Levy, Adam B. Bowdoin Coll Dept Math Brunswick ME 04011 USA

Numerical methods for solving constrained optimization problems need to incorporate the constraints in a manner that satisfies essentially competing interests;the incorporation needs to be simple enough that the solution method is tractable, yet complex enough to ensure the validity of the ultimate solution. We introduce a framework for constraint incorporation that identifies a minimal acceptable level of complexity and defines two basic types of constraint incorporation which (with combinations) cover nearly all popular numerical methods for constrained optimization, including trust region methods, penalty methods, barrier methods, penalty-multiplier methods, and sequential quadratic programming methods. The broad application of our framework relies on addition and chain rules for constraint incorporation which we develop here.

关键词： constrained optimization numerical optimization penalty methods barrier methods trust region methods penalty-multiplier methods sequential quadratic programming variational analysis

来源：评论

学校读者我要写书评

暂无评论

Complex weight control of array pattern nulling

引用

INTERNATIONAL JOURNAL OF RF AND MICROWAVE COMPUTER-AIDED ENGINEERING 2007年第3期17卷 304-310页

作者： Mouhamadou, Moctar Vaudon, Patrick Fac Sci & Tech OSA EM Wave & Antennas Dept CNRS UMR 6172XLIM123 Ave Albert Thomas F-87060 Limoges France

An efficient method based on the sequential quadratic programming (SQP) algorithm for the linear antenna arrays pattern synthesis with prescribed nulls in the interference direction and minimum side lobe levels by the complex weights of each array element is presented. In general, the pattern synthesis technique that generates a desired pattern is a greatly nonlinear optimization problem. SQP method is a versatile method to solve the general nonlinear constrained optimization problems and is much simpler to implement. It transforms the nonlinear minimization problem to a sequence of quadratic subproblem that is easier to solve, based on a quadratic approximation of the Lagrangian function. Several numerical results of Chebyshev pattern with the imposed single, multiple, and broad nulls sectors are provided and compared with published results to illustrate the performance of the proposed method. (C) 2007 Wiley Periodicals, Inc.

关键词： null steering antenna array interference suppression sequential quadratic programming pattern synthesis

来源：评论

学校读者我要写书评

暂无评论

Convergence of the BFGS-SQP method for degenerate problems

引用

NUMERICAL FUNCTIONAL ANALYSIS AND OPTIMIZATION 2007年第7-8期28卷 927-944页

作者： Liu, Taowen Li, Donghui Hunan Univ Inst Appl Math Changsha 410082 Peoples R China

In this paper, we propose a BFGS (Broyden-Fletcher-Goldfarb-Shanno)-SQP (sequential quadratic programming) method for nonlinear inequality constrained optimization. At each step, the method generates a direction by solving a quadratic programming subproblem. A good feature of this subproblem is that it is always consistent. Moreover, we propose a practical update formula for the quasi-Newton matrix. Under mild conditions, we prove the global and superlinear convergence of the method. We also present some numerical results.

关键词： BFGS-SQP method global convergence inequality constrained optimization sequential quadratic programming

来源：评论

学校读者我要写书评

暂无评论

Super-resolution time delay estimation in multipath environments

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS 2007年第9期54卷 1977-1986页

作者： Ge, Feng-Xiang Shen, Dongxu Peng, Yingning Li, Victor O. K. Tsing Hua Univ Sch Informat Sci & Technol Res Grant Council Hong Kong Peoples R China Univ Hong Kong Dept Elect & Elect Engn Hong Kong Peoples R China Intel China Res Ctr Beijing 100080 Peoples R China Tsinghua Univ Dept Elect Engn Beijing 100084 Peoples R China

The super-resolution time delay estimation in multipath environment is very important for many applications. Conventional super-resolution approaches can only deal with signals with wideband and flat spectra. In this paper, we propose a novel super-resolution time delay estimation method that can treat signals with narrowband spectra. In our method, the time delay estimation is first transformed into the frequency domain, in which the problem is converted into the parameter estimation of sinusoidal signals with lowpass envelopes. Then a MUSIC-type algorithm taking account of the envelope variation is applied to achieve the super-resolution estimation. Time delay estimation in active and passive systems are considered. Simulation results confirm that the proposed estimators provide better performance than the classical correlation approach and the conventional MUSIC algorithm for separating closely spaced signals with narrowband spectra.

关键词： Eigenanalysis MUSIC algorithm sequential quadratic programming super-resolution time delay estimation

来源：评论

学校读者我要写书评

暂无评论

A modified SQP method and its global convergence

引用

APPLIED MATHEMATICS AND COMPUTATION 2007年第2期186卷 945-951页

作者： Che, Jianren Su, Ke Tongji Univ Dept Surveying & Geoinformat Shanghai 200092 Peoples R China Tongji Univ Dept Math Shanghai 200092 Peoples R China

In this paper, a modified SQP method is presented. The algorithm starts from an arbitrary initial point and can overcome the Maratos effect. Moreover, it avoid choosing the penalty parameters. Under some reasonable co... 详细信息

关键词： constrained optimization KKT point sequential quadratic programming global convergence

来源：评论

学校读者我要写书评

暂无评论

A trust region SQP algorithm for mixed-integer nonlinear programming

引用

OPTIMIZATION LETTERS 2007年第3期1卷 269-280页

作者： Exler, Oliver Schittkowski, Klaus Univ Bayreuth Dept Comp Sci D-95440 Bayreuth Germany CSIC IIM Spanish Council Sci Res Proc Engn Grp Vigo 36208 Spain

We propose a modified sequential quadratic programming method for solving mixed-integer nonlinear programming problems. Under the assumption that integer variables have a smooth influence on the model functions, i.e., that function values do not change drastically when in-or decrementing an integer value, successive quadratic approximations are applied. The algorithm is stabilized by a trust region method with Yuan's second order corrections. It is not assumed that the mixed-integer program is relaxable or, in other words, function values are evaluated only at integer points. The Hessian of the Lagrangian function is approximated by a quasi-Newton update formula subject to the continuous and integer variables. Numerical results are presented for a set of 80 mixed-integer test problems taken from the literature. The surprising result is that the number of function evaluations, the most important performance criterion in practice, is less than the number of function calls needed for solving the corresponding relaxed problem without integer variables.

关键词： Mixed-integer nonlinear programming sequential quadratic programming SQP Trust region methods

来源：评论

学校读者我要写书评

暂无评论

Vibration analysis of shape-optimized rotating cantilever beams

引用

ENGINEERING OPTIMIZATION 2007年第1期39卷 105-123页

作者： Gunjal, S. K. Dixit, U. S. Indian Inst Technol Guwahati Dept Mech Engn N Guwahati 781039 Assam India

The shape optimization of rotating beams is carried out in order to minimize the vibrations. The objective is the maximization of the fundamental frequency with constraints on the beam mass and static tip deflections. The finite-element method (FEM) is used to model the rotating beam and sequential quadratic programming (SQP) is used for the optimization. The effects of beam frequency maximization and hub-beam frequency maximization on the optimized shapes and the dynamic characteristics of these shapes are studied. The beam shapes are optimized for different speeds. The natural frequencies and time responses of these optimized shapes are studied using numerical simulation. Based on the numerical study, suggestions for formulating an appropriate optimization problem in a given context are made.

关键词： shape optimization vibrations sequential quadratic programming rotating beams finite-element method

来源：评论

学校读者我要写书评

暂无评论

Multi-objective optimization of multipass turning processes

引用

INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY 2007年第9-10期32卷 902-910页

作者： Abburi, N. R. Dixit, U. S. Indian Inst Technol Dept Engn Mech Gauhati 781039 India

In this paper, a methodology is proposed for the multi-objective optimization of a multipass turning process. A real-parameter genetic algorithm (RGA) is used for minimizing the production time, which provides a nearly optimum solution. This solution is taken as the initial guess for a sequential quadratic programming (SQP) code, which further improves the solution. Thereafter, the Pareto-optimal solutions are generated without using the cost data. For any Pareto-optimal solution, the cost of production can be calculated at a higher level for known cost data. An objective method based on the linear programming model is proposed for choosing the best among the Pareto-optimal solutions. The entire methodology is demonstrated with the help of an example. The optimization is carried out with equal depths of cut for roughing passes. A simple numerical method has been suggested for estimating the expected improvement in the optimum solution if an unequal depth of cut strategy would have been employed.

关键词： turning process multi-objective optimization real-parameter genetic algorithm sequential quadratic programming linear programming Lagrange multiplier

来源：评论

学校读者我要写书评

暂无评论

Determination of minimum thrust requirement for a passenger aircraft

引用

JOURNAL OF AIRCRAFT 2007年第6期44卷 1787-1792页

作者： Ghenaiet, Adel Polytech Sch Engn Lab Thermal Power Syst Algiers 16111 Algeria

This paper describes a methodology aimed at a rapid assessment of the minimum thrust requirement for a given aircraft configuration. This latter involves a tight coupling between flight mission analyses, engine performance, and optimization techniques. The flight performance analysis is used to assess the relatively significant constraints, thus rapidly identifying the feasible design space to meet specific requirements, considering a tradeoff between operation constraints and objectives often of conflicting nature. With conventional procedures, it is rather difficult to find the optimum design point (match point), because of many involved objectives and constraints. However, by adopting the actual methodology using a subroutine called KSOPT, which solves constraints optimization problem using Kreisselmeier-Steinhauser envelope function formulation, associated with a deterministic optimization algorithm, either sequential quadratic programming or modified method of feasible direction, the overall procedure becomes simpler, because there is only one objective and a constraint, thus avoiding separate optimizations. This present methodology is therefore more effective from the point of view of rapidity in searching for the optimum match point, and may provide guidance in identifying a potential propulsion system and the necessary data serving to develop a derivative (growth) engine.

关键词： C_D: drag coefficient C_L: lift coefficient D: drag force F: vector of objective functions g: constraints of inequality L: lift force M: Mach number S: lifting surface T: total thrust V: velocity W: weight X: vector of variables tradeoffs PARTICLE RAPIDITY minimum Optimization algorithms Constraint aircraft aerodynamic configuration tight coupling Passenger aircraft sequential quadratic programming point of view

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：