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

General skew constrained clock network sizing based on sequential linear programming

IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS 2005年第5期24卷 773-782页

作者： Wang, K Ran, YJ Jiang, HL Marek-Sadowska, M Univ Calif Santa Barbara Dept Elect & Comp Engn Santa Barbara CA 93106 USA

In this paper, we investigate the problem of clock network sizing subject to general skew constraints. A novel approach based on sequential linear programming is presented. The original nonlinear programming problem is transformed into a sequence of linear programs by taking the first-order Taylor's expansion of clock path delay with respect to buffer and/or wire widths. For each linear program, the sensitivities of clock path delay, with respect to buffer and/or wire widths, are efficiently updated by applying time-domain analysis to the clock network in a divide-and-conquer fashion. Our technique can take into account power supply and process variations. We demonstrate experimentally that the proposed technique is not only capable of optimizing effectively the skew and area of clock network, but also of providing more accurate delay and skew results compared to the traditional approaches.

关键词： clock slew power supply noise sequential linear programming

来源：评论

学校读者我要写书评

暂无评论

An adaptive sequential linear programming algorithm for optimal design problems with probabilistic constraints

引用

JOURNAL OF MECHANICAL DESIGN 2007年第2期129卷 140-149页

作者： Chan, Kuei-Yuan Skerlos, Steven J. Papalambros, Panos Natl Cheng Kung Univ Dept Mech Engn Tainan 70101 Taiwan Univ Michigan Dept Mech Engn Ann Arbor MI 48109 USA

Optimal design problems with probabilistic constraints, often referred to as reliability-based design optimization problems, have been the subject of extensive recent studies. Solution methods to date have focused more on improving efficiency rather than accuracy and the global convergence behavior of the solution. A new strategy utilizing an adaptive sequential linear programming (SLP) algorithm is proposed as a promising approach to balance accuracy, efficiency, and convergence. The strategy transforms the nonlinear probabilistic constraints into equivalent deterministic ones using both first order and second order approximations, and applies a filter-based SLP algorithm to reach the optimum. Simple numerical examples show promise for increased accuracy without sacrificing efficiency.

关键词： RBDO probabilistic design optimization design under uncertainty sequential linear programming

来源：评论

学校读者我要写书评

暂无评论

A discontinuous quasi-upper bound limit analysis approach with sequential linear programming mesh adaptation

引用

INTERNATIONAL JOURNAL OF MECHANICAL SCIENCES 2009年第1期51卷 89-104页

作者： Milani, G. Lourenco, P. B. ETH Swiss Fed Inst Technol Dept Struct Engn IBK CH-8093 Zurich Switzerland Univ Minho Dept Civil Engn Sch Engn P-4800058 Azurem Guimaraes Portugal

In this paper, a simple discontinuous upper bound limit analysis approach with sequential linear programming mesh adaptation is presented. Rigid, infinitely strong triangular elements with both linear and Bezier curved edges are considered. A possible jump of velocities is allowed at the interfaces between contiguous elements, thus allowing plastic dissipation on curved interfaces. Bezier curved edges are used with the sole aim of improving the element performance when dealing with limit analysis problems involving curved sliding lines. The model performs poorly for unstructured meshes (i.e. at the initial iteration), being unable to reproduce the typical plastic deformation concentration on inclined slip lines. Therefore, an iterative mesh adaptation based on sequential linear programming is proposed. A simple linearization of the non-linear constraints is performed, allowing to treat the non-linear programming (NLP) problem with consolidated linear programming (LP) routines. The choice of inequalities constraints on elements nodes coordinates turns out to be crucial on the algorithm convergence. Several examples are treated, consisting in the determination of failure loads for ductile, purely cohesive and cohesive-frictional materials. The results obtained at the final iteration fit well, for all the cases analyzed, previously presented numerical approaches and analytical predictions. (C) 2008 Elsevier Ltd. All rights reserved.

关键词： Upper bound limit analysis Rigid elements Interfaces sequential linear programming Associated flow rule Frictionless and frictional materials

来源：评论

学校读者我要写书评

暂无评论

Robust and coordinated tuning of power system stabiliser gains using sequential linear programming

引用

IET GENERATION TRANSMISSION & DISTRIBUTION 2010年第8期4卷 893-904页

