<efrbr:recordSet xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:efrbr="http://vfrbr.info/efrbr/1.1" xmlns:efrbr-work="http://vfrbr.info/efrbr/1.1/work" xmlns:efrbr-expression="http://vfrbr.info/efrbr/1.1/expression" xmlns:efrbr-manifestation="http://vfrbr.info/efrbr/1.1/manifestation" xmlns:efrbr-person="http://vfrbr.info/efrbr/1.1/person" xmlns:efrbr-corporateBody="http://vfrbr.info/efrbr/1.1/corporateBody" xmlns:efrbr-concept="http://vfrbr.info/efrbr/1.1/concept" xmlns:efrbr-structure="http://vfrbr.info/efrbr/1.1/structure" xmlns:efrbr-responsible="http://vfrbr.info/efrbr/1.1/responsible" xmlns:efrbr-subject="http://vfrbr.info/efrbr/1.1/subject" xmlns:efrbr-other="http://vfrbr.info/efrbr/1.1/other" xsi:schemaLocation="http://vfrbr.info/efrbr/1.1 http://vfrbr.info/schemas/1.1/efrbr.xsd"><efrbr:entities><efrbr-work:work identifier="http://purl.tuc.gr/dl/dias/56D3FA90-F298-4A92-9892-838E43BB44F1"><efrbr-work:titleOfTheWork>Difference convex optimization techniques in nonsmooth computational mechanics</efrbr-work:titleOfTheWork></efrbr-work:work><efrbr-expression:expression identifier="http://purl.tuc.gr/dl/dias/56D3FA90-F298-4A92-9892-838E43BB44F1"><efrbr-expression:titleOfTheExpression>Difference convex optimization techniques in nonsmooth computational mechanics</efrbr-expression:titleOfTheExpression><efrbr-expression:formOfExpression vocabulary="DIAS:TYPES">
            Peer-Reviewed Journal Publication
            Δημοσίευση σε Περιοδικό με Κριτές
         </efrbr-expression:formOfExpression><efrbr-expression:dateOfExpression type="issued">2015-10-12</efrbr-expression:dateOfExpression><efrbr-expression:dateOfExpression type="published">1996</efrbr-expression:dateOfExpression><efrbr-expression:languageOfExpression vocabulary="iso639-1">en</efrbr-expression:languageOfExpression><efrbr-expression:summarizationOfContent>The impact and the usefulness of difference convex optimization techniques for the numerical solution of problems arising in nonsmooth and nonconvex computational mechanics are investigated in this paper. Algorithms for the numerical solution of the problem are proposed and studied. The relation to the more general quasi- and co-differentiable optimization techniques is also discussed. The link to classical, smooth and nonsmooth computational mechanics’thms is also presented</efrbr-expression:summarizationOfContent><efrbr-expression:useRestrictionsOnTheExpression type="creative-commons">http://creativecommons.org/licenses/by/4.0/</efrbr-expression:useRestrictionsOnTheExpression><efrbr-expression:note type="journal name">Optimization Methods and Software</efrbr-expression:note><efrbr-expression:note type="journal volume">1</efrbr-expression:note><efrbr-expression:note type="journal number">7</efrbr-expression:note><efrbr-expression:note type="page range">57-81</efrbr-expression:note></efrbr-expression:expression><efrbr-person:person identifier="http://users.isc.tuc.gr/~gestavroulakis"><efrbr-person:nameOfPerson vocabulary="TUC:LDAP">
            Stavroulakis Georgios
            Σταυρουλακης Γεωργιος
         </efrbr-person:nameOfPerson></efrbr-person:person><efrbr-person:person identifier="335C8817-8D1D-49D9-BAF3-C5BD7B74E2F3"><efrbr-person:nameOfPerson vocabulary="">
            L.N. Polyakova
         </efrbr-person:nameOfPerson></efrbr-person:person><efrbr-corporateBody:corporateBody identifier="http://www.springerlink.com/?MUD=MP"><efrbr-corporateBody:nameOfTheCorporateBody vocabulary="S/R:PUBLISHERS">
            Springer Verlag
         </efrbr-corporateBody:nameOfTheCorporateBody></efrbr-corporateBody:corporateBody><efrbr-concept:concept identifier="http://id.loc.gov/authorities/subjects/sh95001744"><efrbr-concept:termForTheConcept>
            Algorithm of Euclid
            Continued division
            Division, Continued
            Euclid algorithm
            Euclidian algorithm
            Euclid's algorithm
            euclidean algorithm
            algorithm of euclid
            continued division
            division continued
            euclid algorithm
            euclidian algorithm
            euclids algorithm
         </efrbr-concept:termForTheConcept></efrbr-concept:concept></efrbr:entities><efrbr:relationships><efrbr-structure:structureRelations><efrbr-structure:realizedThrough sourceEntity="work" targetEntity="expression" sourceURI="http://purl.tuc.gr/dl/dias/56D3FA90-F298-4A92-9892-838E43BB44F1" targetURI="http://purl.tuc.gr/dl/dias/56D3FA90-F298-4A92-9892-838E43BB44F1"/></efrbr-structure:structureRelations><efrbr-responsible:responsibleRelations><efrbr-responsible:createdBy sourceEntity="work" targetEntity="person" sourceURI="http://purl.tuc.gr/dl/dias/56D3FA90-F298-4A92-9892-838E43BB44F1" targetURI="http://users.isc.tuc.gr/~gestavroulakis"/><efrbr-responsible:realizedBy sourceEntity="expression" role="author" targetEntity="person" sourceURI="http://purl.tuc.gr/dl/dias/56D3FA90-F298-4A92-9892-838E43BB44F1" targetURI="http://users.isc.tuc.gr/~gestavroulakis"/><efrbr-responsible:realizedBy sourceEntity="expression" role="author" targetEntity="person" sourceURI="http://purl.tuc.gr/dl/dias/56D3FA90-F298-4A92-9892-838E43BB44F1" targetURI="335C8817-8D1D-49D9-BAF3-C5BD7B74E2F3"/><efrbr-responsible:realizedBy sourceEntity="expression" role="publisher" targetEntity="person" sourceURI="http://purl.tuc.gr/dl/dias/56D3FA90-F298-4A92-9892-838E43BB44F1" targetURI="http://www.springerlink.com/?MUD=MP"/></efrbr-responsible:responsibleRelations><efrbr-subject:subjectRelations><efrbr-subject:hasSubject sourceEntity="work" targetEntity="concept" sourceURI="http://purl.tuc.gr/dl/dias/56D3FA90-F298-4A92-9892-838E43BB44F1" targetURI="http://id.loc.gov/authorities/subjects/sh95001744"/></efrbr-subject:subjectRelations><efrbr-other:otherRelations/></efrbr:relationships></efrbr:recordSet>