Design Relations

Author(s):  
James R. Rinderle ◽  
Eric R. Colburn

Abstract During preliminary design, designers make critical design decisions based on their experiential knowledge of the characteristics of the components that comprise a system. In particular designers understand the inherent relationship between the form a device will take and the behavior it will exhibit and use this knowledge to estimate characteristics of components and thus evaluate a system. Knowledge of these design relations are gained with experience, but even an experienced designer may not understand the design relations for an unfamiliar device. It is therefore useful to obtain this information automatically and provide it directly to the designer to supplement experience. In this paper we discuss the nature of design relations and show that these relations are inherent in the physics, shaped by the constraints, and dependent upon the context of the design. We describe a method for automatically identifying these relations from a constraint-based model of a device which is based on solving a sequence of constrained optimization problems.

2014 ◽  
Vol 2014 ◽  
pp. 1-6
Author(s):  
Zhijun Luo ◽  
Lirong Wang

A new parallel variable distribution algorithm based on interior point SSLE algorithm is proposed for solving inequality constrained optimization problems under the condition that the constraints are block-separable by the technology of sequential system of linear equation. Each iteration of this algorithm only needs to solve three systems of linear equations with the same coefficient matrix to obtain the descent direction. Furthermore, under certain conditions, the global convergence is achieved.


Author(s):  
Christian Kanzow ◽  
Andreas B. Raharja ◽  
Alexandra Schwartz

AbstractA reformulation of cardinality-constrained optimization problems into continuous nonlinear optimization problems with an orthogonality-type constraint has gained some popularity during the last few years. Due to the special structure of the constraints, the reformulation violates many standard assumptions and therefore is often solved using specialized algorithms. In contrast to this, we investigate the viability of using a standard safeguarded multiplier penalty method without any problem-tailored modifications to solve the reformulated problem. We prove global convergence towards an (essentially strongly) stationary point under a suitable problem-tailored quasinormality constraint qualification. Numerical experiments illustrating the performance of the method in comparison to regularization-based approaches are provided.


2006 ◽  
Vol 169 (3) ◽  
pp. 1108-1127 ◽  
Author(s):  
Ş.İ. Birbil ◽  
G. Bouza ◽  
J.B.G. Frenk ◽  
G. Still

2007 ◽  
Vol 57 (3) ◽  
pp. 307-328 ◽  
Author(s):  
Chang-Yu Wang ◽  
Jian-Zhong Zhang ◽  
Wen-Ling Zhao

Sign in / Sign up

Export Citation Format

Share Document