English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

The robust truss topology optimization against the uncertain static externalload can be formulated as mixed-integer semidefinite programming. Although aglobal optimal solution can be computed with a branch-and-bound method, it isvery time-consuming. This paper presents an alternative formulation,semidefinite programming with complementarity constraints, and proposes anefficient heuristic. The proposed method is based upon the convex-concaveprocedure for DC (difference-of-convex) programming. It is shown that themethod can often find a practically reasonable truss design within thecomputational cost of solving some dozen of convex optimization subproblems.

Robust Truss Topology Optimization via Semidefinite Programming with Complementarity Constraints: A Difference-of-Convex Programming Approach