A new parallel method for verified global optimization
β Scribed by S. Ibraev
- Publisher
- John Wiley and Sons
- Year
- 2002
- Weight
- 69 KB
- Volume
- 1
- Category
- Article
- ISSN
- 1617-7061
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A new global optimization algorithm for solving bilinear matrix inequalities (BMI) problems is developed. It is based on a dual Lagrange formulation for computing lower bounds that are used in a branching procedure to eliminate partition sets in the space of complicating variables. The advantage of
A general method designed to isolate the global minimum of a multidimensional objective function with multiple minima is presented. The algorithm exploits an integral ''coarse-graining'' transformation of the objective function, U, into a smoothed function with few minima. When the coarsegraining is
In the present paper, a quasi-analytic method for solving structural optimization problems has been developed by co-ordinated use of mathematical transformations, high-quality approximation and a twolevel approximation strategy. The method which has the advantages of both generality in applications