<?xml version="1.0" encoding="ISO-8859-1"?><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<front>
<journal-meta>
<journal-id>0874-5161</journal-id>
<journal-title><![CDATA[Investigação Operacional]]></journal-title>
<abbrev-journal-title><![CDATA[Inv. Op.]]></abbrev-journal-title>
<issn>0874-5161</issn>
<publisher>
<publisher-name><![CDATA[APDIO - Associação Portuguesa de Investigação Operacional]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S0874-51612005000100007</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[Using Optimization to Solve Truss Topology Design Problems]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Bastos]]></surname>
<given-names><![CDATA[Fernando]]></given-names>
</name>
<xref ref-type="aff" rid="A01"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Cerveira]]></surname>
<given-names><![CDATA[Adelaide]]></given-names>
</name>
<xref ref-type="aff" rid="A02"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Gromicho]]></surname>
<given-names><![CDATA[Joaquim]]></given-names>
</name>
<xref ref-type="aff" rid="A03"/>
</contrib>
</contrib-group>
<aff id="A01">
<institution><![CDATA[,Universidade de Lisboa Faculdade de Ciências Departamento de Estatística e Investigação Operacional]]></institution>
<addr-line><![CDATA[Lisboa ]]></addr-line>
<country>Portugal</country>
</aff>
<aff id="A02">
<institution><![CDATA[,Universidade de Trás-os-Montes e Alto Douro Departamento de Matemática ]]></institution>
<addr-line><![CDATA[Vila Real ]]></addr-line>
<country>Portugal</country>
</aff>
<aff id="A03">
<institution><![CDATA[,Vrije Universiteit Amsterdam & ORTEC International ]]></institution>
<addr-line><![CDATA[Gouda ]]></addr-line>
<country>The Netherlands</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>06</month>
<year>2005</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>06</month>
<year>2005</year>
</pub-date>
<volume>25</volume>
<numero>1</numero>
<fpage>123</fpage>
<lpage>156</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://scielo.pt/scielo.php?script=sci_arttext&amp;pid=S0874-51612005000100007&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://scielo.pt/scielo.php?script=sci_abstract&amp;pid=S0874-51612005000100007&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://scielo.pt/scielo.php?script=sci_pdf&amp;pid=S0874-51612005000100007&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[The design of truss structures is an important engineering activity which has traditionally been done without optimization support. Nowadays we witness an increasing concern for efficiency and therefore engineers seek aid on Mathematical Programming to optimize a design. In this article, we consider a mathematical model where we maximize the stiffness with a volume constraint and bounds in the cross sectional area of the bars, [2]. The basic model is a large-scale non-convex constrained optimization problem but two equivalent problems are considered. One of them is a minimization of a convex non-smooth function in several variables (much less than in the basic model), being only one non-negative. The other is a semidefinite programming problem. We solve some instances using both alternatives and we present and compare the results.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[truss topology design]]></kwd>
<kwd lng="en"><![CDATA[stiffness]]></kwd>
<kwd lng="en"><![CDATA[non-smooth convex programming]]></kwd>
<kwd lng="en"><![CDATA[descent method]]></kwd>
<kwd lng="en"><![CDATA[semidefinite programming]]></kwd>
<kwd lng="en"><![CDATA[duality]]></kwd>
<kwd lng="en"><![CDATA[interior point methods]]></kwd>
</kwd-group>
</article-meta>
</front><body><![CDATA[ <P align="center"><B>Using optimization to solve truss topology design problems</B>     <p ALIGN=CENTER>Fernando Bastos *</p>     <P ALIGN=CENTER>&nbsp;  Adelaide Cerveira &#8224;</P>     <P ALIGN=CENTER>&nbsp;  Joaquim Gromicho &#8225;</P>     <div align="center">    <BR>   <b>* </b>Departamento de Estat&#237;stica e Investiga&#231;&#227;o Operacional,    FC, UL, Lisboa, Portugal </div>     <p align="center"><a href="mailto:fbastos@fc.ul.pt">fbastos@fc.ul.pt</a></p>     <p align="center">&#8224; Departamento de Matem&#225;tica, UTAD, Vila Real, Portugal  </p>           <p align="center"><a href="mailto:cerveira@utad.pt">cerveira@utad.pt</a></p>     <p align="center">&#8225; Vrije Universiteit, Amsterdam &amp; ORTEC International,    Gouda, The Netherlands </p>            ]]></body>
<body><![CDATA[<p align="center"><a href="mailto:jgromicho@ortec.nl">jgromicho@ortec.nl</a></p>     <p align="center">&nbsp;</p>      <P ALIGN=LEFT></P>      <P align="center"><b>Abstract:</b></P>       <P align="justify"> The design of truss structures is an important engineering    activity which has traditionally been done without optimization support. Nowadays    we witness an increasing concern for efficiency and therefore engineers seek    aid on Mathematical Programming to optimize a design. In this article, we consider    a mathematical model where we maximize the stiffness with a volume constraint    and bounds in the cross sectional area of the bars, [2]. The basic model is    a large-scale non-convex constrained optimization problem but two equivalent    problems are considered. One of them is a minimization of a convex non-smooth    function in several variables (much less than in the basic model), being only    one non-negative. The other is a semidefinite programming problem. We solve    some instances using both alternatives and we present and compare the results.  </p>     <P align="justify"> <B>Keywords:</B> truss topology design, stiffness, non-smooth    convex programming, descent method, semidefinite programming, duality, interior    point methods      <P>&nbsp;</P>       <P>Texto completo apenas dispon&#237;vel em PDF.</P>          <P> Full text only in PDF.</P>      <P>&nbsp;</P>          ]]></body>
<body><![CDATA[<P><b>Bibliography</b> </P>         <!-- ref --><P align="justify"> 1 M.&nbsp;S. BAZARAA, H.&nbsp;D. SHERALI, AND C.&nbsp;M. SHETTY,    <i> Nonlinear Programming: Theory and Algorithms</i>, John Wiley &amp; Sons,    New York, 1993.      &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=328453&pid=S0874-5161200500010000700001&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify">2 A.&nbsp;BEN-TAL AND M.&nbsp;P. BENDS&#216;E, <i>A new method    for optimal truss topology design</i>, SIAM Journal Optimization, 3 (1993),    pp.&nbsp;322-358.&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=328454&pid=S0874-5161200500010000700002&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify">3 A.&nbsp;BEN-TAL AND A.&nbsp;NEMIROVSKI, <i>Potential reduction    polynomial time method for truss topology design</i>, SIAM Journal Optimization,    4 (1994), pp.&nbsp;596-612.&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=328455&pid=S0874-5161200500010000700003&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify">4 A.&nbsp;BEN-TAL AND A.&nbsp;NEMIROVSKI, <i>Optimal design    of engineering structures</i>, Optima, 47 (1995), pp.&nbsp;4-8.&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=328456&pid=S0874-5161200500010000700004&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify">5 B.&nbsp;BORCHERS, <i>CSDP, 3.2 User's Guide</i>, Optimization    Methods and Software, 11 (1999), pp.&nbsp;597-611&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=328457&pid=S0874-5161200500010000700005&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify">6 B.&nbsp;BORCHERS, <i>CSDP, A C library for Semidefinite Programming</i>,    Optimization Methods and Software, 11 (1999), pp.&nbsp;613-623.&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=328458&pid=S0874-5161200500010000700006&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify">7 C.&nbsp;M. BRANCO, <i>Mec&#226;nica dos Materiais</i>, Funda&#231;&#227;o    Calouste Gulbenkian, Lisboa, 1994.&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=328459&pid=S0874-5161200500010000700007&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify">8 M.&nbsp;A.&nbsp;C. CERVEIRA, <i>Optimiza&#231;&#227;o do    desenho de estruturas</i>, master's thesis, Universidade de Lisboa, Portugal,    1997.&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=328460&pid=S0874-5161200500010000700008&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify">9 E.&nbsp;W. CHENEY AND A.&nbsp;A. GOLDSTEIN, <i>A Newton's    method for convex programming and Tchebycheff approximation</i>, Numeric Mathematics,    1 (1959), pp.&nbsp;253-268.&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=328461&pid=S0874-5161200500010000700009&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify">10 E.&nbsp;DE&nbsp;KLERK, C.&nbsp;ROOS, AND T.&nbsp;TERLAKY,    <i>Semi-definite problems in truss topology optimization</i>, Tech. Report Nr.    95-128, Faculty of Technical Mathematics and Informatics, Delft University of    Technology, November 1995.&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=328462&pid=S0874-5161200500010000700010&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify">11 C.&nbsp;HELMBERG, <i>Semidefinite programming for combinatorial    optimization</i>, tech. report, Konrad-Zuse-Zentrum f&#252;r Informationstecghnik    Berlin, 2000.&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=328463&pid=S0874-5161200500010000700011&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify">12 J.-B. HIRIART-URRUTY AND C.&nbsp;LEMAR&#201;CHAL, <i>Convex    Analysis and Minimization Algoritms I: Fundamentals</i>, vol.&nbsp;305 of A    Series of Comprehensive Studies in Mathematics, Springer-Verlag, Berlin, 1993.&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=328464&pid=S0874-5161200500010000700012&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify">13 J.-B. HIRIART-URRUTY AND C. LEMAR&#201;CHAL, <i>Convex Analysis    and Minimization Algoritms II: Advanced Theory and Bundle Methods</i>, vol.&nbsp;305    of A Series of Comprehensive Studies in Mathematics, Springer-Verlag, Berlin,    1993.&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=328465&pid=S0874-5161200500010000700013&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify">14 R.&nbsp;A. HORN AND C.&nbsp;R. JONHSON, <i>Matrix Analysis</i>,    Cambridge University Press, Cambridge, 1985.&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=328466&pid=S0874-5161200500010000700014&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify">15 R.&nbsp;A. HORN AND C.&nbsp;R. JONHSON, <i>Topics in Matrix    Analysis</i>, Cambridge University Press, Cambridge, 1991.&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=328467&pid=S0874-5161200500010000700015&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify">16 J.&nbsp;E. KELLEY, <i>The cutting plane method for solving    convex problems</i>, Journal of the Society for the Industrial and Applied Mathematics,    8 (1960), pp.&nbsp;703-712.&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=328468&pid=S0874-5161200500010000700016&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify">17 U.&nbsp;KIRSCH, <i>Optimum Structural Design: Concepts,    Methods and Applications</i>, McGraw-Hill, New York, 1981.&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=328469&pid=S0874-5161200500010000700017&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify">18 D.&nbsp;G. LUENBERGER, <i>Linear and Nonlinear Programming</i>,    Addison-Wesley, Reading Massachusetts, 1984.&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=328470&pid=S0874-5161200500010000700018&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify">19 J.&nbsp;M. MULVEY, R.&nbsp;J. VANDERBEI, AND S.&nbsp;A.    ZENIOS, <i>Robust optimization of large-scale systems</i>, Operations Research,    43 (1995), pp.&nbsp;264-281.&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=328471&pid=S0874-5161200500010000700019&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify">20 M.&nbsp;PATRIKSSON AND J.&nbsp;PETERSSON, <i>A subgradient    method for contact structural optimization</i>, LiTH-MAT-R-1995-25, (1995).&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=328472&pid=S0874-5161200500010000700020&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify">21 R.&nbsp;T. ROCKAFELLAR, <i>Convex Analysis</i>, Princeton    University Press, Princeton, New Jersey, 1970.&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=328473&pid=S0874-5161200500010000700021&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify">22 N.&nbsp;Z. SHOR, <i>Convergence rate of the gradient descent    method with dilation of the space</i>, Cambridge, 6 (1970), pp.&nbsp;102-108.&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=328474&pid=S0874-5161200500010000700022&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify">23 N.&nbsp;Z. SHOR, <i>Utilization of the operation of space    dilation in the minimization of convex functions</i>, Cambridge, 6 (1970), pp.&nbsp;7-15.&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=328475&pid=S0874-5161200500010000700023&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify">24 N.&nbsp;Z. SHOR, <i>Cut-off method with space extension    in convex programming problems</i>, Cambridge, 13 (1977), pp.&nbsp;94-96.&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=328476&pid=S0874-5161200500010000700024&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify">25 N.&nbsp;Z. SHOR, <i>Minimization Methods for Non-Differentiable    Functions</i>, Springer Series in Computational Mathematics, Springer-Verlag,    Berlin, 1985.&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=328477&pid=S0874-5161200500010000700025&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify">26 G.&nbsp;N. VANDERPLAATS, <i>Numerical Optimization Techniques    for Engineering Design: With Applications</i>, Series in Mechanical Engineering,    McGraw-Hill, New York, 1984.&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=328478&pid=S0874-5161200500010000700026&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><P align="justify">&nbsp;</P>       ]]></body><back>
<ref-list>
<ref id="B1">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[BAZARAA]]></surname>
<given-names><![CDATA[M. S.]]></given-names>
</name>
<name>
<surname><![CDATA[SHERALI]]></surname>
<given-names><![CDATA[H. D.]]></given-names>
</name>
<name>
<surname><![CDATA[SHETTY]]></surname>
<given-names><![CDATA[C. M.]]></given-names>
</name>
</person-group>
<source><![CDATA[Nonlinear Programming: Theory and Algorithms]]></source>
<year>1993</year>
<publisher-loc><![CDATA[New York ]]></publisher-loc>
<publisher-name><![CDATA[John Wiley & Sons]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B2">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[BEN-TAL]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[BENDSØE]]></surname>
<given-names><![CDATA[M. P.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[A new method for optimal truss topology design]]></article-title>
<source><![CDATA[SIAM Journal Optimization]]></source>
<year>1993</year>
<volume>3</volume>
<page-range>322-358</page-range></nlm-citation>
</ref>
<ref id="B3">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[BEN-TAL]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[NEMIROVSKI]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Potential reduction polynomial time method for truss topology design]]></article-title>
<source><![CDATA[SIAM Journal Optimization]]></source>
<year>1994</year>
<volume>4</volume>
<page-range>596-612</page-range></nlm-citation>
</ref>
<ref id="B4">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[BEN-TAL]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[NEMIROVSKI]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Optimal design of engineering structures]]></article-title>
<source><![CDATA[Optima]]></source>
<year>1995</year>
<volume>47</volume>
<page-range>4-8</page-range></nlm-citation>
</ref>
<ref id="B5">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[BORCHERS]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[CSDP, 3.2 User's Guide]]></article-title>
<source><![CDATA[Optimization Methods and Software]]></source>
<year>1999</year>
<volume>11</volume>
<page-range>597-611</page-range></nlm-citation>
</ref>
<ref id="B6">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[BORCHERS]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[CSDP, A C library for Semidefinite Programming]]></article-title>
<source><![CDATA[Optimization Methods and Software]]></source>
<year>1999</year>
<volume>11</volume>
<page-range>613-623</page-range></nlm-citation>
</ref>
<ref id="B7">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[BRANCO]]></surname>
<given-names><![CDATA[C. M.]]></given-names>
</name>
</person-group>
<source><![CDATA[Mecânica dos Materiais]]></source>
<year>1994</year>
<publisher-loc><![CDATA[Lisboa ]]></publisher-loc>
<publisher-name><![CDATA[Fundação Calouste Gulbenkian]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B8">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[CERVEIRA]]></surname>
<given-names><![CDATA[M. A. C.]]></given-names>
</name>
</person-group>
<source><![CDATA[Optimização do desenho de estruturas]]></source>
<year></year>
</nlm-citation>
</ref>
<ref id="B9">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[CHENEY]]></surname>
<given-names><![CDATA[E. W.]]></given-names>
</name>
<name>
<surname><![CDATA[GOLDSTEIN]]></surname>
<given-names><![CDATA[A. A.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[A Newton's method for convex programming and Tchebycheff approximation]]></article-title>
<source><![CDATA[Numeric Mathematics]]></source>
<year>1959</year>
<volume>1</volume>
<page-range>253-268</page-range></nlm-citation>
</ref>
<ref id="B10">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[DE KLERK]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[ROOS]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[TERLAKY]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
</person-group>
<source><![CDATA[Semi-definite problems in truss topology optimization]]></source>
<year>Nove</year>
<month>mb</month>
<day>er</day>
<volume>95-128</volume>
<publisher-name><![CDATA[Faculty of Technical Mathematics and InformaticsDelft University of Technology]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B11">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[HELMBERG]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<source><![CDATA[Semidefinite programming for combinatorial optimization]]></source>
<year>2000</year>
<publisher-name><![CDATA[Konrad-Zuse-Zentrum für Informationstecghnik Berlin]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B12">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[HIRIART-URRUTY]]></surname>
<given-names><![CDATA[J.-B.]]></given-names>
</name>
<name>
<surname><![CDATA[LEMARÉCHAL]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Convex Analysis and Minimization Algoritms I: Fundamentals]]></article-title>
<source><![CDATA[A Series of Comprehensive Studies in Mathematics]]></source>
<year>1993</year>
<volume>305</volume>
<publisher-loc><![CDATA[Berlin ]]></publisher-loc>
<publisher-name><![CDATA[Springer-Verlag]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B13">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[HIRIART-URRUTY]]></surname>
<given-names><![CDATA[J.-B.]]></given-names>
</name>
<name>
<surname><![CDATA[LEMARÉCHAL]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Convex Analysis and Minimization Algoritms II: Advanced Theory and Bundle Methods]]></article-title>
<source><![CDATA[A Series of Comprehensive Studies in Mathematics]]></source>
<year>1993</year>
<volume>305</volume>
<publisher-loc><![CDATA[Berlin ]]></publisher-loc>
<publisher-name><![CDATA[Springer-Verlag]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B14">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[HORN]]></surname>
<given-names><![CDATA[R. A.]]></given-names>
</name>
<name>
<surname><![CDATA[JONHSON]]></surname>
<given-names><![CDATA[C. R.]]></given-names>
</name>
</person-group>
<source><![CDATA[Matrix Analysis]]></source>
<year>1985</year>
<publisher-loc><![CDATA[Cambridge ]]></publisher-loc>
<publisher-name><![CDATA[Cambridge University Press]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B15">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[HORN]]></surname>
<given-names><![CDATA[R. A.]]></given-names>
</name>
<name>
<surname><![CDATA[JONHSON]]></surname>
<given-names><![CDATA[C. R.]]></given-names>
</name>
</person-group>
<source><![CDATA[Topics in Matrix Analysis]]></source>
<year>1991</year>
<publisher-loc><![CDATA[Cambridge ]]></publisher-loc>
<publisher-name><![CDATA[Cambridge University Press]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B16">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[KELLEY]]></surname>
<given-names><![CDATA[J. E.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[The cutting plane method for solving convex problems]]></article-title>
<source><![CDATA[Journal of the Society for the Industrial and Applied Mathematics]]></source>
<year>1960</year>
<volume>8</volume>
<page-range>703-712</page-range></nlm-citation>
</ref>
<ref id="B17">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[KIRSCH]]></surname>
<given-names><![CDATA[U.]]></given-names>
</name>
</person-group>
<source><![CDATA[Optimum Structural Design: Concepts, Methods and Applications]]></source>
<year>1981</year>
<publisher-loc><![CDATA[New York ]]></publisher-loc>
<publisher-name><![CDATA[McGraw-Hill]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B18">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[LUENBERGER]]></surname>
<given-names><![CDATA[D. G.]]></given-names>
</name>
</person-group>
<source><![CDATA[Linear and Nonlinear Programming]]></source>
<year>1984</year>
<publisher-loc><![CDATA[Reading^eMassachusetts Massachusetts]]></publisher-loc>
<publisher-name><![CDATA[Addison-Wesley]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B19">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[MULVEY]]></surname>
<given-names><![CDATA[J. M.]]></given-names>
</name>
<name>
<surname><![CDATA[VANDERBEI]]></surname>
<given-names><![CDATA[R. J.]]></given-names>
</name>
<name>
<surname><![CDATA[ZENIOS]]></surname>
<given-names><![CDATA[S. A.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Robust optimization of large-scale systems]]></article-title>
<source><![CDATA[Operations Research]]></source>
<year>1995</year>
<volume>43</volume>
<page-range>264-281</page-range></nlm-citation>
</ref>
<ref id="B20">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[PATRIKSSON]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[PETERSSON]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<source><![CDATA[A subgradient method for contact structural optimization]]></source>
<year>1995</year>
</nlm-citation>
</ref>
<ref id="B21">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[ROCKAFELLAR]]></surname>
<given-names><![CDATA[R. T.]]></given-names>
</name>
</person-group>
<source><![CDATA[Convex Analysis]]></source>
<year>1970</year>
<publisher-loc><![CDATA[Princeton^eNew Jersey New Jersey]]></publisher-loc>
<publisher-name><![CDATA[Princeton University Press]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B22">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[SHOR]]></surname>
<given-names><![CDATA[N. Z.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Convergence rate of the gradient descent method with dilation of the space]]></article-title>
<source><![CDATA[Cambridge]]></source>
<year>1970</year>
<volume>6</volume>
<page-range>102-108</page-range></nlm-citation>
</ref>
<ref id="B23">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[SHOR]]></surname>
<given-names><![CDATA[N. Z.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Utilization of the operation of space dilation in the minimization of convex functions]]></article-title>
<source><![CDATA[Cambridge]]></source>
<year>1970</year>
<volume>6</volume>
<page-range>7-15</page-range></nlm-citation>
</ref>
<ref id="B24">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[SHOR]]></surname>
<given-names><![CDATA[N. Z.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Cut-off method with space extension in convex programming problems]]></article-title>
<source><![CDATA[Cambridge]]></source>
<year>1977</year>
<volume>13</volume>
<page-range>94-96</page-range></nlm-citation>
</ref>
<ref id="B25">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[SHOR]]></surname>
<given-names><![CDATA[N. Z.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Minimization Methods for Non-Differentiable Functions]]></article-title>
<source><![CDATA[Computational Mathematics]]></source>
<year>1985</year>
<publisher-loc><![CDATA[Berlin ]]></publisher-loc>
<publisher-name><![CDATA[Springer-Verlag]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B26">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[VANDERPLAATS]]></surname>
<given-names><![CDATA[G. N.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Numerical Optimization Techniques for Engineering Design: With Applications]]></article-title>
<source><![CDATA[Mechanical Engineering]]></source>
<year>1984</year>
<publisher-loc><![CDATA[New York ]]></publisher-loc>
<publisher-name><![CDATA[McGraw-Hill]]></publisher-name>
</nlm-citation>
</ref>
</ref-list>
</back>
</article>