作者： Jabr, R. A. Pal, B. C. Martins, N. Ferraz, J. C. R. Amer Univ Beirut Dept Elect & Comp Engn Beirut 11072020 Lebanon Univ London Imperial Coll Sci Technol & Med Dept Elect & Elect Engn London SW7 2BT England CEPEL BR-21941911 Rio De Janeiro Brazil ANEEL SGAN 603 BR-70830030 Brasilia DF Brazil

This study presents a linear programming (LP)-based multivariable root locus following technique for coordinating the gain settings of power system stabilisers (PSSs). The stabiliser robustness is accounted for in the design problem by simultaneously considering the state-space representations and multivariable root loci corresponding to different operating scenarios. The proposed technique computes a curve in the PSS gain parameter space such that when the PSS gains move along this curve to their optimal values, the branches of the corresponding multivariable root loci terminate at satisfactory points in the complex plane. The curve in the gain parameter space is computed via a linear program that successively minimises the Euclidean distance between the unsatisfactory and satisfactory eigenvalue locations. The design method is demonstrated on a 39-bus test system with 14 operating scenarios. A comparison is carried out between the coordination results of two PSS structures, one involving two phase-lead blocks and the other comprised of two phase-lead blocks and a phase-lag block.

关键词： Control of electric power systems PSS gain parameter space Multivariable control systems linear programming Optimisation techniques state-space representations power system stabiliser gain Power system control multivariable control systems sequential linear programming Euclidean distance root loci eigenvalue Control system analysis and synthesis methods eigenvalues and eigenfunctions state-space methods LP based multivariable root locus Stability in control theory multivariable root locus power system stability

来源：评论

学校读者我要写书评

暂无评论

On the effectiveness of sequential linear programming for the pooling problem

引用

ANNALS OF OPERATIONS RESEARCH 2023年第2期322卷 691-711页

作者： Grothey, Andreas McKinnon, Ken Univ Edinburgh Sch Math Mayfield Rd Edinburgh EH9 3JZ Scotland

The aim of this paper is to compare the performance of a local solution technique-namely sequential linear programming (SLP) employing random starting points-with state-of-the-art global solvers such as Baron and more sophisticated local solvers such as sequential Quadratic programming and Interior Point for the pooling problem. These problems can have many local optima, and we present a small example that illustrates how this can *** demonstrate that SLP-usually deemed obsolete since the arrival of fast reliable SQP solvers, Interior Point Methods and sophisticated global solvers-is still the method of choice for an important class of pooling problems when the criterion is the quality of the solution found within a given acceptable time budget. On this measure SLP significantly ourperforms all other tested *** addition we introduce a new formulation, the qq-formulation, for the case of fixed demands, that exclusively uses proportional variables. We compare the performance of SLP and the global solver Baron on the qq-formulation and other common formulations. While Baron with the qq-formulation generates weaker bounds than with the other formulations tested, for both SLP and Baron the qq-formulation finds the best solutions within a given time budget. The qq-formulation can be strengthened by pq-like cuts in which case the same bounds as for the pq-formulation are obtained. However the associated time penalty due to the additional constraints results in poorer solution quality within the time budget.

关键词： Pooling problem sequential linear programming Global optimization Nonlinear programming

来源：评论

学校读者我要写书评

暂无评论

CORRECTED sequential linear-programming FOR SPARSE MINIMAX OPTIMIZATION

引用

BIT NUMERICAL MATHEMATICS 1994年第3期34卷 372-387页

作者： JONASSON, K MADSEN, K TECH UNIV DENMARK INST MATH MODELLING DK-2800 LYNGBY DENMARK

We present a new algorithm for nonlinear minimax optimization which is well suited for large and sparse problems. The method is based on trust regions and sequential linear programming. On each iteration a linear minimax problem is solved for a basic step. If necessary, this is followed by the determination of a minimum norm corrective step based on a first-order Taylor approximation. No Hessian information needs to be stored. Global convergence is proved. This new method has been extensively tested and compared with other methods, including two well known codes for nonlinear programming. The numerical tests indicate that in many cases the new method can find the solution in just as few iterations as methods based on approximate second-order information. The tests also show that for some problems the corrective steps give much faster convergence than for similar methods which do not employ such steps.

关键词： NONlinear MINIMAX OPTIMIZATION sequential linear programming SPARSE NONlinear programming

来源：评论

学校读者我要写书评

暂无评论

Topology Optimization of IPMSM Using sequential linear programming in Combination with Magnetic Field and Mechanical Analysis 20

Topology Optimization of IPMSM Using Sequential Linear Progr...

引用

20th Biennial IEEE Conference on Electromagnetic Field Computation (CEFC)

