<?xml version="1.0" encoding="utf-8"?>
<TEI xmlns="http://www.tei-c.org/ns/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:hal="http://hal.archives-ouvertes.fr/" xmlns:gml="http://www.opengis.net/gml/3.3/" xmlns:gmlce="http://www.opengis.net/gml/3.3/ce" version="1.1" xsi:schemaLocation="http://www.tei-c.org/ns/1.0 http://api.archives-ouvertes.fr/documents/aofr-sword.xsd">
  <teiHeader>
    <fileDesc>
      <titleStmt>
        <title>HAL TEI export of hal-01347568</title>
      </titleStmt>
      <publicationStmt>
        <distributor>CCSD</distributor>
        <availability status="restricted">
          <licence target="https://creativecommons.org/publicdomain/zero/1.0/">CC0 1.0 - Universal</licence>
        </availability>
        <date when="2026-05-21T00:05:51+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">The Exact &lt;em&gt;l&lt;/em&gt;&lt;sub&gt;1&lt;/sub&gt; Penalty Function Method for Constrained Nonsmooth Invex Optimization Problems</title>
            <author role="aut">
              <persName>
                <forename type="first">Tadeusz</forename>
                <surname>Antczak</surname>
              </persName>
              <idno type="halauthorid">1047579-0</idno>
              <affiliation ref="#struct-439562"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Hal</forename>
                <surname>Ifip</surname>
              </persName>
              <email type="md5">2073ac78024b6e13f2714db96e9b1e63</email>
              <email type="domain">inria.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2016-07-21 11:25:51</date>
              <date type="whenModified">2017-12-13 16:10:15</date>
              <date type="whenReleased">2016-07-21 11:48:06</date>
              <date type="whenProduced">2011-09-12</date>
              <date type="whenEndEmbargoed">2016-01-01</date>
              <ref type="file" target="https://inria.hal.science/hal-01347568v1/document">
                <date notBefore="2016-01-01"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://inria.hal.science/hal-01347568v1/file/978-3-642-36062-6_46_Chapter.pdf" id="file-1347568-1428003">
                <date notBefore="2016-01-01"/>
              </ref>
              <ref type="externalLink" target="https://link.springer.com/content/pdf/10.1007%2F978-3-642-36062-6_46.pdf"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="200187">
                <persName>
                  <forename>Hal</forename>
                  <surname>Ifip</surname>
                </persName>
                <email type="md5">2073ac78024b6e13f2714db96e9b1e63</email>
                <email type="domain">inria.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-01347568</idno>
            <idno type="halUri">https://inria.hal.science/hal-01347568</idno>
            <idno type="halBibtex">antczak:hal-01347568</idno>
            <idno type="halRefHtml">&lt;i&gt;25th System Modeling and Optimization (CSMO)&lt;/i&gt;, Sep 2011, Berlin, Germany. pp.461-470, &lt;a target="_blank" href="https://dx.doi.org/10.1007/978-3-642-36062-6_46"&gt;&amp;#x27E8;10.1007/978-3-642-36062-6_46&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">25th System Modeling and Optimization (CSMO), Sep 2011, Berlin, Germany. pp.461-470, &amp;#x27E8;10.1007/978-3-642-36062-6_46&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://creativecommons.org/licenses/by/4.0/">CC BY 4.0 - Attribution<ref corresp="#file-1347568-1428003"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="IFIP">IFIP - International Federation for Information Processing</idno>
            <idno type="stamp" n="IFIP-AICT" corresp="IFIP">IFIP Advances in Information and Communication Technology</idno>
            <idno type="stamp" n="IFIP-TC" corresp="IFIP">IFIP Technical Committees </idno>
            <idno type="stamp" n="IFIP-TC7" corresp="IFIP-TC">TC 7: System Modeling and Optimization</idno>
            <idno type="stamp" n="IFIP-CSMO" corresp="IFIP">CSMO: Conference on System Modelling and Optimization</idno>
            <idno type="stamp" n="IFIP-AICT-391" corresp="IFIP-AICT">System Modeling and Optimization</idno>
          </seriesStmt>
          <notesStmt>
            <note type="commentary">Part 7: Applications and Control of Lumped Parameter Systems</note>
            <note type="audience" n="2">International</note>
            <note type="invited" n="0">No</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
            <note type="proceedings" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">The Exact &lt;em&gt;l&lt;/em&gt;&lt;sub&gt;1&lt;/sub&gt; Penalty Function Method for Constrained Nonsmooth Invex Optimization Problems</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Tadeusz</forename>
                    <surname>Antczak</surname>
                  </persName>
                  <idno type="halauthorid">1047579-0</idno>
                  <affiliation ref="#struct-439562"/>
                </author>
              </analytic>
              <monogr>
                <title level="m">IFIP Advances in Information and Communication Technology</title>
                <meeting>
                  <title>25th System Modeling and Optimization (CSMO)</title>
                  <date type="start">2011-09-12</date>
                  <date type="end">2011-09-16</date>
                  <settlement>Berlin</settlement>
                  <country key="DE">Germany</country>
                </meeting>
                <editor>Dietmar Hömberg</editor>
                <editor>Fredi Tröltzsch</editor>
                <imprint>
                  <publisher>Springer</publisher>
                  <biblScope unit="serie">System Modeling and Optimization</biblScope>
                  <biblScope unit="volume">AICT-391</biblScope>
                  <biblScope unit="pp">461-470</biblScope>
                  <date type="datePub">2013</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1007/978-3-642-36062-6_46</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">Generalized Karush-Kuhn-Tucker optimality conditions</term>
                <term xml:lang="en">locally Lipschitz invex function</term>
                <term xml:lang="en">penalized optimization problem</term>
                <term xml:lang="en">absolute value penalty function</term>
                <term xml:lang="en">exact &lt;em&gt;l&lt;/em&gt;&lt;sub&gt;1&lt;/sub&gt; penalty function method</term>
              </keywords>
              <classCode scheme="halDomain" n="info">Computer Science [cs]</classCode>
              <classCode scheme="halTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halOldTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halTreeTypology" n="COMM">Conference papers</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>The exactness of the penalization for the exact &lt;em&gt;l&lt;/em&gt;&lt;sub&gt;1&lt;/sub&gt; penalty function method used for solving nonsmooth constrained optimization problems with both inequality and equality constraints is considered. Thus, the equivalence between the sets of optimal solutions in the nonsmooth constrained optimization problem and its associated penalized optimization problem with the exact &lt;em&gt;l&lt;/em&gt;&lt;sub&gt;1&lt;/sub&gt; penalty function is established under locally Lipschitz invexity assumptions imposed on the involved functions.</p>
            </abstract>
            <particDesc>
              <org type="consortium">TC 7</org>
            </particDesc>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="institution" xml:id="struct-439562" status="VALID">
          <idno type="ROR">https://ror.org/00s8fpf52</idno>
          <orgName>Łódź University of Technology</orgName>
          <desc>
            <address>
              <addrLine>116 Żeromskiego Street90-924 Lodz</addrLine>
              <country key="PL"/>
            </address>
            <ref type="url">http://www.p.lodz.pl/en/index.htm</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>