Signomial geometric programming (SGP) has been an interesting problem for many authors recently. Many methods have been provided for finding locally optimal solutions of SGP, but little progress has been made for global optimization of SGP. In this paper we propose a new accelerating method for glob
Second-order method of generalized geometric programming for spatial frame optimization
β Scribed by Yun Kang Sui; Xi Cheng Wang
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 428 KB
- Volume
- 141
- Category
- Article
- ISSN
- 0045-7825
No coin nor oath required. For personal study only.
β¦ Synopsis
To design concrete sectional sizes of beams, the optimization model of the spatial frame is transformed into a problem of GGP (generalized geometric programming) in terms of the Duffin's condensation formula. Adopting the strategy of two stages, the problem is solved by the structure stage and the elements stage, alternately. The first-and the second-order primal algorithm for the GGP, which are based on the first-and the second-order expansions under the logarithmic transformation in the logarithmic space, are applied in the elements stage and the structure stage, respectively. Numerical results including a large scale structure of the electrostatic precipitator show satisfactory efficiency of the method.
π SIMILAR VOLUMES
In this paper we define second order C-differentiable functions and second order C-differential operators, describe their some properties and propose an inexact generalized Newton method to solve unconstrained optimization problems in which the objective function is not twice differentiable, but sec
## Abstract This paper presents the Galerkin approximation of the optimization problem of a system governed by nonβlinear secondβorder evolution equation where a nonβlinear operator depends on derivative of the state of the system. The control is acting on a nonβlinear equation. After giving some r