Nonsmooth and nonconvex structural analysis algorithms based on difference convex optimization techniques

1996 ◽  
Vol 12 (2-3) ◽  
pp. 167-176 ◽  
Author(s):  
G. E. Stavroulakis ◽  
L. N. Polyakova
2013 ◽  
Vol 785-786 ◽  
pp. 1258-1261
Author(s):  
In Pyo Cha ◽  
Hee Jae Shin ◽  
Neung Gu Lee ◽  
Lee Ku Kwac ◽  
Hong Gun Kim

Topology optimization and shape optimization of structural optimization techniques are applied to transport skate the lightweight. Skate properties by varying the design variables and minimize the maximum stress and strain in the normal operation, while reducing the volume of the objective function of optimal design and Skate the static strength of the constraints that should not degrade compared to the performance of the initial model. The skates were used in this study consists of the main frame, sub frame, roll, pin main frame only structural analysis and optimal design was performed using the finite element method. Simplified initial model set design area and it compared to SM45C, AA7075, CFRP, GFRP was using the topology optimization. Strength does not degrade compared to the initial model, decreased volume while minimizing the stress and strain results, the optimum design was achieved efficient lightweight.


2008 ◽  
Vol 130 (2) ◽  
Author(s):  
Costin D. Untaroiu ◽  
Paul E. Allaire ◽  
William C. Foiles

In some industrial applications, influence coefficient balancing methods fail to find the optimum vibration reduction due to the limitations of the least-squares optimization methods. Previous min-max balancing methods have not included practical constraints often encountered in industrial balancing. In this paper, the influence coefficient balancing equations, with suitable constraints on the level of the residual vibrations and the magnitude of correction weights, are cast in linear matrix inequality (LMI) forms and solved with the numerical algorithms developed in convex optimization theory. The effectiveness and flexibility of the proposed method have been illustrated by solving two numerical balancing examples with complicated requirements. It is believed that the new methods developed in this work will help in reducing the time and cost of the original equipment manufacturer or field balancing procedures by finding an optimum solution of difficult balancing problems. The resulting method is called the optimum min-max LMI balancing method.


2004 ◽  
Vol 21 (01) ◽  
pp. 9-33
Author(s):  
JAVIER SALMERÓN ◽  
ÁNGEL MARÍN

In this paper, we present an algorithm to solve a particular convex model explicitly. The model may massively arise when, for example, Benders decomposition or Lagrangean relaxation-decomposition is applied to solve large design problems in facility location and capacity expansion. To attain the optimal solution of the model, we analyze its Karush–Kuhn–Tucker optimality conditions and develop a constructive algorithm that provides the optimal primal and dual solutions. This approach yields better performance than other convex optimization techniques.


Sign in / Sign up

Export Citation Format

Share Document