UnivTrevesV1, Istex, Corpus, bibRecord, 000632

Branch-and-bound methods for solving systems of Lipschitzian equations and inequalities

Identifieur interne : 000632 ( Istex/Corpus ); précédent : 000631; suivant : 000633

Branch-and-bound methods for solving systems of Lipschitzian equations and inequalities

Source :

Journal of Optimization Theory and Applications [ 0022-3239 ] ; 1988-07-01.

RBID : ISTEX:59E84C267DB12A35468BF8BB4B967CE4C8C7AD14

Abstract

Abstract: In this note, we show how branch-and-bound methods previously proposed for solving broad classes of multiextremal global optimization problems can be applied for solving systems of Lipschitzian equations and inequalities over feasible sets defined by various types of constraints. Some computational results are given.

Url:

https://api.istex.fr/document/59E84C267DB12A35468BF8BB4B967CE4C8C7AD14/fulltext/pdf

DOI: 10.1007/BF00939776

Links to Exploration step

ISTEX:59E84C267DB12A35468BF8BB4B967CE4C8C7AD14

Le document en format XML

<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Branch-and-bound methods for solving systems of Lipschitzian equations and inequalities</title>
<author><name sortKey="Horst, R" sort="Horst, R" uniqKey="Horst R" first="R." last="Horst">R. Horst</name>
<affiliation><mods:affiliation>Fachbereich IV-Mathematik, Universität Trier, Trier, West Germany</mods:affiliation>
</affiliation>
</author>
<author><name sortKey="Thoai, Ng V" sort="Thoai, Ng V" uniqKey="Thoai N" first="Ng V." last="Thoai">Ng V. Thoai</name>
<affiliation><mods:affiliation>Institute of Mathematics, Hanoi, Vietnam</mods:affiliation>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:59E84C267DB12A35468BF8BB4B967CE4C8C7AD14</idno>
<date when="1988" year="1988">1988</date>
<idno type="doi">10.1007/BF00939776</idno>
<idno type="url">https://api.istex.fr/document/59E84C267DB12A35468BF8BB4B967CE4C8C7AD14/fulltext/pdf</idno>
<idno type="wicri:Area/Istex/Corpus">000632</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000632</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Branch-and-bound methods for solving systems of Lipschitzian equations and inequalities</title>
<author><name sortKey="Horst, R" sort="Horst, R" uniqKey="Horst R" first="R." last="Horst">R. Horst</name>
<affiliation><mods:affiliation>Fachbereich IV-Mathematik, Universität Trier, Trier, West Germany</mods:affiliation>
</affiliation>
</author>
<author><name sortKey="Thoai, Ng V" sort="Thoai, Ng V" uniqKey="Thoai N" first="Ng V." last="Thoai">Ng V. Thoai</name>
<affiliation><mods:affiliation>Institute of Mathematics, Hanoi, Vietnam</mods:affiliation>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series><title level="j">Journal of Optimization Theory and Applications</title>
<title level="j" type="abbrev">J Optim Theory Appl</title>
<idno type="ISSN">0022-3239</idno>
<idno type="eISSN">1573-2878</idno>
<imprint><publisher>Kluwer Academic Publishers-Plenum Publishers</publisher>
<pubPlace>New York</pubPlace>
<date type="published" when="1988-07-01">1988-07-01</date>
<biblScope unit="volume">58</biblScope>
<biblScope unit="issue">1</biblScope>
<biblScope unit="page" from="139">139</biblScope>
<biblScope unit="page" to="145">145</biblScope>
</imprint>
<idno type="ISSN">0022-3239</idno>
</series>
<idno type="istex">59E84C267DB12A35468BF8BB4B967CE4C8C7AD14</idno>
<idno type="DOI">10.1007/BF00939776</idno>
<idno type="ArticleID">BF00939776</idno>
<idno type="ArticleID">Art10</idno>
</biblStruct>
</sourceDesc>
<seriesStmt><idno type="ISSN">0022-3239</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass></textClass>
<langUsage><language ident="en">en</language>
</langUsage>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Abstract: In this note, we show how branch-and-bound methods previously proposed for solving broad classes of multiextremal global optimization problems can be applied for solving systems of Lipschitzian equations and inequalities over feasible sets defined by various types of constraints. Some computational results are given.</div>
</front>
</TEI>
<istex><corpusName>springer</corpusName>
<author><json:item><name>R. Horst</name>
<affiliations><json:string>Fachbereich IV-Mathematik, Universität Trier, Trier, West Germany</json:string>
</affiliations>
</json:item>
<json:item><name>Ng V. Thoai</name>
<affiliations><json:string>Institute of Mathematics, Hanoi, Vietnam</json:string>
</affiliations>
</json:item>
</author>
<articleId><json:string>BF00939776</json:string>
<json:string>Art10</json:string>
</articleId>
<language><json:string>eng</json:string>
</language>
<originalGenre><json:string>OriginalPaper</json:string>
</originalGenre>
<abstract>Abstract: In this note, we show how branch-and-bound methods previously proposed for solving broad classes of multiextremal global optimization problems can be applied for solving systems of Lipschitzian equations and inequalities over feasible sets defined by various types of constraints. Some computational results are given.</abstract>
<qualityIndicators><score>2.686</score>
<pdfVersion>1.3</pdfVersion>
<pdfPageSize>432 x 648 pts</pdfPageSize>
<refBibsNative>false</refBibsNative>
<keywordCount>0</keywordCount>
<abstractCharCount>328</abstractCharCount>
<pdfWordCount>2146</pdfWordCount>
<pdfCharCount>7865</pdfCharCount>
<pdfPageCount>7</pdfPageCount>
<abstractWordCount>45</abstractWordCount>
</qualityIndicators>
<title>Branch-and-bound methods for solving systems of Lipschitzian equations and inequalities</title>
<refBibs><json:item><host><author></author>
<title>This research was accomplished while the second author was a fellow of the Alexander von Humboldt Foundation at the University of Trier</title>
</host>
</json:item>
<json:item><host><author><json:item><name> Professor</name>
</json:item>
<json:item><name>Iv-Mathematik Fachbereich</name>
</json:item>
</author>
</host>
</json:item>
<json:item><author><json:item><name>Staff Doctor</name>
</json:item>
<json:item><name> Member</name>
</json:item>
</author>
<host><author></author>
<title>Institute of Mathematics</title>
</host>
</json:item>
<json:item><author><json:item><name>Horst </name>
</json:item>
<json:item><name>R Tuy</name>
</json:item>
<json:item><name>H </name>
</json:item>
</author>
<host><volume>54</volume>
<pages><last>271</last>
<first>253</first>
</pages>
<author></author>
<title>Journal of Optimization Theory and Applications</title>
<publicationDate>1987</publicationDate>
</host>
<title>On the Convergence of Global Methods in Multiextremal Optimization</title>
<publicationDate>1987</publicationDate>
</json:item>
<json:item><host><author><json:item><name>Horst </name>
</json:item>
<json:item><name>R </name>
</json:item>
</author>
<title>Deterministic Global Optimization with Partition Sets Whose Feasibility Is Not Known: Applications to Concave Minimization, Reverse Convex Constraints</title>
<publicationDate>1988</publicationDate>
</host>
</json:item>
<json:item><author><json:item><name>Dc-Programming </name>
</json:item>
<json:item><name>Lipschitzian Optimization</name>
</json:item>
</author>
<host><volume>58</volume>
<pages><last>37</last>
<first>11</first>
</pages>
<author></author>
<title>Journal of Optimization Theory and Applications</title>
<publicationDate>1988</publicationDate>
</host>
<publicationDate>1988</publicationDate>
</json:item>
<json:item><host><pages><last>103</last>
<first>91</first>
</pages>
<author><json:item><name>Pinter </name>
</json:item>
<json:item><name>J </name>
</json:item>
</author>
<title>Extended Univariate Algorithms for n-Dimensional Global Optimization , Computing</title>
<publicationDate>1986</publicationDate>
</host>
</json:item>
<json:item><author><json:item><name>Scarf </name>
</json:item>
<json:item><name>H </name>
</json:item>
</author>
<host><volume>15</volume>
<pages><last>1343</last>
<first>1328</first>
</pages>
<author></author>
<title>SIAM Journal on Applied Mathematics</title>
<publicationDate>1967</publicationDate>
</host>
<title>Approximation of Fixed Points</title>
<publicationDate>1967</publicationDate>
</json:item>
</refBibs>
<genre><json:string>research-article</json:string>
</genre>
<host><volume>58</volume>
<pages><last>145</last>
<first>139</first>
</pages>
<issn><json:string>0022-3239</json:string>
</issn>
<issue>1</issue>
<subject><json:item><value>Theory of Computation</value>
</json:item>
<json:item><value>Applications of Mathematics</value>
</json:item>
<json:item><value>Optimization</value>
</json:item>
<json:item><value>Calculus of Variations and Optimal Control</value>
</json:item>
<json:item><value>Optimization</value>
</json:item>
<json:item><value>Engineering, general</value>
</json:item>
<json:item><value>Operation Research/Decision Theory</value>
</json:item>
</subject>
<journalId><json:string>10957</json:string>
</journalId>
<genre><json:string>journal</json:string>
</genre>
<language><json:string>unknown</json:string>
</language>
<eissn><json:string>1573-2878</json:string>
</eissn>
<title>Journal of Optimization Theory and Applications</title>
<publicationDate>1988</publicationDate>
<copyrightDate>1988</copyrightDate>
</host>
<categories><wos><json:string>science</json:string>
<json:string>operations research & management science</json:string>
<json:string>mathematics, applied</json:string>
</wos>
<scienceMetrix><json:string>applied sciences</json:string>
<json:string>engineering</json:string>
<json:string>operations research</json:string>
</scienceMetrix>
</categories>
<publicationDate>1988</publicationDate>
<copyrightDate>1988</copyrightDate>
<doi><json:string>10.1007/BF00939776</json:string>
</doi>
<id>59E84C267DB12A35468BF8BB4B967CE4C8C7AD14</id>
<score>1.3381228</score>
<fulltext><json:item><extension>pdf</extension>
<original>true</original>
<mimetype>application/pdf</mimetype>
<uri>https://api.istex.fr/document/59E84C267DB12A35468BF8BB4B967CE4C8C7AD14/fulltext/pdf</uri>
</json:item>
<json:item><extension>zip</extension>
<original>false</original>
<mimetype>application/zip</mimetype>
<uri>https://api.istex.fr/document/59E84C267DB12A35468BF8BB4B967CE4C8C7AD14/fulltext/zip</uri>
</json:item>
<istex:fulltextTEI uri="https://api.istex.fr/document/59E84C267DB12A35468BF8BB4B967CE4C8C7AD14/fulltext/tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">Branch-and-bound methods for solving systems of Lipschitzian equations and inequalities</title>
<respStmt><resp>Références bibliographiques récupérées via GROBID</resp>
<name resp="ISTEX-API">ISTEX-API (INIST-CNRS)</name>
</respStmt>
<respStmt><resp>Références bibliographiques récupérées via GROBID</resp>
<name resp="ISTEX-API">ISTEX-API (INIST-CNRS)</name>
</respStmt>
</titleStmt>
<publicationStmt><authority>ISTEX</authority>
<publisher>Kluwer Academic Publishers-Plenum Publishers</publisher>
<pubPlace>New York</pubPlace>
<availability><p>Plenum Publishing Corporation, 1988</p>
</availability>
<date>1988</date>
</publicationStmt>
<notesStmt><note>Technical Note</note>
</notesStmt>
<sourceDesc><biblStruct type="inbook"><analytic><title level="a" type="main" xml:lang="en">Branch-and-bound methods for solving systems of Lipschitzian equations and inequalities</title>
<author xml:id="author-1"><persName><forename type="first">R.</forename>
<surname>Horst</surname>
</persName>
<note type="biography">Professor</note>
<affiliation>Professor</affiliation>
<affiliation>Fachbereich IV-Mathematik, Universität Trier, Trier, West Germany</affiliation>
</author>
<author xml:id="author-2"><persName><forename type="first">Ng</forename>
<surname>Thoai</surname>
</persName>
<note type="biography">Doctor, Staff Member</note>
<affiliation>Doctor, Staff Member</affiliation>
<affiliation>Institute of Mathematics, Hanoi, Vietnam</affiliation>
</author>
</analytic>
<monogr><title level="j">Journal of Optimization Theory and Applications</title>
<title level="j" type="abbrev">J Optim Theory Appl</title>
<idno type="journal-ID">10957</idno>
<idno type="pISSN">0022-3239</idno>
<idno type="eISSN">1573-2878</idno>
<idno type="issue-article-count">15</idno>
<idno type="volume-issue-count">3</idno>
<imprint><publisher>Kluwer Academic Publishers-Plenum Publishers</publisher>
<pubPlace>New York</pubPlace>
<date type="published" when="1988-07-01"></date>
<biblScope unit="volume">58</biblScope>
<biblScope unit="issue">1</biblScope>
<biblScope unit="page" from="139">139</biblScope>
<biblScope unit="page" to="145">145</biblScope>
</imprint>
</monogr>
<idno type="istex">59E84C267DB12A35468BF8BB4B967CE4C8C7AD14</idno>
<idno type="DOI">10.1007/BF00939776</idno>
<idno type="ArticleID">BF00939776</idno>
<idno type="ArticleID">Art10</idno>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><creation><date>1988</date>
</creation>
<langUsage><language ident="en">en</language>
</langUsage>
<abstract xml:lang="en"><p>Abstract: In this note, we show how branch-and-bound methods previously proposed for solving broad classes of multiextremal global optimization problems can be applied for solving systems of Lipschitzian equations and inequalities over feasible sets defined by various types of constraints. Some computational results are given.</p>
</abstract>
<textClass><keywords scheme="Journal Subject"><list><head>Mathematics</head>
<item><term>Theory of Computation</term>
</item>
<item><term>Applications of Mathematics</term>
</item>
<item><term>Optimization</term>
</item>
<item><term>Calculus of Variations and Optimal Control</term>
</item>
<item><term>Optimization</term>
</item>
<item><term>Engineering, general</term>
</item>
<item><term>Operation Research/Decision Theory</term>
</item>
</list>
</keywords>
</textClass>
</profileDesc>
<revisionDesc><change when="1988-07-01">Published</change>
<change xml:id="refBibs-istex" who="#ISTEX-API" when="2016-11-22">References added</change>
<change xml:id="refBibs-istex" who="#ISTEX-API" when="2017-01-21">References added</change>
</revisionDesc>
</teiHeader>
</istex:fulltextTEI>
<json:item><extension>txt</extension>
<original>false</original>
<mimetype>text/plain</mimetype>
<uri>https://api.istex.fr/document/59E84C267DB12A35468BF8BB4B967CE4C8C7AD14/fulltext/txt</uri>
</json:item>
</fulltext>
<metadata><istex:metadataXml wicri:clean="Springer, Publisher found" wicri:toSee="no header"><istex:xmlDeclaration>version="1.0" encoding="UTF-8"</istex:xmlDeclaration>
<istex:docType PUBLIC="-//Springer-Verlag//DTD A++ V2.4//EN" URI="http://devel.springer.de/A++/V2.4/DTD/A++V2.4.dtd" name="istex:docType"></istex:docType>
<istex:document><Publisher><PublisherInfo><PublisherName>Kluwer Academic Publishers-Plenum Publishers</PublisherName>
<PublisherLocation>New York</PublisherLocation>
</PublisherInfo>
<Journal><JournalInfo JournalProductType="ArchiveJournal" NumberingStyle="Unnumbered"><JournalID>10957</JournalID>
<JournalPrintISSN>0022-3239</JournalPrintISSN>
<JournalElectronicISSN>1573-2878</JournalElectronicISSN>
<JournalTitle>Journal of Optimization Theory and Applications</JournalTitle>
<JournalAbbreviatedTitle>J Optim Theory Appl</JournalAbbreviatedTitle>
<JournalSubjectGroup><JournalSubject Type="Primary">Mathematics</JournalSubject>
<JournalSubject Type="Secondary">Theory of Computation</JournalSubject>
<JournalSubject Type="Secondary">Applications of Mathematics</JournalSubject>
<JournalSubject Type="Secondary">Optimization</JournalSubject>
<JournalSubject Type="Secondary">Calculus of Variations and Optimal Control</JournalSubject>
<JournalSubject Type="Secondary">Optimization</JournalSubject>
<JournalSubject Type="Secondary">Engineering, general</JournalSubject>
<JournalSubject Type="Secondary">Operation Research/Decision Theory</JournalSubject>
</JournalSubjectGroup>
</JournalInfo>
<Volume><VolumeInfo VolumeType="Regular" TocLevels="0"><VolumeIDStart>58</VolumeIDStart>
<VolumeIDEnd>58</VolumeIDEnd>
<VolumeIssueCount>3</VolumeIssueCount>
</VolumeInfo>
<Issue IssueType="Regular"><IssueInfo TocLevels="0"><IssueIDStart>1</IssueIDStart>
<IssueIDEnd>1</IssueIDEnd>
<IssueArticleCount>15</IssueArticleCount>
<IssueHistory><CoverDate><Year>1988</Year>
<Month>7</Month>
</CoverDate>
</IssueHistory>
<IssueCopyright><CopyrightHolderName>Plenum Publishing Corporation</CopyrightHolderName>
<CopyrightYear>1988</CopyrightYear>
</IssueCopyright>
</IssueInfo>
<Article ID="Art10"><ArticleInfo Language="En" ArticleType="OriginalPaper" NumberingStyle="Unnumbered" TocLevels="0" ContainsESM="No"><ArticleID>BF00939776</ArticleID>
<ArticleDOI>10.1007/BF00939776</ArticleDOI>
<ArticleSequenceNumber>10</ArticleSequenceNumber>
<ArticleTitle Language="En">Branch-and-bound methods for solving systems of Lipschitzian equations and inequalities</ArticleTitle>
<ArticleCategory>Technical Note</ArticleCategory>
<ArticleFirstPage>139</ArticleFirstPage>
<ArticleLastPage>145</ArticleLastPage>
<ArticleHistory><RegistrationDate><Year>2004</Year>
<Month>12</Month>
<Day>20</Day>
</RegistrationDate>
</ArticleHistory>
<ArticleCopyright><CopyrightHolderName>Plenum Publishing Corporation</CopyrightHolderName>
<CopyrightYear>1988</CopyrightYear>
</ArticleCopyright>
<ArticleGrants Type="Regular"><MetadataGrant Grant="OpenAccess"></MetadataGrant>
<AbstractGrant Grant="OpenAccess"></AbstractGrant>
<BodyPDFGrant Grant="Restricted"></BodyPDFGrant>
<BodyHTMLGrant Grant="Restricted"></BodyHTMLGrant>
<BibliographyGrant Grant="Restricted"></BibliographyGrant>
<ESMGrant Grant="Restricted"></ESMGrant>
</ArticleGrants>
<ArticleContext><JournalID>10957</JournalID>
<VolumeIDStart>58</VolumeIDStart>
<VolumeIDEnd>58</VolumeIDEnd>
<IssueIDStart>1</IssueIDStart>
<IssueIDEnd>1</IssueIDEnd>
</ArticleContext>
</ArticleInfo>
<ArticleHeader><AuthorGroup><Author AffiliationIDS="Aff1"><AuthorName DisplayOrder="Western"><GivenName>R.</GivenName>
<FamilyName>Horst</FamilyName>
</AuthorName>
<Role>Professor</Role>
</Author>
<Author AffiliationIDS="Aff2"><AuthorName DisplayOrder="Western"><GivenName>Ng</GivenName>
<GivenName>V.</GivenName>
<FamilyName>Thoai</FamilyName>
</AuthorName>
<Role>Doctor, Staff Member</Role>
</Author>
<Affiliation ID="Aff1"><OrgDivision>Fachbereich IV-Mathematik</OrgDivision>
<OrgName>Universität Trier</OrgName>
<OrgAddress><City>Trier</City>
<Country>West Germany</Country>
</OrgAddress>
</Affiliation>
<Affiliation ID="Aff2"><OrgName>Institute of Mathematics</OrgName>
<OrgAddress><City>Hanoi</City>
<Country>Vietnam</Country>
</OrgAddress>
</Affiliation>
</AuthorGroup>
<Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading>
<Para>In this note, we show how branch-and-bound methods previously proposed for solving broad classes of multiextremal global optimization problems can be applied for solving systems of Lipschitzian equations and inequalities over feasible sets defined by various types of constraints. Some computational results are given.</Para>
</Abstract>
<KeywordGroup Language="En"><Heading>Key Words</Heading>
<Keyword>Systems of equations</Keyword>
<Keyword>systems of inequalities</Keyword>
<Keyword>branch-and-bound methods</Keyword>
<Keyword>fixed points</Keyword>
</KeywordGroup>
<ArticleNote Type="CommunicatedBy"><SimplePara>Communicated by G. Leitmann</SimplePara>
</ArticleNote>
<ArticleNote Type="Misc"><SimplePara>This research was accomplished while the second author was a fellow of the Alexander von Humboldt Foundation at the University of Trier, Trier, West Germany.</SimplePara>
</ArticleNote>
</ArticleHeader>
<NoBody></NoBody>
</Article>
</Issue>
</Volume>
</Journal>
</Publisher>
</istex:document>
</istex:metadataXml>
<mods version="3.6"><titleInfo lang="en"><title>Branch-and-bound methods for solving systems of Lipschitzian equations and inequalities</title>
</titleInfo>
<titleInfo type="alternative" contentType="CDATA" lang="en"><title>Branch-and-bound methods for solving systems of Lipschitzian equations and inequalities</title>
</titleInfo>
<name type="personal"><namePart type="given">R.</namePart>
<namePart type="family">Horst</namePart>
<affiliation>Fachbereich IV-Mathematik, Universität Trier, Trier, West Germany</affiliation>
<role><roleTerm type="text">author</roleTerm>
</role>
<description>Professor</description>
</name>
<name type="personal"><namePart type="given">Ng</namePart>
<namePart type="given">V.</namePart>
<namePart type="family">Thoai</namePart>
<affiliation>Institute of Mathematics, Hanoi, Vietnam</affiliation>
<role><roleTerm type="text">author</roleTerm>
</role>
<description>Doctor, Staff Member</description>
</name>
<typeOfResource>text</typeOfResource>
<genre type="research-article" displayLabel="OriginalPaper"></genre>
<originInfo><publisher>Kluwer Academic Publishers-Plenum Publishers</publisher>
<place><placeTerm type="text">New York</placeTerm>
</place>
<dateIssued encoding="w3cdtf">1988-07-01</dateIssued>
<copyrightDate encoding="w3cdtf">1988</copyrightDate>
</originInfo>
<language><languageTerm type="code" authority="rfc3066">en</languageTerm>
<languageTerm type="code" authority="iso639-2b">eng</languageTerm>
</language>
<physicalDescription><internetMediaType>text/html</internetMediaType>
</physicalDescription>
<abstract lang="en">Abstract: In this note, we show how branch-and-bound methods previously proposed for solving broad classes of multiextremal global optimization problems can be applied for solving systems of Lipschitzian equations and inequalities over feasible sets defined by various types of constraints. Some computational results are given.</abstract>
<note>Technical Note</note>
<relatedItem type="host"><titleInfo><title>Journal of Optimization Theory and Applications</title>
</titleInfo>
<titleInfo type="abbreviated"><title>J Optim Theory Appl</title>
</titleInfo>
<genre type="journal" displayLabel="Archive Journal"></genre>
<originInfo><dateIssued encoding="w3cdtf">1988-07-01</dateIssued>
<copyrightDate encoding="w3cdtf">1988</copyrightDate>
</originInfo>
<subject><genre>Mathematics</genre>
<topic>Theory of Computation</topic>
<topic>Applications of Mathematics</topic>
<topic>Optimization</topic>
<topic>Calculus of Variations and Optimal Control</topic>
<topic>Optimization</topic>
<topic>Engineering, general</topic>
<topic>Operation Research/Decision Theory</topic>
</subject>
<identifier type="ISSN">0022-3239</identifier>
<identifier type="eISSN">1573-2878</identifier>
<identifier type="JournalID">10957</identifier>
<identifier type="IssueArticleCount">15</identifier>
<identifier type="VolumeIssueCount">3</identifier>
<part><date>1988</date>
<detail type="volume"><number>58</number>
<caption>vol.</caption>
</detail>
<detail type="issue"><number>1</number>
<caption>no.</caption>
</detail>
<extent unit="pages"><start>139</start>
<end>145</end>
</extent>
</part>
<recordInfo><recordOrigin>Plenum Publishing Corporation, 1988</recordOrigin>
</recordInfo>
</relatedItem>
<identifier type="istex">59E84C267DB12A35468BF8BB4B967CE4C8C7AD14</identifier>
<identifier type="DOI">10.1007/BF00939776</identifier>
<identifier type="ArticleID">BF00939776</identifier>
<identifier type="ArticleID">Art10</identifier>
<accessCondition type="use and reproduction" contentType="copyright">Plenum Publishing Corporation, 1988</accessCondition>
<recordInfo><recordContentSource>SPRINGER</recordContentSource>
<recordOrigin>Plenum Publishing Corporation, 1988</recordOrigin>
</recordInfo>
</mods>
</metadata>
<serie></serie>
</istex>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Istex/Corpus

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000632 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 000632 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Rhénanie
   |area=    UnivTrevesV1
   |flux=    Istex
   |étape=   Corpus
   |type=    RBID
   |clé=     ISTEX:59E84C267DB12A35468BF8BB4B967CE4C8C7AD14
   |texte=   Branch-and-bound methods for solving systems of Lipschitzian equations and inequalities
}}

This area was generated with Dilib version V0.6.31.
Data generation: Sat Jul 22 16:29:01 2017. Site generation: Wed Feb 28 14:55:37 2024

	Serveur d'exploration sur l'Université de Trèves
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.

Serveur d'exploration sur l'Université de Trèves

Branch-and-bound methods for solving systems of Lipschitzian equations and inequalities

Branch-and-bound methods for solving systems of Lipschitzian equations and inequalities

Source :

Abstract

Links to Exploration step

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri