IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v130y2006i2d10.1007_s10957-006-9102-z.html
   My bibliography  Save this article

Sequential Semidefinite Program for Maximum Robustness Design of Structures under Load Uncertainty

Author

Listed:
  • Y. Kanno

    (The University of Tokyo)

  • I. Takewaki

    (Kyoto University)

Abstract

A robust structural optimization scheme as well as an optimization algorithm are presented based on the robustness function. Under the uncertainties of the external forces based on the info-gap model, the maximization of the robustness function is formulated as an optimization problem with infinitely many constraints. By using the quadratic embedding technique of uncertainty and the S-procedure, we reformulate the problem into a nonlinear semidefinite programming problem. A sequential semidefinite programming method is proposed which has a global convergent property. It is shown through numerical examples that optimum designs of various linear elastic structures can be found without difficulty.

Suggested Citation

  • Y. Kanno & I. Takewaki, 2006. "Sequential Semidefinite Program for Maximum Robustness Design of Structures under Load Uncertainty," Journal of Optimization Theory and Applications, Springer, vol. 130(2), pages 265-287, August.
    • Handle: RePEc:spr:joptap:v:130:y:2006:i:2:d:10.1007_s10957-006-9102-z
    DOI: 10.1007/s10957-006-9102-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-006-9102-z
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10957-006-9102-z?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Qi Zhao & Zhongwen Chen, 2018. "An SQP-type Method with Superlinear Convergence for Nonlinear Semidefinite Programming," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 35(03), pages 1-25, June.
    2. Rodrigo Garcés & Walter Gómez & Florian Jarre, 2011. "A self-concordance property for nonconvex semidefinite programming," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 74(1), pages 77-92, August.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:joptap:v:130:y:2006:i:2:d:10.1007_s10957-006-9102-z. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.