444 research outputs found

    On the Triality Theory for a Quartic Polynomial Optimization Problem

    Full text link
    This paper presents a detailed proof of the triality theorem for a class of fourth-order polynomial optimization problems. The method is based on linear algebra but it solves an open problem on the double-min duality left in 2003. Results show that the triality theory holds strongly in a tri-duality form if the primal problem and its canonical dual have the same dimension; otherwise, both the canonical min-max duality and the double-max duality still hold strongly, but the double-min duality holds weakly in a symmetrical form. Four numerical examples are presented to illustrate that this theory can be used to identify not only the global minimum, but also the largest local minimum and local maximum.Comment: 16 pages, 1 figure; J. Industrial and Management Optimization, 2011. arXiv admin note: substantial text overlap with arXiv:1104.297

    On topology optimization and canonical duality method

    Get PDF
    Topology optimization for general materials is correctly formulated as a bi-level knapsack problem, which is considered to be NP-hard in global optimization and computer science. By using canonical duality theory (CDT) developed by the author, the linear knapsack problem can be solved analytically to obtain global optimal solution at each design iteration. Both uniqueness, existence, and NP-hardness are discussed. The novel CDT method for general topology optimization is refined and tested by both 2-D and 3-D benchmark problems. Numerical results show that without using filter and any other artificial technique, the CDT method can produce exactly 0-1 optimal density distribution with almost no checkerboard pattern. Its performance and novelty are compared with the popular SIMP and BESO approaches. Additionally, some mathematical and conceptual mistakes in literature are explicitly addressed. A brief review on the canonical duality theory for modeling multi-scale complex systems and for solving general nonconvex/discrete problems are given in Appendix. This paper demonstrates a simple truth: elegant designs come from correct model and theory. © 201
    • …
    corecore