<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.1 20151215//EN" "http://jats.nlm.nih.gov/publishing/1.1/JATS-journalpublishing1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xml:lang="en" article-type="research-article" dtd-version="1.1">
<front>
<journal-meta>
<journal-id journal-id-type="pmc">CMES</journal-id>
<journal-id journal-id-type="nlm-ta">CMES</journal-id>
<journal-id journal-id-type="publisher-id">CMES</journal-id>
<journal-title-group>
<journal-title>Computer Modeling in Engineering &#x0026; Sciences</journal-title>
</journal-title-group>
<issn pub-type="epub">1526-1506</issn>
<issn pub-type="ppub">1526-1492</issn>
<publisher>
<publisher-name>Tech Science Press</publisher-name>
<publisher-loc>USA</publisher-loc>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">66676</article-id>
<article-id pub-id-type="doi">10.32604/cmes.2025.066676</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>Smooth Boundary Topology Optimization&#x2014;A New Framework for Movable Morphable Smooth Boundary Method</article-title>
<alt-title alt-title-type="left-running-head">Smooth Boundary Topology Optimization&#x2014;A New Framework for Movable Morphable Smooth Boundary Method</alt-title>
<alt-title alt-title-type="right-running-head">Smooth Boundary Topology Optimization&#x2014;A New Framework for Movable Morphable Smooth Boundary Method</alt-title>
</title-group>
<contrib-group>
<contrib id="author-1" contrib-type="author">
<name name-style="western"><surname>Du</surname><given-names>Jiazheng</given-names></name><xref ref-type="aff" rid="aff-1">1</xref></contrib>
<contrib id="author-2" contrib-type="author">
<name name-style="western"><surname>Chen</surname><given-names>Ju</given-names></name><xref ref-type="aff" rid="aff-1">1</xref><xref ref-type="aff" rid="aff-2">2</xref></contrib>
<contrib id="author-3" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Ye</surname><given-names>Hongling</given-names></name><xref ref-type="aff" rid="aff-1">1</xref><email>yehongl@bjut.edu.cn</email></contrib>
<contrib id="author-4" contrib-type="author">
<name name-style="western"><surname>Lin</surname><given-names>Bing</given-names></name><xref ref-type="aff" rid="aff-1">1</xref></contrib>
<contrib id="author-5" contrib-type="author">
<name name-style="western"><surname>Guo</surname><given-names>Zhichao</given-names></name><xref ref-type="aff" rid="aff-1">1</xref></contrib>
<aff id="aff-1"><label>1</label><institution>School of Mathematics, Statistics and Mechanics, Beijing University of Technology</institution>, <addr-line>Beijing, 100124</addr-line>, <country>China</country></aff>
<aff id="aff-2"><label>2</label><institution>Shanghai Tian&#x2019;an Bearing Co., Ltd.</institution>, <addr-line>Shanghai, 201108</addr-line>, <country>China</country></aff>
</contrib-group>
<author-notes>
<corresp id="cor1"><label>&#x002A;</label>Corresponding Author: Hongling Ye. Email: <email>yehongl@bjut.edu.cn</email></corresp>
</author-notes>
<pub-date date-type="collection" publication-format="electronic">
<year>2025</year>
</pub-date>
<pub-date date-type="pub" publication-format="electronic">
<day>31</day><month>07</month><year>2025</year>
</pub-date>
<volume>144</volume>
<issue>1</issue>
<fpage>791</fpage>
<lpage>809</lpage>
<history>
<date date-type="received">
<day>14</day>
<month>4</month>
<year>2025</year>
</date>
<date date-type="accepted">
<day>20</day>
<month>6</month>
<year>2025</year>
</date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2025 The Authors.</copyright-statement>
<copyright-year>2025</copyright-year>
<copyright-holder>Published by Tech Science Press.</copyright-holder>
<license xlink:href="https://creativecommons.org/licenses/by/4.0/">
<license-p>This work is licensed under a <ext-link ext-link-type="uri" xlink:type="simple" xlink:href="https://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution 4.0 International License</ext-link>, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</license-p>
</license>
</permissions>
<self-uri content-type="pdf" xlink:href="TSP_CMES_66676.pdf"></self-uri>
<abstract>
<p>The traditional topology optimization method of continuum structure generally uses quadrilateral elements as the basic mesh. This approach often leads to jagged boundary issues, which are traditionally addressed through post-processing, potentially altering the mechanical properties of the optimized structure. A topology optimization method of Movable Morphable Smooth Boundary (MMSB) is proposed based on the idea of mesh adaptation to solve the problem of jagged boundaries and the influence of post-processing. Based on the ICM method, the rational fraction function is introduced as the filtering function, and a topology optimization model with the minimum weight as the objective and the displacement as the constraint is established. A triangular mesh is utilized as the base mesh in this method. The mesh is re-divided in the optimization process based on the contour line, and a smooth boundary parallel to the contour line is obtained. Numerical examples demonstrate that the MMSB method effectively resolves the jagged boundary issues, leading to enhanced structural performance.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>Movable Morphable Smooth Boundary</kwd>
<kwd>continuum structure</kwd>
<kwd>topology optimization</kwd>
<kwd>jagged boundary</kwd>
<kwd>ICM method</kwd>
</kwd-group>
<funding-group>
<award-group id="awg1">
<funding-source>National Natural Science Foundation of China</funding-source>
<award-id>12472113</award-id>
</award-group>
</funding-group>
</article-meta>
</front>
<body>
<sec id="s1">
<label>1</label>
<title>Introduction</title>
<p>Due to the rapid development of additive manufacturing technology, its integration with topology optimization is becoming increasingly close, expanding the design space available for topology optimization. Combining them will be a new revolution with significant development prospects in the modern manufacturing industry [<xref ref-type="bibr" rid="ref-1">1</xref>,<xref ref-type="bibr" rid="ref-2">2</xref>]. However, the final structure produced through topology optimization is generally challenging to be directly used for manufacturing because most of the structural design domains in topology optimization use quadrilateral elements or hexahedral elements, and they inevitably result in jagged boundaries and gray-scale elements. Although many researchers have studied the jagged boundary problem, most solutions involve post-processing after the optimization iterations terminate. Although this method can make the boundaries smoother, it can compromise the advantages of topology optimization, potentially reducing the mechanical properties of the structure and diminishing its engineering value. Therefore, developing an optimization method that achieves smooth boundaries automatically during the optimization process is of great significance.</p>
<p>In 2012, Fu [<xref ref-type="bibr" rid="ref-3">3</xref>] obtained satisfactory optimization results based on the level set optimization method using a geometric reconstruction technique to fit the topology-optimized boundaries. In 2022, Zhang et al. [<xref ref-type="bibr" rid="ref-4">4</xref>] binarized the results of the topology optimization design to obtain the boundaries without gray elements and then extracted the corner points of the boundaries. Finally, the focus of these corner points was fitted to the curve to achieve a smooth and clear boundary. Although this method results in smooth boundaries, the mechanical properties of the overall structure are altered. In 2022, Li et al. [<xref ref-type="bibr" rid="ref-5">5</xref>] used a pre-constructed look-up table to transform the shapes of the boundary elements obtained in topology optimization and finally generated a topology configuration with smooth boundaries, which improved the jagged boundaries. In 2022, Liu et al. [<xref ref-type="bibr" rid="ref-6">6</xref>] employed a topological design method based on discrete variables that were based on SAIP (sequential approximate integer programming) and CRA (canonical relaxation algorithm), which helped to avoid gray elements and achieve clear 0&#x2013;1 solution in topology optimization.</p>
<p>In addition to post-processing methods, some researchers have also used mesh adaptive refinement. Adaptive mesh refinement algorithms were first proposed by Maute et al. [<xref ref-type="bibr" rid="ref-7">7</xref>] in 1995, using independent mesh analysis and smoothing algorithms. Using cubic spline or Bezier spline approximation not only reduces the number of design variables and obtains smoothed results but also can be directly combined with traditional shape optimization methods. In 2018, Thom&#x00E1;s et al. [<xref ref-type="bibr" rid="ref-8">8</xref>] used the Tyson polygonal division of the mesh to implement the adaptive strategy. They applied four numerical examples to validate the comparison between the Tyson polygonal and the complete refinement and found that the adaptive strategy was able to reduce the computation time and obtain clear material distribution and boundaries.</p>
<p>Since the level set optimization method itself can ameliorate the jagged boundary problem, many researchers have combined the method with topology optimization methods with jagged boundaries to solve the problem. In 2018, Da et al. [<xref ref-type="bibr" rid="ref-9">9</xref>] employed node sensitivity to construct a level set function to implicitly determine a smooth structural topology based on the jagged boundary problem that exists in the bidirectional asymptotic structural optimization method. In 2019, Liu et al. [<xref ref-type="bibr" rid="ref-10">10</xref>] proposed a topology optimization method using floating projection for the jagged boundary problem arising from the Bi-directional Evolutionary Structural Optimization (BESO) method, which first uses floating projection constraints to fit the intermediate density elements more closely to the 0/1 design variables, and then uses the zero contour of the level-set function to depict the boundary to obtain the result of a smooth boundary. In 2024, Muayad and Majid [<xref ref-type="bibr" rid="ref-11">11</xref>] proposed a plastic limit probability-based structural topology optimization method utilizing an extended BESO approach. Compared to traditional design methods, this method demonstrates significant improvements in terms of load-bearing capacity, stress intensity, stiffness, and yield load. G&#x00F3;mez-Silva et al. [<xref ref-type="bibr" rid="ref-12">12</xref>] implemented a novel approach to obtain the optimal volume fraction of the materials forming the structure using the BESO method. In 2020, Fu et al. [<xref ref-type="bibr" rid="ref-13">13</xref>] proposed an algorithm for the optimal design of continuum topology based on element volume fraction, which thoroughly investigated the effects of parameters, mesh sizes, and penalty coefficients in the Heaviside smoothing function on the efficiency of performance computation and topology design, and used the zero level-set function to implicitly extract smooth topological boundaries to effectively improve the jagged boundaries.</p>
<p>The development of machine learning, as well as deep learning, makes topology optimization have a lot of development space. In 2021, Yu [<xref ref-type="bibr" rid="ref-14">14</xref>], based on the method of movable deformation components for the unsmooth boundary problem, employed the convolution operator to establish the connection of the topology description functions of the mutually independent formations and utilized the radius of the convolution to control the effect of the smoothness. The topological description function uses the Kreisselmeier-Steinhauser (KS) function instead of the Max function. In 2022, Huang et al. [<xref ref-type="bibr" rid="ref-15">15</xref>] proposed a problem-independent machine learning-enhanced multiresolution topology optimization method based on the Solid Isotropic Material with Penalization (SIMP) method, which focuses on the shape function for structural finite element analysis and establishes the numerical interpolation between the density of the fine mesh elements within the coarse mesh elements and the corresponding nodes of the coarse mesh elements through machine learning implicit relationship between the shape functions.</p>
<p>The Independent Continuum Mapping (ICM) method used for modeling in this study was initially proposed by Sui and Yang [<xref ref-type="bibr" rid="ref-16">16</xref>] in 1996, which restores the independence of topological design variables by removing their dependence on dimensional optimization variables, such as material parameters or geometrical properties. The ICM method represents the presence or absence of elements in a manner that is independent of their specific physical properties. This method overcomes the difficulty encountered in variable-density approaches and similar methods to a certain extent, where it is challenging to handle multi-loading-condition problems when the objective is to optimize compliance. Topology optimization under stress, displacement, frequency, and vibration constraints for continuum structures has been investigated by Peng and others [<xref ref-type="bibr" rid="ref-17">17</xref>&#x2013;<xref ref-type="bibr" rid="ref-19">19</xref>]. Long et al. [<xref ref-type="bibr" rid="ref-20">20</xref>&#x2013;<xref ref-type="bibr" rid="ref-22">22</xref>] proposed a node-independent variable-based approach and a hybrid interpolation modeling method to study the topology optimization of a continuum under harmonic response. In 2022, Yan et al. [<xref ref-type="bibr" rid="ref-23">23</xref>] used the power function as a filtering function and investigated the effect of power exponents with different parameters on the convergence of the optimization results. In 2023, Du et al. [<xref ref-type="bibr" rid="ref-24">24</xref>] used an ICM approach to investigate the topology optimization of continuum structures under the consideration of the breakage-safety topology optimization of randomly broken structures in this case. No researcher has studied the sawtooth boundary problem for the ICM method, which also exists in the same way.</p>
<p>This study explores the jagged boundary problem of the ICM method in topology optimization. It develops a topology optimization model with minimum weight as the goal and displacement as the constraint. A new Movable Morphable Smooth Boundary (MMSB) method is proposed. The method uses a triangular mesh as the basic mesh, which can directly improve the jagged boundary in the optimization process without changing the mechanical properties of the structure.</p>
</sec>
<sec id="s2">
<label>2</label>
<title>Displacement-Constrained Topology Optimization Model Based on the ICM Method</title>
<sec id="s2_1">
<label>2.1</label>
<title>Establishment of Optimization Model</title>
<p>The topology optimization model based on the ICM (Independent Continuous and Mapping) method with weight minimization as the objective and displacement as the constraint is established as follows:
<disp-formula id="eqn-1"><label>(1)</label><mml:math id="mml-eqn-1" display="block"><mml:mrow><mml:mo>{</mml:mo><mml:mtable columnalign="left left left left" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mrow><mml:mtext>Find&#xA0;</mml:mtext></mml:mrow></mml:mtd><mml:mtd><mml:mi mathvariant="bold-italic">t</mml:mi><mml:mo>&#x2208;</mml:mo><mml:msup><mml:mi>E</mml:mi><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:msup></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mtext>Make&#xA0;</mml:mtext></mml:mrow></mml:mtd><mml:mtd><mml:mi>W</mml:mi><mml:mo>=</mml:mo><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:munderover><mml:msub><mml:mi>w</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">&#x2192;</mml:mo><mml:mo movablelimits="true" form="prefix">min</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mtext>s</mml:mtext></mml:mrow><mml:mo>.</mml:mo><mml:mrow><mml:mtext>t</mml:mtext></mml:mrow><mml:mo>.</mml:mo></mml:mtd><mml:mtd><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2264;</mml:mo><mml:msub><mml:mover><mml:mi>u</mml:mi><mml:mo accent="false">&#x00AF;</mml:mo></mml:mover><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo></mml:mrow><mml:mo>&#x2026;</mml:mo><mml:mrow><mml:mo>,</mml:mo></mml:mrow><mml:mi>J</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd /><mml:mtd><mml:mrow><mml:mn>0</mml:mn></mml:mrow><mml:mo>&#x2264;</mml:mo><mml:munder><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x005F;</mml:mo></mml:munder><mml:mo>&#x2264;</mml:mo><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2264;</mml:mo><mml:mn>1</mml:mn><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mi>N</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:math></disp-formula>where <italic>i</italic> and <italic>j</italic> are the index of design variables and the index of constraints, respectively; <italic>N</italic> and <italic>J</italic> are the total number of design variables and the total number of displacement constraints, respectively; <bold><italic>t</italic></bold> is the vector of topology design variables; <italic>t</italic><sub><italic>i</italic></sub> is the <italic>i</italic>-th variable; <inline-formula id="ieqn-1"><mml:math id="mml-ieqn-1"><mml:msup><mml:mi>E</mml:mi><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> is an <italic>N</italic>-dimensional Euclidean space; <italic>W</italic> is the weight of the structure; <italic>w</italic><sub><italic>i</italic></sub> is the weight of the <italic>i</italic>-th element; <italic>u</italic><sub><italic>j</italic></sub> is the <italic>j</italic>-th displacement constraint; <inline-formula id="ieqn-2"><mml:math id="mml-ieqn-2"><mml:msub><mml:mover><mml:mi>u</mml:mi><mml:mo accent="false">&#x00AF;</mml:mo></mml:mover><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is the upper limit of the <italic>j</italic>-th displacement constraint</p>
<p>The initial element topology variable values in the entire design domain in the topology optimization model are all 1. During the iteration process, the element topology variable will change, presenting the values as continuous values in the interval [0, 1], for which it is necessary to introduce a filtering function to achieve the transformation between the discrete topology variable and the continuous topology variable.</p>
<p>The filter functions of element weight and element stiffness in the ICM method are given in the following equations:
<disp-formula id="eqn-2"><label>(2)</label><mml:math id="mml-eqn-2" display="block"><mml:msub><mml:mi>w</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>w</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:msup><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msup><mml:mo>,</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">k</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:msup><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">k</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msup></mml:math></disp-formula>where <inline-formula id="ieqn-3"><mml:math id="mml-ieqn-3"><mml:msup><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msup></mml:math></inline-formula> and <inline-formula id="ieqn-4"><mml:math id="mml-ieqn-4"><mml:msup><mml:mrow><mml:msub><mml:mi>k</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msup></mml:math></inline-formula> are the intrinsic weight and stiffness of the <italic>i</italic>-th element, respectively; <bold><italic>k</italic></bold><sub><italic>i</italic></sub> is the element stiffness of the <italic>i</italic>-th element; <italic>f</italic><sub><italic>w</italic></sub> is the filter function for element weight; <italic>f</italic><sub><italic>k</italic></sub> is the filter function for element stiffness.</p>
<p>The rational fractional function is chosen to solve the problem, and this filter function can reduce the intermediate gray elements and also improve computational efficiency.
<disp-formula id="eqn-3"><label>(3)</label><mml:math id="mml-eqn-3" display="block"><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>w</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:msub><mml:mi>q</mml:mi><mml:mrow><mml:mi>w</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mfrac><mml:mo>,</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:msub><mml:mi>q</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mfrac></mml:math></disp-formula>where <italic>q</italic><sub><italic>w</italic></sub> is the parameter of the element weight filter function; <italic>q</italic><sub><italic>k</italic></sub> is the parameter of the element stiffness filter function; <italic>q</italic><sub><italic>w</italic></sub> &#x003D; 3 and <italic>q</italic><sub><italic>k</italic></sub> &#x003D; 63 are used in this study [<xref ref-type="bibr" rid="ref-25">25</xref>].</p>
<p>The optimization model built by introducing the filtering function becomes:
<disp-formula id="eqn-4"><label>(4)</label><mml:math id="mml-eqn-4" display="block"><mml:mrow><mml:mo>{</mml:mo><mml:mtable columnalign="left left left left" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mrow><mml:mtext>Find&#xA0;</mml:mtext></mml:mrow></mml:mtd><mml:mtd><mml:mi mathvariant="bold-italic">t</mml:mi><mml:mo>&#x2208;</mml:mo><mml:msup><mml:mi>E</mml:mi><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:msup></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mtext>Make&#xA0;</mml:mtext></mml:mrow></mml:mtd><mml:mtd><mml:mi>W</mml:mi><mml:mo>=</mml:mo><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:munderover><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>w</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:msubsup><mml:mi>w</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msubsup><mml:mo stretchy="false">&#x2192;</mml:mo><mml:mo movablelimits="true" form="prefix">min</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mtext>s</mml:mtext></mml:mrow><mml:mo>.</mml:mo><mml:mrow><mml:mtext>t</mml:mtext></mml:mrow><mml:mo>.</mml:mo></mml:mtd><mml:mtd><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2264;</mml:mo><mml:msub><mml:mover><mml:mi>u</mml:mi><mml:mo accent="false">&#x00AF;</mml:mo></mml:mover><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo></mml:mrow><mml:mo>&#x2026;</mml:mo><mml:mrow><mml:mo>,</mml:mo></mml:mrow><mml:mspace width="thinmathspace" /><mml:mi>J</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd /><mml:mtd><mml:mrow><mml:mn>0</mml:mn></mml:mrow><mml:mo>&#x2264;</mml:mo><mml:munder><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x005F;</mml:mo></mml:munder><mml:mo>&#x2264;</mml:mo><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2264;</mml:mo><mml:mn>1</mml:mn><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mi>N</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:math></disp-formula></p>
</sec>
<sec id="s2_2">
<label>2.2</label>
<title>Explicitation of Displacement Constraint</title>
<p>Based on Mohr&#x2019;s principle, the generalized displacement of any node in the given direction of the structure can be seen as follows:
<disp-formula id="eqn-5"><label>(5)</label><mml:math id="mml-eqn-5" display="block"><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:munderover><mml:mo>&#x222B;</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">&#x03C3;</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mrow><mml:mtext>V</mml:mtext></mml:mrow></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mrow><mml:mtext>T</mml:mtext></mml:mrow></mml:mrow></mml:msup><mml:msup><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">&#x03B5;</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mi>J</mml:mi></mml:mrow></mml:msup><mml:mrow><mml:mtext>d</mml:mtext></mml:mrow><mml:mi>v</mml:mi></mml:math></disp-formula>where <inline-formula id="ieqn-5"><mml:math id="mml-ieqn-5"><mml:msup><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">&#x03C3;</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mrow><mml:mtext>V</mml:mtext></mml:mrow></mml:mrow></mml:msup></mml:math></inline-formula> is the stress vector of the element <italic>i</italic> by applying one element of imaginary load in the <italic>u</italic><sub><italic>j</italic></sub> displacement direction; <inline-formula id="ieqn-6"><mml:math id="mml-ieqn-6"><mml:msup><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">&#x03B5;</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mi>J</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> is the strain vector of the element <italic>i</italic> by applying real load.</p>
<p>Based on the principle of virtual work mentioned in &#x201C;the work done by the external force on the virtual displacement is equal to the virtual work done by the internal force on the virtual deformation caused by the virtual displacement&#x201D;, it can be obtained as follows:
<disp-formula id="eqn-6"><label>(6)</label><mml:math id="mml-eqn-6" display="block"><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:munderover><mml:mo>&#x222B;</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">&#x03C3;</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mrow><mml:mtext>V</mml:mtext></mml:mrow></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mrow><mml:mtext>T</mml:mtext></mml:mrow></mml:mrow></mml:msup><mml:msup><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">&#x03B5;</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mi>J</mml:mi></mml:mrow></mml:msup><mml:mrow><mml:mtext>d</mml:mtext></mml:mrow><mml:mi>v</mml:mi><mml:mo>=</mml:mo><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:munderover><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">u</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mrow><mml:mtext>V</mml:mtext></mml:mrow></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mrow><mml:mtext>T</mml:mtext></mml:mrow></mml:mrow></mml:msup><mml:msup><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">F</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mi>J</mml:mi></mml:mrow></mml:msup></mml:math></disp-formula>where <inline-formula id="ieqn-7"><mml:math id="mml-ieqn-7"><mml:msup><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">u</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mrow><mml:mtext>V</mml:mtext></mml:mrow></mml:mrow></mml:msup></mml:math></inline-formula> is the imaginary displacement; <inline-formula id="ieqn-8"><mml:math id="mml-ieqn-8"><mml:msup><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">F</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mi>J</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> is the force vector of the element node under real load.</p>
<p><xref ref-type="disp-formula" rid="eqn-6">Eq. (6)</xref> can be described as the following equation using the overall stiffness equation of Finite Element Analysis (FEA):
<disp-formula id="eqn-7"><label>(7)</label><mml:math id="mml-eqn-7" display="block"><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:munderover><mml:mo>&#x222B;</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">&#x03C3;</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mrow><mml:mtext>V</mml:mtext></mml:mrow></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mrow><mml:mtext>T</mml:mtext></mml:mrow></mml:mrow></mml:msup><mml:msup><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">&#x03B5;</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mi>J</mml:mi></mml:mrow></mml:msup><mml:mrow><mml:mtext>d</mml:mtext></mml:mrow><mml:mi>v</mml:mi><mml:mo>=</mml:mo><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:munderover><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">F</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mi>J</mml:mi></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mrow><mml:mtext>T</mml:mtext></mml:mrow></mml:mrow></mml:msup><mml:msup><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">u</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mrow><mml:mtext>V</mml:mtext></mml:mrow></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:munderover><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">F</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mi>J</mml:mi></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mrow><mml:mtext>T</mml:mtext></mml:mrow></mml:mrow></mml:msup><mml:msubsup><mml:mi mathvariant="bold-italic">k</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msubsup><mml:msup><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">F</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mrow><mml:mtext>V</mml:mtext></mml:mrow></mml:mrow></mml:msup></mml:math></disp-formula>where <inline-formula id="ieqn-9"><mml:math id="mml-ieqn-9"><mml:msup><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">F</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mrow><mml:mtext>V</mml:mtext></mml:mrow></mml:mrow></mml:msup></mml:math></inline-formula> is the element node force vector under the imaginary load.</p>
<p>Introducing a filter function establishes the following explicit expression for the displacement constraint when proceeding to the first iteration:
<disp-formula id="eqn-8"><label>(8)</label><mml:math id="mml-eqn-8" display="block"><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:munderover><mml:mfrac><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msubsup><mml:mi>t</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>v</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mfrac><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:msubsup><mml:mi mathvariant="bold-italic">F</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>J</mml:mi></mml:mrow></mml:msubsup><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mrow><mml:mtext>T</mml:mtext></mml:mrow></mml:mrow></mml:msup><mml:msubsup><mml:mi mathvariant="bold-italic">u</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mtext>v</mml:mtext></mml:mrow></mml:mrow></mml:msubsup></mml:math></disp-formula></p>
<p>Assuming
<disp-formula id="eqn-9"><label>(9)</label><mml:math id="mml-eqn-9" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd /><mml:mtd><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:msubsup><mml:mi mathvariant="bold-italic">F</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>J</mml:mi></mml:mrow></mml:msubsup><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mrow><mml:mtext>T</mml:mtext></mml:mrow></mml:mrow></mml:msup><mml:msubsup><mml:mi mathvariant="bold-italic">u</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mtext>v</mml:mtext></mml:mrow></mml:mrow></mml:msubsup></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="eqn-10"><label>(10)</label><mml:math id="mml-eqn-10" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd /><mml:mtd><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msubsup><mml:mi>t</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>v</mml:mi></mml:mrow></mml:msubsup><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula></p>
<p>The explicit expression for the optimization model is as follows:
<disp-formula id="eqn-11"><label>(11)</label><mml:math id="mml-eqn-11" display="block"><mml:mrow><mml:mo>{</mml:mo><mml:mtable columnalign="left left left left" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mrow><mml:mtext>Find</mml:mtext></mml:mrow></mml:mtd><mml:mtd><mml:mi mathvariant="bold-italic">t</mml:mi><mml:mo>&#x2208;</mml:mo><mml:msup><mml:mi>E</mml:mi><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:msup></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mtext>Make</mml:mtext></mml:mrow></mml:mtd><mml:mtd><mml:mi>W</mml:mi><mml:mo>=</mml:mo><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:munderover><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>w</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:msubsup><mml:mi>w</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msubsup><mml:mo stretchy="false">&#x2192;</mml:mo><mml:mo movablelimits="true" form="prefix">min</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mtext>s</mml:mtext></mml:mrow><mml:mo>.</mml:mo><mml:mrow><mml:mtext>t</mml:mtext></mml:mrow><mml:mo>.</mml:mo></mml:mtd><mml:mtd><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:munderover><mml:mfrac><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mfrac><mml:mo>&#x2264;</mml:mo><mml:msub><mml:mover><mml:mi>u</mml:mi><mml:mo accent="false">&#x00AF;</mml:mo></mml:mover><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x22EF;</mml:mo><mml:mo>,</mml:mo><mml:mi>J</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd /><mml:mtd><mml:mn>0</mml:mn><mml:mo>&#x2264;</mml:mo><mml:munder><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x005F;</mml:mo></mml:munder><mml:mo>&#x2264;</mml:mo><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2264;</mml:mo><mml:mn>1</mml:mn><mml:mspace width=".5em" /><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x22EF;</mml:mo><mml:mo>,</mml:mo><mml:mi>N</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>If the design variables<inline-formula id="ieqn-10"><mml:math id="mml-ieqn-10"><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>, the second-order Taylor approximate expansion of the objective function, and omit the constant term, the following mathematical model of quadratic programming can be derived:
<disp-formula id="eqn-12"><label>(12)</label><mml:math id="mml-eqn-12" display="block"><mml:mrow><mml:mo>{</mml:mo><mml:mtable columnalign="left left left left" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mrow><mml:mtext>Find&#xA0;</mml:mtext></mml:mrow></mml:mtd><mml:mtd><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mo>&#x2208;</mml:mo><mml:msup><mml:mi>E</mml:mi><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:msup></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mtext>Make</mml:mtext></mml:mrow><mml:mspace width="thinmathspace" /></mml:mtd><mml:mtd><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:munderover><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msubsup><mml:mo>)</mml:mo></mml:mrow><mml:msubsup><mml:mi>w</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msubsup><mml:mo stretchy="false">&#x2192;</mml:mo><mml:mo movablelimits="true" form="prefix">min</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mtext>s</mml:mtext></mml:mrow><mml:mo>.</mml:mo><mml:mrow><mml:mtext>t</mml:mtext></mml:mrow><mml:mo>.</mml:mo></mml:mtd><mml:mtd><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:munderover><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2264;</mml:mo><mml:mover><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo accent="false">&#x00AF;</mml:mo></mml:mover><mml:mrow><mml:mo>(</mml:mo><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mi>J</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd /><mml:mtd><mml:mn>1</mml:mn><mml:mo>&#x2264;</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2264;</mml:mo><mml:mover><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo accent="false">&#x00AF;</mml:mo></mml:mover><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mi>N</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:math></disp-formula>where <italic>a</italic><sub><italic>i</italic></sub> and <italic>b</italic><sub><italic>i</italic></sub> are the coefficients of the second-order Taylor approximation of the objective.</p>
<p>This is obtained by substituting the rational fractional filtered functional form into <xref ref-type="disp-formula" rid="eqn-12">Eq. (12)</xref>:
<disp-formula id="eqn-13"><label>(13)</label><mml:math id="mml-eqn-13" display="block"><mml:mrow><mml:mo>{</mml:mo><mml:mtable columnalign="left left left left" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mrow><mml:mtext>Find&#xA0;</mml:mtext></mml:mrow></mml:mtd><mml:mtd><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mo>&#x2208;</mml:mo><mml:msup><mml:mi>E</mml:mi><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:msup></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mtext>Make</mml:mtext></mml:mrow><mml:mspace width="thinmathspace" /></mml:mtd><mml:mtd><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:munderover><mml:mfrac><mml:mrow><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:msub><mml:mi>q</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:msub><mml:mi>q</mml:mi><mml:mrow><mml:mi>w</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>q</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>q</mml:mi><mml:mrow><mml:mi>w</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mfrac><mml:msubsup><mml:mi>w</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msubsup><mml:mo stretchy="false">&#x2192;</mml:mo><mml:mo movablelimits="true" form="prefix">min</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mtext>s</mml:mtext></mml:mrow><mml:mo>.</mml:mo><mml:mrow><mml:mtext>t</mml:mtext></mml:mrow><mml:mo>.</mml:mo></mml:mtd><mml:mtd><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:munderover><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2264;</mml:mo><mml:mover><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo accent="false">&#x00AF;</mml:mo></mml:mover><mml:mrow><mml:mo>(</mml:mo><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mi>J</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd /><mml:mtd><mml:mn>1</mml:mn><mml:mo>&#x2264;</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2264;</mml:mo><mml:mover><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo accent="false">&#x00AF;</mml:mo></mml:mover><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mi>N</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>Since the objective function in <xref ref-type="disp-formula" rid="eqn-13">Eq. (13)</xref> is also more complicated for its direct second-order Taylor expansion, first- and second-order derivations of the objective function are obtained:
<disp-formula id="eqn-14"><label>(14)</label><mml:math id="mml-eqn-14" display="block"><mml:msubsup><mml:mi>f</mml:mi><mml:mrow><mml:mi>w</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:msup><mml:mrow><mml:mo>[</mml:mo><mml:mfrac><mml:mrow><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:msub><mml:mi>q</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:msub><mml:mi>q</mml:mi><mml:mrow><mml:mi>w</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>q</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>q</mml:mi><mml:mrow><mml:mi>w</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mfrac><mml:mo>]</mml:mo></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:msub><mml:mi>q</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:msub><mml:mi>q</mml:mi><mml:mrow><mml:mi>w</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:msup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:msub><mml:mi>q</mml:mi><mml:mrow><mml:mi>w</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>q</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>q</mml:mi><mml:mrow><mml:mi>w</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:mfrac></mml:math></disp-formula>
<disp-formula id="eqn-15"><label>(15)</label><mml:math id="mml-eqn-15" display="block"><mml:msubsup><mml:mi>f</mml:mi><mml:mrow><mml:mi>w</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:msup><mml:mrow><mml:mo>[</mml:mo><mml:mfrac><mml:mrow><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:msub><mml:mi>q</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:msub><mml:mi>q</mml:mi><mml:mrow><mml:mi>w</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>q</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>q</mml:mi><mml:mrow><mml:mi>w</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mfrac><mml:mo>]</mml:mo></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mn>2</mml:mn><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:msub><mml:mi>q</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:msub><mml:mi>q</mml:mi><mml:mrow><mml:mi>w</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:mrow><mml:msup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:msub><mml:mi>q</mml:mi><mml:mrow><mml:mi>w</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>q</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>q</mml:mi><mml:mrow><mml:mi>w</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msup></mml:mfrac></mml:math></disp-formula></p>
<p>The following can be obtained from the second-order Taylor approximation of the objective function in <xref ref-type="disp-formula" rid="eqn-13">Eq. (13)</xref>:
<disp-formula id="eqn-16"><label>(16)</label><mml:math id="mml-eqn-16" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd /><mml:mtd><mml:mn>2</mml:mn><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msubsup><mml:mi>f</mml:mi><mml:mrow><mml:mi>w</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="eqn-17"><label>(17)</label><mml:math id="mml-eqn-17" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd /><mml:mtd><mml:mn>2</mml:mn><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msubsup><mml:mi>f</mml:mi><mml:mrow><mml:mi>w</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula></p>
<p>Substituting the specific formulas for the first-order derivatives as well as the second-order derivatives, i.e., Substituting <xref ref-type="disp-formula" rid="eqn-15">Eq. (15)</xref> and <xref ref-type="disp-formula" rid="eqn-16">(16)</xref> into <xref ref-type="disp-formula" rid="eqn-17">Eqs. (17)</xref> and <xref ref-type="disp-formula" rid="eqn-18">(18)</xref>:
<disp-formula id="eqn-18"><label>(18)</label><mml:math id="mml-eqn-18" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd /><mml:mtd><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:msub><mml:mi>q</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:msub><mml:mi>q</mml:mi><mml:mrow><mml:mi>w</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mo>[</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mn>3</mml:mn><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:msub><mml:mi>q</mml:mi><mml:mrow><mml:mi>w</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:msup><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>v</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msup><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>q</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>q</mml:mi><mml:mrow><mml:mi>w</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:mrow><mml:msup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:msub><mml:mi>q</mml:mi><mml:mrow><mml:mi>w</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:msup><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>v</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>q</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>q</mml:mi><mml:mrow><mml:mi>w</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msup></mml:mfrac></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="eqn-19"><label>(19)</label><mml:math id="mml-eqn-19" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd /><mml:mtd><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:msub><mml:mi>q</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:msub><mml:mi>q</mml:mi><mml:mrow><mml:mi>w</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:mrow><mml:msup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:msub><mml:mi>q</mml:mi><mml:mrow><mml:mi>w</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>q</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>q</mml:mi><mml:mrow><mml:mi>w</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msup></mml:mfrac></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula></p>
</sec>
<sec id="s2_3">
<label>2.3</label>
<title>Solution of the Optimization Model</title>
<p>Since the number of design variables in <xref ref-type="disp-formula" rid="eqn-13">Eq. (13)</xref> is much larger than the number of constraints in the displacement-constrained topology optimization model, <xref ref-type="disp-formula" rid="eqn-13">Eq. (13)</xref> is transformed into a dual optimization problem [<xref ref-type="bibr" rid="ref-26">26</xref>] as shown in the following equation to reduce the computational effort to solve it with the dual sequence quadratic programming algorithm:
<disp-formula id="eqn-20"><label>(20)</label><mml:math id="mml-eqn-20" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd /><mml:mtd><mml:mrow><mml:mo>{</mml:mo><mml:mtable columnalign="left left left" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mrow><mml:mtext>Find</mml:mtext></mml:mrow><mml:mspace width="thinmathspace" /></mml:mtd><mml:mtd><mml:mi mathvariant="bold-italic">&#x03BB;</mml:mi><mml:mo>&#x2208;</mml:mo><mml:msup><mml:mi>E</mml:mi><mml:mrow><mml:mi>J</mml:mi></mml:mrow></mml:msup></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mtext>Make</mml:mtext></mml:mrow><mml:mspace width="thinmathspace" /></mml:mtd><mml:mtd><mml:mi mathvariant="normal">&#x03A6;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">&#x03BB;</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo stretchy="false">&#x2192;</mml:mo><mml:mo movablelimits="true" form="prefix">max</mml:mo><mml:mspace width="1em" /><mml:mspace width="1em" /><mml:mspace width="thinmathspace" /><mml:mspace width="thinmathspace" /></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mtext>s</mml:mtext></mml:mrow><mml:mo>.</mml:mo><mml:mrow><mml:mtext>t</mml:mtext></mml:mrow><mml:mo>.</mml:mo><mml:mspace width="thinmathspace" /></mml:mtd><mml:mtd><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2265;</mml:mo><mml:mn>0</mml:mn><mml:mrow><mml:mo>(</mml:mo><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mi>J</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="eqn-21"><label>(21)</label><mml:math id="mml-eqn-21" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd /><mml:mtd><mml:mi mathvariant="normal">&#x03A6;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">&#x03BB;</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:munder><mml:mo movablelimits="true" form="prefix">min</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>&#x2264;</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2264;</mml:mo><mml:mover><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo accent="false">&#x00AF;</mml:mo></mml:mover></mml:mrow></mml:munder><mml:mrow><mml:mo>(</mml:mo><mml:mi>L</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant="bold-italic">&#x03BB;</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="eqn-22"><label>(22)</label><mml:math id="mml-eqn-22" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd /><mml:mtd><mml:mi>L</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant="bold-italic">&#x03BB;</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:munderover><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msubsup><mml:mo>+</mml:mo><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>J</mml:mi></mml:mrow></mml:munderover><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:munderover><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula></p>
<p>After the second-order Taylor approximation of the objective function <inline-formula id="ieqn-11"><mml:math id="mml-ieqn-11"><mml:mi mathvariant="normal">&#x03A6;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">&#x03BB;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> and the omission of the constant term, a new quadratic programming model is obtained as follows:
<disp-formula id="eqn-23"><label>(23)</label><mml:math id="mml-eqn-23" display="block"><mml:mrow><mml:mo>{</mml:mo><mml:mtable columnalign="left left left left" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mrow><mml:mtext>Find</mml:mtext></mml:mrow><mml:mspace width="thinmathspace" /></mml:mtd><mml:mtd><mml:mi mathvariant="bold-italic">&#x03BB;</mml:mi><mml:mo>&#x2208;</mml:mo><mml:msup><mml:mi>E</mml:mi><mml:mrow><mml:mi>J</mml:mi></mml:mrow></mml:msup></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mtext>Make</mml:mtext></mml:mrow><mml:mspace width="thinmathspace" /></mml:mtd><mml:mtd><mml:mo>&#x2212;</mml:mo><mml:mi mathvariant="normal">&#x03A6;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">&#x03BB;</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mn>2</mml:mn></mml:mfrac><mml:msup><mml:mi mathvariant="bold-italic">&#x03BB;</mml:mi><mml:mrow><mml:mrow><mml:mtext>T</mml:mtext></mml:mrow></mml:mrow></mml:msup><mml:mi mathvariant="bold-italic">D</mml:mi><mml:mi mathvariant="bold-italic">&#x03BB;</mml:mi><mml:mo>+</mml:mo><mml:msup><mml:mi mathvariant="bold-italic">H</mml:mi><mml:mrow><mml:mrow><mml:mtext>T</mml:mtext></mml:mrow></mml:mrow></mml:msup><mml:mi mathvariant="bold-italic">&#x03BB;</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo><mml:mo movablelimits="true" form="prefix">min</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mtext>s</mml:mtext></mml:mrow><mml:mo>.</mml:mo><mml:mrow><mml:mtext>t</mml:mtext></mml:mrow><mml:mo>.</mml:mo></mml:mtd><mml:mtd><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2265;</mml:mo><mml:mn>0</mml:mn><mml:mrow><mml:mo>(</mml:mo><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mi>J</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:math></disp-formula>where
<disp-formula id="eqn-24"><label>(24)</label><mml:math id="mml-eqn-24" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd /><mml:mtd><mml:msub><mml:mi>D</mml:mi><mml:mrow><mml:mi>j</mml:mi><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:munderover><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mfrac><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mn>2</mml:mn><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfrac></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="eqn-25"><label>(25)</label><mml:math id="mml-eqn-25" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd /><mml:mtd><mml:msub><mml:mi>H</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mo>&#x2212;</mml:mo><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:munderover><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x2217;</mml:mo></mml:mrow></mml:msubsup><mml:mo>+</mml:mo><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:munder><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x2208;</mml:mo><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:munder><mml:mfrac><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mn>2</mml:mn><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfrac><mml:mrow><mml:mo>(</mml:mo><mml:mn>2</mml:mn><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x2217;</mml:mo></mml:mrow></mml:msubsup><mml:mo>+</mml:mo><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula></p>
<p>It is sufficient to solve using the sequential quadratic programming algorithm until the convergence condition of the following equation is satisfied.<disp-formula id="eqn-26"><label>(26)</label><mml:math id="mml-eqn-26" display="block"><mml:mrow><mml:mi mathvariant="normal">&#x0394;</mml:mi></mml:mrow><mml:mi>W</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mfrac><mml:mrow><mml:msup><mml:mi>W</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03BD;</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msup><mml:mo>&#x2212;</mml:mo><mml:msup><mml:mi>W</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03BD;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msup></mml:mrow><mml:msup><mml:mi>W</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03BD;</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msup></mml:mfrac><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mo>&#x2264;</mml:mo><mml:mi>&#x03B5;</mml:mi></mml:math></disp-formula>where <inline-formula id="ieqn-12"><mml:math id="mml-ieqn-12"><mml:msup><mml:mi>W</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03BD;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msup></mml:math></inline-formula> and <italic>W</italic><sup><italic>(v&#x002B;1)</italic></sup> are the total weight of the structure for the previous and current iterations; <inline-formula id="ieqn-13"><mml:math id="mml-ieqn-13"><mml:mi>&#x03B5;</mml:mi></mml:math></inline-formula> is the convergence accuracy. The value of <inline-formula id="ieqn-14"><mml:math id="mml-ieqn-14"><mml:mi>&#x03B5;</mml:mi></mml:math></inline-formula> used in the examples of this study is 0.001.</p>
</sec>
</sec>
<sec id="s3">
<label>3</label>
<title>A Topology Optimization Framework for Moving Morphable Smooth Boundary</title>
<sec id="s3_1">
<label>3.1</label>
<title> Moving Morphable Smooth Boundary Method</title>
<p>In previous topology optimization efforts utilizing the ICM method, a quadrilateral mesh usually served as the base mesh, often resulting in jagged boundaries that hinder manufacturability. The ICM topology optimization relies on finite element analysis, where meshing is crucial, as each element functions as a topological variable. Mesh delineation involves converting the physical model into a mathematical representation, and traditional quadrilateral meshing tends to exacerbate the issue of jagged boundaries. Therefore, employing a free mesh delineation approach, typically using triangular elements, presents a viable alternative.</p>
<p>This study proposes a novel topology optimization method known as Movable Morphable Smooth Boundary (MMSB), which primarily utilizes the triangle mesh as the base mesh due to its inherent flexibility and ease of deformation. The specific steps of the method are illustrated in the flow chart presented in <xref ref-type="fig" rid="fig-1">Fig. 1</xref>. Initially, the triangle elements are treated as topology variables, with a threshold value, <italic>h</italic>, to be set as 0.5. With a Patran Command Language (PCL) program subscribed to the MSC. Patran &#x0026; Nastran software, elements whose topology variables exceed the threshold are identified, and then common edges between these elements are checked. If a common edge is found, an interpolation method is applied to create threshold points based on individual elements. Then, the number of these threshold points is adjusted to ensure continuity. The Loft multipoint curve in the spline curve method is then utilized to connect the points, forming a curve that represents the contour corresponding to the threshold value of 0.5. Finally, the mesh is redrawn along this contour.</p>
<fig id="fig-1">
<label>Figure 1</label>
<caption>
<title>Flowchart of the Moving Morphable Smooth Boundary (MMSB) method</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_66676-fig-1.tif"/>
</fig>
<p>The whole optimization process is shown in <xref ref-type="fig" rid="fig-2">Fig. 2</xref>, with six main steps. First, establish the initial finite element model, determine the geometric parameters of the model (length, width, thickness), material parameters (Poisson&#x2019;s ratio, modulus of elasticity), mesh element size, displacement boundary conditions, and load boundary conditions; second, set the optimization parameters, which mainly include the value of the displacement constraints and the accuracy of the convergence; third, use the ICM topology optimization method combined with the finite element analysis to perform the optimization iteration and structural analysis; Fourth, determine whether the optimization iteration to the fourth step, if the iteration to the fourth step to find the threshold <italic>h</italic> value of 0.5 contour and along the curve for the mesh re-division, which is the first time the boundary line; Fifth, on the basis of a new round of finite element structural analysis and optimization iteration; Sixth, the number of iterations in the second optimization iteration is increased by four steps on the basis of the first optimization, to observe whether the boundary is smooth and similar to the first boundary, if similar and smooth to meet the convergence that is the end of the iteration, and output the topological map.</p>
<fig id="fig-2">
<label>Figure 2</label>
<caption>
<title>Overall optimization flow chart</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_66676-fig-2.tif"/>
</fig>
</sec>
<sec id="s3_2">
<label>3.2</label>
<title> Threshold Point</title>
<p>Since the topology optimization needs to be operated by the finite element method, it needs to be applied to the finite element software platform for the study, and this study mainly uses the PCL language in the MSC. Patran and Nastran software for the study. The study of the Movable Morphable Smooth Boundary method mainly involves the selection of threshold points because only by finding the corresponding threshold points can the connection of curves be achieved to form the contour and ultimately realize the smoothness of the boundary.</p>
<p>Threshold points are selected as shown in <xref ref-type="fig" rid="fig-3">Fig. 3</xref>. The red triangular elements represent the elements with topological values located at [0.5, 1], and the white triangular grids represent the elements with topological values located at [0, 0.5]. Points A and B represent the center of the two grids, and the topological value of the point is the topological value of the element. The topological value of the point is the topological value of the element, and the topological value of the point is interpolated using interpolation to find the threshold point between the line segments AB, and the default threshold point is 0.5.</p>
<fig id="fig-3">
<label>Figure 3</label>
<caption>
<title>Introduction to the threshold points of the triangular mesh</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_66676-fig-3.tif"/>
</fig>
<p>The coordinates of the threshold point are mainly found using interpolation. Assume that the point whose topological value is greater than 0.5 is B(<italic>x</italic><sub>1</sub>, <italic>y</italic><sub>1</sub>, 0), and the point whose topological value is less than 0.5 is A(<italic>x</italic><sub>2</sub>, <italic>y</italic><sub>2</sub>, 0). Then, the coordinates of a point between these two points are expressed as follows:<disp-formula id="eqn-27"><label>(27)</label><mml:math id="mml-eqn-27" display="block"><mml:mrow><mml:mo>{</mml:mo><mml:mtable columnalign="left" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:mi>m</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>n</mml:mi></mml:mrow></mml:mfrac></mml:mstyle><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>m</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>h</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>h</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>n</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>]</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:mi>m</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>n</mml:mi></mml:mrow></mml:mfrac></mml:mstyle><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>m</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>h</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>h</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>n</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>]</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:math></disp-formula>where <italic>h</italic> is a threshold value; <italic>m</italic> is a topology value that is greater than or equal to the threshold value; <italic>n</italic> is a topology value that is less than the threshold value. Thus <italic>n</italic> &#x003C; <italic>h</italic> &#x003C; <italic>m</italic>.</p>
</sec>
</sec>
<sec id="s4">
<label>4</label>
<title>Numerical Examples</title>
<sec id="s4_1">
<label>4.1</label>
<title> Numerical Example 1</title>
<p>Example 1: The planar body base structure shown in <xref ref-type="fig" rid="fig-4">Fig. 4</xref> has dimensions of 100 &#x00D7; 200 &#x00D7; 6 mm, the finite element model is shown in <xref ref-type="fig" rid="fig-5">Fig. 5</xref>. The modulus of elasticity of the material is 68.89 GPa, Poisson&#x2019;s ratio is 0.3, and the centralized load <italic>F</italic> &#x003D; 15.6 kN acts on the midpoint of the right boundary, and the left boundary is fixed constraint. The displacement constraint is that the vertical downward displacement of the loaded point is less than or equal to 0.5 mm. The mesh is a three-node triangular element.</p>
<fig id="fig-4">
<label>Figure 4</label>
<caption>
<title>Basic structure</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_66676-fig-4.tif"/>
</fig><fig id="fig-5">
<label>Figure 5</label>
<caption>
<title>Finite element model</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_66676-fig-5.tif"/>
</fig>
<p>The final topological configuration is shown in <xref ref-type="fig" rid="fig-6">Fig. 6</xref> without using the Movable Morphable Smooth Boundary (MMSB) topology optimization method, and after inversion is shown in <xref ref-type="fig" rid="fig-7">Fig. 7</xref>, and the weight and displacement curves of the structure after inversion are shown in <xref ref-type="fig" rid="fig-8">Figs. 8</xref> and <xref ref-type="fig" rid="fig-9">9</xref>. The mesh re-division is conducted to obtain the boundary shifting diagram, as shown in <xref ref-type="fig" rid="fig-10">Fig. 10</xref>. There is almost no change from the fourth time when the fifth boundary shifting is conducted. The boundary smoothness is more obvious, so the convergence condition is reached after the fifth boundary shifting, and the final topological configuration is shown in <xref ref-type="fig" rid="fig-11">Fig. 11</xref>.</p>
<fig id="fig-6">
<label>Figure 6</label>
<caption>
<title>Topological figure without Moving Morphable Smooth Boundary method</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_66676-fig-6.tif"/>
</fig><fig id="fig-7">
<label>Figure 7</label>
<caption>
<title>Topological configuration after inversion</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_66676-fig-7.tif"/>
</fig><fig id="fig-8">
<label>Figure 8</label>
<caption>
<title>Weight iteration curve after inversion of conventional optimization for calculation example 1</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_66676-fig-8.tif"/>
</fig><fig id="fig-9">
<label>Figure 9</label>
<caption>
<title>Displacement iteration curve after inversion of conventional optimization for calculation example 1</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_66676-fig-9.tif"/>
</fig><fig id="fig-10">
<label>Figure 10</label>
<caption>
<title>Five boundary shifts</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_66676-fig-10.tif"/>
</fig><fig id="fig-11">
<label>Figure 11</label>
<caption>
<title>Final topological configuration of the MMSB approach</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_66676-fig-11.tif"/>
</fig>
<p>The final topological configuration obtained in the literature [<xref ref-type="bibr" rid="ref-27">27</xref>] using a traditional quadrilateral mesh is shown in <xref ref-type="fig" rid="fig-12">Fig. 12</xref>. The five boundary movement changes in example 1 indicate that the boundary of the fifth time is relatively smooth. There is almost no change with the topological configuration of the fourth time so that the convergence condition can be reached. The weight iteration curve obtained from the five boundaries is shown in <xref ref-type="fig" rid="fig-13">Fig. 13</xref>, and the final converged weight is 22.5 kg. Comparing the results of the method without Movable Morphable Smooth Boundary (MMSB) and the results of the method, as listed in <xref ref-type="table" rid="table-1">Table 1</xref>, indicates that the boundary using the MMSB method is smooth enough to facilitate direct manufacturing at a later stage. The boundary using the MMSB method is smooth enough to facilitate direct fabrication at a later stage.</p>
<fig id="fig-12">
<label>Figure 12</label>
<caption>
<title>Traditional optimization results from the literature [<xref ref-type="bibr" rid="ref-27">27</xref>]</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_66676-fig-12.tif"/>
</fig><fig id="fig-13">
<label>Figure 13</label>
<caption>
<title>Five iterative curves for the weight of the MMSB</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_66676-fig-13.tif"/>
</fig><table-wrap id="table-1">
<label>Table 1</label>
<caption>
<title>Comparison results of different optimization methods</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th>Methods</th>
<th>Whether the boundary is smooth or not</th>
</tr>
</thead>
<tbody>
<tr>
<td>MMSB</td>
<td>Yes</td>
</tr>
<tr>
<td>Without using MMSB</td>
<td>No</td>
</tr>
<tr>
<td>literature [<xref ref-type="bibr" rid="ref-27">27</xref>]</td>
<td>No</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="s4_2">
<label>4.2</label>
<title>4.2 Numerical Example 2</title>
<p>Example 2: The base structure shown in <xref ref-type="fig" rid="fig-14">Fig. 14</xref> is 520 &#x00D7; 260 &#x00D7; 6 mm, and to reduce the computational amount of the symmetric structure is used for the analysis, its symmetric base structure is shown in <xref ref-type="fig" rid="fig-15">Fig. 15</xref>, and the finite element model is illustrated in <xref ref-type="fig" rid="fig-16">Fig. 16</xref>. The modulus of elasticity of the material is 68.89 GPa, Poisson&#x2019;s ratio is 0.3, and the centralized load <italic>P</italic> &#x003D; 21 kN acts at the midpoint of the lower boundary, and the structure is hinged at the lower left corner and simply supported at the lower right corner. The displacement constraint is that the vertical downward displacement of the loaded point is less than or equal to 0.8 mm.</p>
<fig id="fig-14">
<label>Figure 14</label>
<caption>
<title>Basic structure</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_66676-fig-14.tif"/>
</fig><fig id="fig-15">
<label>Figure 15</label>
<caption>
<title>Symmetrical basic structure</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_66676-fig-15.tif"/>
</fig><fig id="fig-16">
<label>Figure 16</label>
<caption>
<title>Example 2 Finite element model</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_66676-fig-16.tif"/>
</fig>
<p>A total of eight boundary shifts in Example 2 are performed using the MMSB method, and after the eighth boundary shift, the boundary shift is more similar to the seventh boundary shift, and the overall boundary of the eighth shift is smoother so that the conditions for convergence can be achieved. The topology graph with a smooth boundary containing only 0&#x2013;1 is finally obtained, and the iterative curves of the weight of the structure with eight boundary shifts are shown in <xref ref-type="fig" rid="fig-17">Fig. 17</xref>. The weight of the structure is 101.4 kg after the final convergence, and the topology graph with smoother boundary is illustrated in <xref ref-type="fig" rid="fig-18">Fig. 18</xref>. The mesh re-division is conducted to obtain the boundary shifting diagram as shown in <xref ref-type="fig" rid="fig-19">Fig. 19</xref>.</p>
<fig id="fig-17">
<label>Figure 17</label>
<caption>
<title>Eight iterative curves for weight of Movable Morphable Smooth Boundary</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_66676-fig-17.tif"/>
</fig><fig id="fig-18">
<label>Figure 18</label>
<caption>
<title>Final topological configuration of the MMSB method in example 2</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_66676-fig-18.tif"/>
</fig><fig id="fig-19">
<label>Figure 19</label>
<caption>
<title>Eight boundary shifts</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_66676-fig-19.tif"/>
</fig>
<p>Since the example uses a symmetric structure, the overall weight of the structure should be doubled for the original structure. The results obtained by optimizing the traditional topology and the results obtained using the MMSB method using mirror symmetry are shown in <xref ref-type="fig" rid="fig-20">Figs. 20</xref> and <xref ref-type="fig" rid="fig-21">21</xref>, respectively, and the results based on the quadrilateral mesh in the literature [<xref ref-type="bibr" rid="ref-27">27</xref>] are depicted in <xref ref-type="fig" rid="fig-22">Fig. 22</xref>. The topology diagrams obtained by comparing the three approaches demonstrate that the topological configurations obtained by using the triangular mesh but not using the MMSB method are different from the results obtained by using the MMSB method as well as based on the results obtained by using the quadrilateral mesh in the literature [<xref ref-type="bibr" rid="ref-28">28</xref>], which is attributed to the existence of laziness in the mesh. However, it can be appropriately ignored. The results obtained from the three methods are compared as listed in <xref ref-type="table" rid="table-2">Table 2</xref>, where the weight of the structure is the overall structural mass after mirroring. The results obtained by using the MMSB method are smoother, which is favorable for direct fabrication at a later stage, and it also shows that the MMSB method is a very effective method to improve the jagged boundary.</p>
<fig id="fig-20">
<label>Figure 20</label>
<caption>
<title>Symmetry diagram without MMSB method in example 2</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_66676-fig-20.tif"/>
</fig><fig id="fig-21">
<label>Figure 21</label>
<caption>
<title>Symmetry diagram of the MMSB method in example 2</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_66676-fig-21.tif"/>
</fig><fig id="fig-22">
<label>Figure 22</label>
<caption>
<title>Traditional optimization results from literature [<xref ref-type="bibr" rid="ref-28">28</xref>]</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_66676-fig-22.tif"/>
</fig><table-wrap id="table-2">
<label>Table 2</label>
<caption>
<title>Comparison results of different optimization methods for example 2</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th>Methods</th>
<th>Whether the boundary is smooth or not</th>
</tr>
</thead>
<tbody>
<tr>
<td>MMSB</td>
<td>Yes</td>
</tr>
<tr>
<td>Without using MMSB</td>
<td>No</td>
</tr>
<tr>
<td>literature [<xref ref-type="bibr" rid="ref-28">28</xref>]</td>
<td>No</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="s4_3">
<label>4.3</label>
<title>4.3 Numerical Example 3</title>
<p>Example 3: The base structure is depicted in <xref ref-type="fig" rid="fig-23">Fig. 23</xref>, with basic dimensions of 80 &#x00D7; 50 &#x00D7; 1 mm, and its finite element model is shown in <xref ref-type="fig" rid="fig-24">Fig. 24</xref>. The modulus of elasticity of the material is 1.0 &#x00D7; 10<sup>6</sup> MPa, and the Poisson&#x2019;s ratio is 0.3, and a centralized load of <italic>F</italic> &#x003D; 9000 N is applied to the lower-right corner of the model, and a fixed constraint supports the left boundary, and the displacement constraint is that the vertical downward displacement at the point of the load effect is less than or equal to 0.5 mm. The edge length of the element is set to 3 mm.</p>
<fig id="fig-23">
<label>Figure 23</label>
<caption>
<title>Basic structure of example 3</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_66676-fig-23.tif"/>
</fig><fig id="fig-24">
<label>Figure 24</label>
<caption>
<title>Finite element model of example 3</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_66676-fig-24.tif"/>
</fig>
<p>The inverse topology optimization configuration obtained without using the MMSB method is shown in <xref ref-type="fig" rid="fig-25">Fig. 25</xref>, where the jagged boundary is more severe.</p>
<fig id="fig-25">
<label>Figure 25</label>
<caption>
<title>Topological configuration after inversion of example 3</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_66676-fig-25.tif"/>
</fig>
<p>A total of seven boundary shifts in Example 3 are performed using the MMSB method, and after the seventh boundary shift, the boundary shift was more similar to the sixth boundary shift, and the overall boundary is smoother in the seventh shift so that the convergence condition can be achieved. The mesh re-division is conducted to obtain the boundary shifting diagram as shown in <xref ref-type="fig" rid="fig-26">Fig. 26</xref>. The final topological graph with smooth boundary containing only 0&#x2013;1 is obtained as shown in <xref ref-type="fig" rid="fig-27">Fig. 27</xref>. The final topological configuration of this algorithm obtained in the literature [<xref ref-type="bibr" rid="ref-29">29</xref>] using a quadrilateral based mesh is shown in <xref ref-type="fig" rid="fig-28">Fig. 28</xref>. The structure weight iteration curves for seven boundary shifts obtained using the MMSB method are shown in <xref ref-type="fig" rid="fig-29">Fig. 29</xref>. The final converged structure weight obtained is 1.65 kg.</p>
<fig id="fig-26">
<label>Figure 26</label>
<caption>
<title>Seven boundary shifts</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_66676-fig-26.tif"/>
</fig><fig id="fig-27">
<label>Figure 27</label>
<caption>
<title>Final topological configuration of the MMSB method in Example 3</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_66676-fig-27.tif"/>
</fig><fig id="fig-28">
<label>Figure 28</label>
<caption>
<title>Traditional optimization results from literature [<xref ref-type="bibr" rid="ref-29">29</xref>]</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_66676-fig-28.tif"/>
</fig><fig id="fig-29">
<label>Figure 29</label>
<caption>
<title>Seven iterative curves for weight of MMSB</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_66676-fig-29.tif"/>
</fig>
<p>The topological configurations obtained without using the MMSB topology optimization method, those in the literature [<xref ref-type="bibr" rid="ref-29">29</xref>], and those of the MMSB method are the same. The results obtained by the three methods, as listed in <xref ref-type="table" rid="table-3">Table 3</xref>, do not differ much in terms of the weights of the structures. The results obtained using the MMSB method are smoother, indicating that the MMSB method is a very effective method to improve the jagged boundary.</p>
<table-wrap id="table-3">
<label>Table 3</label>
<caption>
<title>Comparison results of different optimization methods for calculation example 3</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th>Methods</th>
<th>Whether the boundary is smooth or not</th>
</tr>
</thead>
<tbody>
<tr>
<td>MMSB</td>
<td>Yes</td>
</tr>
<tr>
<td>Without using MMSB</td>
<td>No</td>
</tr>
<tr>
<td>literature [<xref ref-type="bibr" rid="ref-29">29</xref>]</td>
<td>No</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
</sec>
<sec id="s5">
<label>5</label>
<title>Conclusion</title>
<p>This study develops a topology optimization model for weight minimization with multiple displacement constraints utilizing the ICM method. It uses the triangular meshing during the structural design optimization as the base mesh and achieves the boundary movement through contour redistribution of the mesh, resulting in an optimal topology with smooth boundaries. The Movable Morphable Smooth Boundary (MMSB) method effectively addresses the jagged boundary problem, and numerical examples demonstrate its effectiveness and feasibility.</p>
<p>However, the movable deformation boundary method requires multiple times of re-meshings, which limits computational efficiency. Future work will focus on enhancing the computational efficiency. In addition, the numerical examples provided are based on a two-dimensional model. If the Movable Morphable Smooth Boundary (MMSB) is to be extended to a three-dimensional model, it will require re-establishing three-dimensional boundary curves, increasing the complexity. This issue shall be addressed in future studies.</p>
</sec>
</body>
<back>
<ack>
<p>The authors would like to thank the School of Mathematics, Statistics and Mechanics, Beijing University of Technology, for providing the necessary facilities and resources for conducting this research.</p>
</ack>
<sec>
<title>Funding Statement</title>
<p>This work shown in this paper has been supported by the National Natural Science Foundation of China (Grant 12472113).</p>
</sec>
<sec>
<title>Author Contributions</title>
<p>The authors confirm their contribution to the paper as follows: study conception and design: Jiazheng Du, Hongling Ye; data collection: Ju Chen; analysis and interpretation of results: Ju Chen, Bing Lin, Zhichao Guo; draft manuscript preparation: Ju Chen. All authors reviewed the results and approved the final version of the manuscript.</p>
</sec>
<sec sec-type="data-availability">
<title>Availability of Data and Materials</title>
<p>All data generated or analyzed during this study are included in this paper.</p>
</sec>
<sec>
<title>Ethics Approval</title>
<p>Not applicable.</p>
</sec>
<sec sec-type="COI-statement">
<title>Conflicts of Interest</title>
<p>The authors declare no conflicts of interest to report regarding the present study.</p>
</sec>
<ref-list content-type="authoryear">
<title>References</title>
<ref id="ref-1"><label>[1]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Zhu</surname> <given-names>JH</given-names></string-name>, <string-name><surname>Zhou</surname> <given-names>H</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>C</given-names></string-name>, <string-name><surname>Zhou</surname> <given-names>L</given-names></string-name>, <string-name><surname>Yuan</surname> <given-names>SQ</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>WH</given-names></string-name></person-group>. <article-title>Current and future development of topology optimization technology for additive manufacturing</article-title>. <source>Aerospace Manufact Technol</source>. <year>2020</year>;<volume>63</volume>(<issue>10</issue>):<fpage>24</fpage>&#x2013;<lpage>38</lpage>. doi:<pub-id pub-id-type="doi">10.16080/j.issn1671-833x.2020.10.024</pub-id>.</mixed-citation></ref>
<ref id="ref-2"><label>[2]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Liu</surname> <given-names>BY</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>XM</given-names></string-name>, <string-name><surname>Yang</surname> <given-names>G</given-names></string-name>, <string-name><surname>Xing</surname> <given-names>BD</given-names></string-name></person-group>. <article-title>Research progress on topology optimization design for metal additive manufacturing</article-title>. <source>China Laser</source>. <year>2023</year>;<volume>50</volume>(<issue>12</issue>):<fpage>188</fpage>&#x2013;<lpage>203</lpage>.</mixed-citation></ref>
<ref id="ref-3"><label>[3]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Fu</surname> <given-names>XJ</given-names></string-name></person-group>. <article-title>Integrated Optimized design of continuum structures</article-title>. <source>J Mech Eng</source>. <year>2012</year>;<volume>48</volume>(<issue>1</issue>):<fpage>128</fpage>&#x2013;<lpage>34</lpage>.</mixed-citation></ref>
<ref id="ref-4"><label>[4]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Zhang</surname> <given-names>GF</given-names></string-name>, <string-name><surname>Xu</surname> <given-names>L</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>X</given-names></string-name>, <string-name><surname>Xiao</surname> <given-names>NX</given-names></string-name></person-group>. <article-title>Study on the post-processing method for topology optimization of continuum structures based on the variable density method</article-title>. <source>Mech Strength</source>. <year>2022</year>;<volume>44</volume>(<issue>4</issue>):<fpage>845</fpage>&#x2013;<lpage>51</lpage>. doi:<pub-id pub-id-type="doi">10.16579/j.issn.1001.9669.2022.04.013</pub-id>.</mixed-citation></ref>
<ref id="ref-5"><label>[5]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Li</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Lee</surname> <given-names>T</given-names></string-name>, <string-name><surname>Yao</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Xie</surname> <given-names>YM</given-names></string-name></person-group>. <article-title>Smoothing topology optimization results using pre-built lookup tables</article-title>. <source>Adv Eng Softw</source>. <year>2022</year>;<volume>173</volume>(<issue>12</issue>):<fpage>103204</fpage>. doi:<pub-id pub-id-type="doi">10.1016/j.advengsoft.2022.103204</pub-id>.</mixed-citation></ref>
<ref id="ref-6"><label>[6]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Liu</surname> <given-names>HL</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>PJ</given-names></string-name>, <string-name><surname>Liang</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Long</surname> <given-names>K</given-names></string-name>, <string-name><surname>Yang</surname> <given-names>DX</given-names></string-name></person-group>. <article-title>Topology optimization for harmonic excitation structures with minimum length scale control using the discrete variable method</article-title>. <source>Comput Model Eng Sci</source>. <year>2023</year>;<volume>135</volume>(<issue>3</issue>):<fpage>1941</fpage>&#x2013;<lpage>64</lpage>. doi:<pub-id pub-id-type="doi">10.32604/cmes.2023.024921</pub-id>.</mixed-citation></ref>
<ref id="ref-7"><label>[7]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Maute</surname> <given-names>K</given-names></string-name>, <string-name><surname>Ramm</surname> <given-names>E</given-names></string-name></person-group>. <article-title>Adaptive topology optimization</article-title>. <source>Struct Optim</source>. <year>1995</year>;<volume>10</volume>(<issue>2</issue>):<fpage>100</fpage>&#x2013;<lpage>12</lpage>. doi:<pub-id pub-id-type="doi">10.1007/BF01743537</pub-id>.</mixed-citation></ref>
<ref id="ref-8"><label>[8]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Thom&#x00E1;s</surname> <given-names>YSH</given-names></string-name>, <string-name><surname>Ivan</surname> <given-names>FMM</given-names></string-name>, <string-name><surname>Anderson</surname> <given-names>P</given-names></string-name></person-group>. <article-title>A simple adaptive mesh refinement scheme for topology optimization using polygonal meshes</article-title>. <source>J Braz Soc Mech Sci Eng</source>. <year>2018</year>;<volume>40</volume>(<issue>7</issue>):<fpage>1</fpage>&#x2013;<lpage>17</lpage>. doi:<pub-id pub-id-type="doi">10.1007/s40430-018-1267-5</pub-id>.</mixed-citation></ref>
<ref id="ref-9"><label>[9]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Da</surname> <given-names>DC</given-names></string-name>, <string-name><surname>Xia</surname> <given-names>L</given-names></string-name>, <string-name><surname>Li</surname> <given-names>GY</given-names></string-name>, <string-name><surname>Huang</surname> <given-names>XD</given-names></string-name></person-group>. <article-title>Evolutionary topology optimization of continuum structures with smooth boundary representation</article-title>. <source>Struct Multidiscipl Optim</source>. <year>2018</year>;<volume>57</volume>(<issue>6</issue>):<fpage>2143</fpage>&#x2013;<lpage>59</lpage>. doi:<pub-id pub-id-type="doi">10.1007/s00158-017-1846-6</pub-id>.</mixed-citation></ref>
<ref id="ref-10"><label>[10]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Liu</surname> <given-names>BS</given-names></string-name>, <string-name><surname>Guo</surname> <given-names>D</given-names></string-name>, <string-name><surname>Jiang</surname> <given-names>C</given-names></string-name>, <string-name><surname>Li</surname> <given-names>GY</given-names></string-name>, <string-name><surname>Huang</surname> <given-names>XD</given-names></string-name></person-group>. <article-title>Stress optimization of smooth continuum structures based on the distortion strain energy density</article-title>. <source>Comput Methods Appl Mech Eng</source>. <year>2019</year>;<volume>343</volume>(<issue>14</issue>):<fpage>276</fpage>&#x2013;<lpage>96</lpage>. doi:<pub-id pub-id-type="doi">10.1016/j.cma.2018.08.031</pub-id>.</mixed-citation></ref>
<ref id="ref-11"><label>[11]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Muayad</surname> <given-names>H</given-names></string-name>, <string-name><surname>Majid</surname> <given-names>MR</given-names></string-name></person-group>. <article-title>Plastic-limit probabilistic structural topology optimization of steel beams</article-title>. <source>Appl Math Model</source>. <year>2024</year>;<volume>128</volume>:<fpage>347</fpage>&#x2013;<lpage>69</lpage>. doi:<pub-id pub-id-type="doi">10.1016/j.apm.2024.01.029</pub-id>.</mixed-citation></ref>
<ref id="ref-12"><label>[12]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>G&#x00F3;mez-Silva</surname> <given-names>F</given-names></string-name>, <string-name><surname>Zaera</surname> <given-names>R</given-names></string-name>, <string-name><surname>Ortigosa</surname> <given-names>R</given-names></string-name>, <string-name><surname>Mart&#x00ED;nez-Frutos</surname> <given-names>J</given-names></string-name></person-group>. <article-title>Topology optimization of lattice structures for target band gaps with optimum volume fraction via Bloch-Floquet theory</article-title>. <source>Comput Struct</source>. <year>2025</year>;<volume>307</volume>:<fpage>107601</fpage>. doi:<pub-id pub-id-type="doi">10.1016/j.compstruc.2024.107601</pub-id>.</mixed-citation></ref>
<ref id="ref-13"><label>[13]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Fu</surname> <given-names>YF</given-names></string-name>, <string-name><surname>Rolfe</surname> <given-names>B</given-names></string-name>, <string-name><surname>Chiu</surname> <given-names>LNS</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>YA</given-names></string-name>, <string-name><surname>Huang</surname> <given-names>XD</given-names></string-name>, <string-name><surname>Ghabraie</surname> <given-names>K</given-names></string-name></person-group>. <article-title>Smooth topological design of 3D continuum structures using elemental volume fractions</article-title>. <source>Comput Struct</source>. <year>2020</year>;<volume>231</volume>(<issue>2</issue>):<fpage>106</fpage>&#x2013;<lpage>213</lpage>. doi:<pub-id pub-id-type="doi">10.1016/j.advengsoft.2020.102921</pub-id>.</mixed-citation></ref>
<ref id="ref-14"><label>[14]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><surname>Yu</surname> <given-names>CT</given-names></string-name></person-group>. <article-title>MMC topology optimization method based on smoothing technique [MA thesis]. Dalian, China: Dalian University of Technology</article-title>; <year>2021</year>.</mixed-citation></ref>
<ref id="ref-15"><label>[15]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Huang</surname> <given-names>MC</given-names></string-name>, <string-name><surname>Du</surname> <given-names>ZL</given-names></string-name>, <string-name><surname>Liu</surname> <given-names>C</given-names></string-name>, <string-name><surname>Zheng</surname> <given-names>YG</given-names></string-name>, <string-name><surname>Cui</surname> <given-names>TC</given-names></string-name>, <string-name><surname>Mei</surname> <given-names>Y</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>Problem-independent machine learning (PIML)-based topology optimization&#x2014;a universal approach</article-title>. <source>Extreme Mech Lett</source>. <year>2022</year>;<volume>56</volume>:<fpage>101887</fpage>. doi:<pub-id pub-id-type="doi">10.1016/j.eml.2022.101887</pub-id>.</mixed-citation></ref>
<ref id="ref-16"><label>[16]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Sui</surname> <given-names>YK</given-names></string-name>, <string-name><surname>Yang</surname> <given-names>DQ</given-names></string-name></person-group>. <article-title>A new method for structural topological optimization based on the concept of independent continuous variables and smooth model</article-title>. <source>Acta Mech Sin</source>. <year>1998</year>;<volume>18</volume>(<issue>2</issue>):<fpage>179</fpage>&#x2013;<lpage>85</lpage>. doi:<pub-id pub-id-type="doi">10.1007/bf02487752</pub-id>.</mixed-citation></ref>
<ref id="ref-17"><label>[17]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Peng</surname> <given-names>XR</given-names></string-name>, <string-name><surname>Sui</surname> <given-names>YK</given-names></string-name></person-group>. <article-title>Topology optimization of continuum structures under forced harmonic vibrations</article-title>. <source>J Solid Mech</source>. <year>2008</year>;<volume>29</volume>(<issue>2</issue>):<fpage>157</fpage>&#x2013;<lpage>62</lpage>. doi:<pub-id pub-id-type="doi">10.1016/b978-0-12-812655-4.00008-0</pub-id>.</mixed-citation></ref>
<ref id="ref-18"><label>[18]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Peng</surname> <given-names>XR</given-names></string-name>, <string-name><surname>Sui</surname> <given-names>YK</given-names></string-name></person-group>. <article-title>First-order approximation of internal forces for stress-constrained topology optimization</article-title>. <source>Mech Strength</source>. <year>2016</year>;<volume>38</volume>(<issue>05</issue>):<fpage>990</fpage>&#x2013;<lpage>5</lpage>.</mixed-citation></ref>
<ref id="ref-19"><label>[19]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Peng</surname> <given-names>XR</given-names></string-name>, <string-name><surname>Sui</surname> <given-names>YK</given-names></string-name></person-group>. <article-title>Topological optimization of continuum structures under static displacement and frequency constraints by ICM method</article-title>. <source>J Computat Mech</source>. <year>2006</year>;<volume>23</volume>(<issue>04</issue>):<fpage>391</fpage>&#x2013;<lpage>6</lpage>.</mixed-citation></ref>
<ref id="ref-20"><label>[20]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Long</surname> <given-names>K</given-names></string-name>, <string-name><surname>Zuo</surname> <given-names>ZX</given-names></string-name></person-group>. <article-title>A hybrid modeling approach for ICM topology optimization based on different filter functions</article-title>. <source>Chinese Mech Eng</source>. <year>2007</year>;<volume>18</volume>(<issue>19</issue>):<fpage>2303</fpage>&#x2013;<lpage>6</lpage>.</mixed-citation></ref>
<ref id="ref-21"><label>[21]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Long</surname> <given-names>K</given-names></string-name>, <string-name><surname>Zuo</surname> <given-names>ZX</given-names></string-name></person-group>. <article-title>Nodal ICM topology optimization method under spatially independent interpolation</article-title>. <source>Eng Mech</source>. <year>2010</year>;<volume>27</volume>(<issue>12</issue>):<fpage>90</fpage>&#x2013;<lpage>95, 101</lpage>.</mixed-citation></ref>
<ref id="ref-22"><label>[22]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Long</surname> <given-names>K</given-names></string-name>, <string-name><surname>Zuo</surname> <given-names>ZX</given-names></string-name></person-group>. <article-title>Continuum topology optimization under harmonic response</article-title>. <source>Chinese Mech Engg</source>. <year>2007</year>;<volume>18</volume>(<issue>13</issue>):<fpage>1556</fpage>&#x2013;<lpage>9</lpage>.</mixed-citation></ref>
<ref id="ref-23"><label>[23]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Yan</surname> <given-names>JS</given-names></string-name>, <string-name><surname>Sun</surname> <given-names>PW</given-names></string-name>, <string-name><surname>Ma</surname> <given-names>ZK</given-names></string-name>, <string-name><surname>Zhao</surname> <given-names>XX</given-names></string-name>, <string-name><surname>Dong</surname> <given-names>XH</given-names></string-name></person-group>. <article-title>Effect of different parameters of power function filtering function on the convergence rate of topology optimization of laminates</article-title>. <source>Compos Mat Sci Eng</source>. <year>2022</year>;<volume>6</volume>:<fpage>5</fpage>&#x2013;<lpage>9</lpage>.</mixed-citation></ref>
<ref id="ref-24"><label>[24]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Du</surname> <given-names>JZ</given-names></string-name>, <string-name><surname>Cong</surname> <given-names>X</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>Y</given-names></string-name></person-group>. <article-title>Topology optimization of strength-safe continuum structures considering random damage</article-title>. <source>Comput Model Eng Sci</source>. <year>2023</year>;<volume>136</volume>(<issue>2</issue>):<fpage>1091</fpage>&#x2013;<lpage>120</lpage>. doi:<pub-id pub-id-type="doi">10.32604/cmes.2023.025585</pub-id>.</mixed-citation></ref>
<ref id="ref-25"><label>[25]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Du</surname> <given-names>JZ</given-names></string-name>, <string-name><surname>Chen</surname> <given-names>J</given-names></string-name>, <string-name><surname>Li</surname> <given-names>GM</given-names></string-name></person-group>. <article-title>Influence of filter functions on efficiency of topology optimization and gray-scale element</article-title>. <source>J Beijing Univ Technol</source>. <year>2025</year>;<volume>51</volume>(<issue>5</issue>):<fpage>523</fpage>&#x2013;<lpage>38</lpage>. doi:<pub-id pub-id-type="doi">10.11936/bjutxb2023070001</pub-id>.</mixed-citation></ref>
<ref id="ref-26"><label>[26]</label><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Sui</surname> <given-names>YK</given-names></string-name>, <string-name><surname>Ye</surname> <given-names>HL</given-names></string-name></person-group>. <source>Continuum topology optimization methods ICM</source>. <publisher-loc>Beijing, China</publisher-loc>: <publisher-name>Science Press</publisher-name>; <year>2013</year>. <fpage>22</fpage> p.</mixed-citation></ref>
<ref id="ref-27"><label>[27]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Du</surname> <given-names>JZ</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Meng</surname> <given-names>FW</given-names></string-name></person-group>. <article-title>Fail-safe topology optimization of continuum structures with multiple constraints based on ICM method</article-title>. <source>Comput Model Eng Sci</source>. <year>2021</year>;<volume>129</volume>(<issue>2</issue>):<fpage>661</fpage>&#x2013;<lpage>87</lpage>. doi:<pub-id pub-id-type="doi">10.32604/cmes.2021.017580</pub-id>.</mixed-citation></ref>
<ref id="ref-28"><label>[28]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><surname>Ye</surname> <given-names>HL</given-names></string-name></person-group>. <article-title>Static topology optimization method and software development for continuum structures [Ph.D. Thesis]. Beijing, China: Beijing University of Technology</article-title>; <year>2005</year>.</mixed-citation></ref>
<ref id="ref-29"><label>[29]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Sui</surname> <given-names>YK</given-names></string-name>, <string-name><surname>Peng</surname> <given-names>XR</given-names></string-name></person-group>. <article-title>Improvement of ICM methods for structural topology optimization</article-title>. <source>J Mech</source>. <year>2005</year>;<volume>37</volume>(<issue>2</issue>):<fpage>190</fpage>&#x2013;<lpage>8</lpage>. doi:<pub-id pub-id-type="doi">10.6052/0459-1879-2005-2-2004-286</pub-id>.</mixed-citation></ref>
</ref-list>
</back></article>