作者： Ito, Kei Nagayama, Hibiki Koda, Riku Katayama, Kazuya Mochizuki, Kosuke Okamoto, Yoshifumi Hosei Univ Dept Elect & Elect Engn Koganei Tokyo Japan

ISBN: (数字)9781665468336

ISBN: (纸本)9781665468336

Since the interior permanent magnet synchronous motors (IPMSMs) are actively applied to the industrial machines such as EV, the design of high-performance IPMSM is substantially demanded. Further, to protect the deformation of the rotor core in the high speed rotation, the high stiffness should be also considered. In this paper, the topology optimization method of IPMSM using sequential linear programming method in combination with the magnetic field and mechanical analysis is investigated.

关键词： IPMSM magnetic field analysis mechanical analysis sequential linear programming topology optimization

来源：评论

学校读者我要写书评

暂无评论

Reactice power pricing in competitive electric markets using a methodology based on the theory of marginal costs with sequential linear programming

Reactice power pricing in competitive electric markets using...

引用

42nd International Universities Power Engineering Conference

作者： Seifossadat, S. Gh. A. Saniei, M. Raeszadeh, A. Shahid Chamran Univ Dept Elect Fac Engn Ahvaz Iran Islamic Azad Univ Tehran Iran

ISBN: (纸本)9781905593361

In this paper a method based on the marginal cost theory is presented for calculation of the pricing of active and reactive power at each bus in competitive electric markets. In this method the production cost of reactive power is included in the objective function of the optimal power flow problem and sequential linear programming method is used to solve the optimal problem. The proposed method is tested on the 9-bus system using Matlab program.

关键词： ancillary service optimal power flow power market reactive power pricing sequential linear programming

来源：评论

学校读者我要写书评

暂无评论

A hybrid genetic algorithm integrated with sequential linear programming

A hybrid genetic algorithm integrated with sequential linear...

引用

International Conference on Machine Learning and Cybernetics

作者： Jiang, Z Liu, B Dai, LK Wu, TJ Zhejiang Univ Natl Lab Ind Control Technol Hangzhou 310027 Peoples R China

ISBN: (纸本)0780378652

A new hybrid genetic algorithm is proposed for nonlinear programming problems in this paper, which combines a Genetic Algorithm (GA) with a sequential linear programming method. During the iterative computation process, if the iterative points in the GA do not obtain crossover or mutation operation, the objection function and constraints at these points will be linearized. In order to satisfy the constraints within the neighborhood of these points, soft constraints are added, and the linearized optimization problem can be solved with the linear programming. The new hybrid genetic algorithm is globally convergent;it does not require that the iterative,points must be feasible. Simulation results show that the algorithm is effective and reasonable, and it can be widely used in the complicated nonlinear programming.

关键词： nonlinear programming hybrid genetic algorithm sequential linear programming soft constraints

来源：评论

学校读者我要写书评

暂无评论

Improvements in Material-Density-Based Topology Optimization for 3-D Magnetic Circuit Design by FEM and sequential linear programming Method

引用

IEEE TRANSACTIONS ON MAGNETICS 2014年第2期50卷 689-692页

作者： Okamoto, Yoshifumi Tominaga, Yusuke Wakao, Shinji Sato, Shuji Utsunomiya Univ Dept Elect & Elect Syst Engn Utsunomiya Tochigi 3218585 Japan Waseda Univ Dept Elect Engn & Biosci Tokyo 1698555 Japan

Topology optimization (TO) makes it possible to obtain new structures for electrical machines. The sensitivity-based method, which can cope with some constraint conditions, is suitable for large-scale three-dimensional TO. However, if the material density is defined by unknown variables in TO, elements with intermediate density (grayscale) occasionally appear. The grayscale cannot clearly show the material allocation within its finite element. Thus, we propose a sigmoid-based filtering function to suppress the generation of grayscale. Moreover, because the constraint condition can be simply taken into consideration, sequential linear programming is occasionally utilized as a topology optimizer. However, the convergence characteristics frequently oscillate and are strongly dependent on the move limit that controls the maximum intensity of the correction vector. To overcome this numerical difficulty, we propose an identification technique for the determination of a quasi-optimal move limit (QOML). This paper demonstrates the performance of both the mathematical function filtering grayscale and QOML.

关键词： Filtering function material density quasi-optimal move limit sequential linear programming topology optimization

来源：评论

学校读者我要写书评

暂无评论

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：