A note on an implementation of a method for quadratic semi-infinite programming
Identifieur interne : 000811 ( Istex/Corpus ); précédent : 000810; suivant : 000812A note on an implementation of a method for quadratic semi-infinite programming
Auteurs : R. Hettich ; G. GramlichSource :
- Mathematical Programming [ 0025-5610 ] ; 1990-01-01.
Abstract
Abstract: For convex quadratic semi-infinite programming problems aFortran-package is described. A first coarse grid is successively refined in such a way that the solution on the foregoing grids can be used on the one hand as starting points for the subsequent grids and on the other hand to considerably reduce the number of constraints which have to be considered in the subsequent problems. This enables an efficient treatment of large problems with moderate storage requirements. Powell's (1983) numerically stable convex quadratic programming implementation is used to solve the QP-subproblems.
Url:
DOI: 10.1007/BF01585742
Links to Exploration step
ISTEX:460ED9B51BE8530E0C135F5CE77FD433244A181CLe document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">A note on an implementation of a method for quadratic semi-infinite programming</title><author><name sortKey="Hettich, R" sort="Hettich, R" uniqKey="Hettich R" first="R." last="Hettich">R. Hettich</name><affiliation><mods:affiliation>Universität Trier, FB IV (Mathematik), P.O. Box 3825, 5500, Trier, FR Germany</mods:affiliation></affiliation></author><author><name sortKey="Gramlich, G" sort="Gramlich, G" uniqKey="Gramlich G" first="G." last="Gramlich">G. Gramlich</name><affiliation><mods:affiliation>Universität Trier, FB IV (Mathematik), P.O. Box 3825, 5500, Trier, FR Germany</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:460ED9B51BE8530E0C135F5CE77FD433244A181C</idno><date when="1990" year="1990">1990</date><idno type="doi">10.1007/BF01585742</idno><idno type="url">https://api.istex.fr/document/460ED9B51BE8530E0C135F5CE77FD433244A181C/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000811</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000811</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">A note on an implementation of a method for quadratic semi-infinite programming</title><author><name sortKey="Hettich, R" sort="Hettich, R" uniqKey="Hettich R" first="R." last="Hettich">R. Hettich</name><affiliation><mods:affiliation>Universität Trier, FB IV (Mathematik), P.O. Box 3825, 5500, Trier, FR Germany</mods:affiliation></affiliation></author><author><name sortKey="Gramlich, G" sort="Gramlich, G" uniqKey="Gramlich G" first="G." last="Gramlich">G. Gramlich</name><affiliation><mods:affiliation>Universität Trier, FB IV (Mathematik), P.O. Box 3825, 5500, Trier, FR Germany</mods:affiliation></affiliation></author></analytic><monogr></monogr><series><title level="j">Mathematical Programming</title><title level="j" type="abbrev">Mathematical Programming</title><idno type="ISSN">0025-5610</idno><idno type="eISSN">1436-4646</idno><imprint><publisher>Springer-Verlag</publisher><pubPlace>Berlin/Heidelberg</pubPlace><date type="published" when="1990-01-01">1990-01-01</date><biblScope unit="volume">46</biblScope><biblScope unit="issue">1-3</biblScope><biblScope unit="page" from="249">249</biblScope><biblScope unit="page" to="254">254</biblScope></imprint><idno type="ISSN">0025-5610</idno></series><idno type="istex">460ED9B51BE8530E0C135F5CE77FD433244A181C</idno><idno type="DOI">10.1007/BF01585742</idno><idno type="ArticleID">BF01585742</idno><idno type="ArticleID">Art19</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0025-5610</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: For convex quadratic semi-infinite programming problems aFortran-package is described. A first coarse grid is successively refined in such a way that the solution on the foregoing grids can be used on the one hand as starting points for the subsequent grids and on the other hand to considerably reduce the number of constraints which have to be considered in the subsequent problems. This enables an efficient treatment of large problems with moderate storage requirements. Powell's (1983) numerically stable convex quadratic programming implementation is used to solve the QP-subproblems.</div></front></TEI><istex><corpusName>springer</corpusName><author><json:item><name>R. Hettich</name><affiliations><json:string>Universität Trier, FB IV (Mathematik), P.O. Box 3825, 5500, Trier, FR Germany</json:string></affiliations></json:item><json:item><name>G. Gramlich</name><affiliations><json:string>Universität Trier, FB IV (Mathematik), P.O. Box 3825, 5500, Trier, FR Germany</json:string></affiliations></json:item></author><articleId><json:string>BF01585742</json:string><json:string>Art19</json:string></articleId><language><json:string>eng</json:string></language><originalGenre><json:string>OriginalPaper</json:string></originalGenre><abstract>Abstract: For convex quadratic semi-infinite programming problems aFortran-package is described. A first coarse grid is successively refined in such a way that the solution on the foregoing grids can be used on the one hand as starting points for the subsequent grids and on the other hand to considerably reduce the number of constraints which have to be considered in the subsequent problems. This enables an efficient treatment of large problems with moderate storage requirements. Powell's (1983) numerically stable convex quadratic programming implementation is used to solve the QP-subproblems.</abstract><qualityIndicators><score>3.305</score><pdfVersion>1.3</pdfVersion><pdfPageSize>447 x 666 pts</pdfPageSize><refBibsNative>false</refBibsNative><keywordCount>0</keywordCount><abstractCharCount>600</abstractCharCount><pdfWordCount>2237</pdfWordCount><pdfCharCount>8138</pdfCharCount><pdfPageCount>6</pdfPageCount><abstractWordCount>89</abstractWordCount></qualityIndicators><title>A note on an implementation of a method for quadratic semi-infinite programming</title><refBibs><json:item><host><author><json:item><name>U Eckhardt</name></json:item></author><title>Semi-infinite quadratische Optimierung</title><publicationDate>1978</publicationDate></host></json:item><json:item><author><json:item><name>R Hettich</name></json:item></author><host><volume>34</volume><pages><last>361</last><first>354</first></pages><author></author><title>Mathematical Programming</title><publicationDate>1986</publicationDate></host><title>An implementation of a discretization method for semi-infinite programming</title><publicationDate>1986</publicationDate></json:item><json:item><author><json:item><name>R Hettich</name></json:item><json:item><name>W Van Honstede</name></json:item></author><host><pages><last>111</last><first>97</first></pages><author></author><title>Semi-infinite Programming</title><publicationDate>1979</publicationDate></host><title>On quadratically convergent methods for semi-infinite programming</title><publicationDate>1979</publicationDate></json:item><json:item><author><json:item><name>M,J D Powell</name></json:item></author><host><volume>17</volume><author></author><title>Report DAMTP</title><publicationDate>1983</publicationDate></host><title>ZQPCVX: a FORTRAN subroutine for convex quadratic programming</title><publicationDate>1983</publicationDate></json:item><json:item><author><json:item><name>M,J D Powell</name></json:item></author><host><volume>25</volume><pages><last>61</last><first>46</first></pages><author></author><title>Mathematical Programming</title><publicationDate>1985</publicationDate></host><title>On the quadratic programming algorithm of Goldfarb and ldnani</title><publicationDate>1985</publicationDate></json:item></refBibs><genre><json:string>research-article</json:string></genre><host><volume>46</volume><pages><last>254</last><first>249</first></pages><issn><json:string>0025-5610</json:string></issn><issue>1-3</issue><subject><json:item><value>Mathematics of Computing</value></json:item><json:item><value>Numerical Analysis</value></json:item><json:item><value>Combinatorics</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>Mathematical and Computational Physics</value></json:item><json:item><value>Mathematical Methods in Physics</value></json:item><json:item><value>Numerical and Computational Methods</value></json:item><json:item><value>Operation Research/Decision Theory</value></json:item></subject><journalId><json:string>10107</json:string></journalId><genre><json:string>journal</json:string></genre><language><json:string>unknown</json:string></language><eissn><json:string>1436-4646</json:string></eissn><title>Mathematical Programming</title><publicationDate>1990</publicationDate><copyrightDate>1990</copyrightDate></host><categories><wos><json:string>science</json:string><json:string>operations research & management science</json:string><json:string>mathematics, applied</json:string><json:string>computer science, software engineering</json:string></wos><scienceMetrix><json:string>applied sciences</json:string><json:string>engineering</json:string><json:string>operations research</json:string></scienceMetrix></categories><publicationDate>1990</publicationDate><copyrightDate>1990</copyrightDate><doi><json:string>10.1007/BF01585742</json:string></doi><id>460ED9B51BE8530E0C135F5CE77FD433244A181C</id><score>0.6755811</score><fulltext><json:item><extension>pdf</extension><original>true</original><mimetype>application/pdf</mimetype><uri>https://api.istex.fr/document/460ED9B51BE8530E0C135F5CE77FD433244A181C/fulltext/pdf</uri></json:item><json:item><extension>zip</extension><original>false</original><mimetype>application/zip</mimetype><uri>https://api.istex.fr/document/460ED9B51BE8530E0C135F5CE77FD433244A181C/fulltext/zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/document/460ED9B51BE8530E0C135F5CE77FD433244A181C/fulltext/tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">A note on an implementation of a method for quadratic semi-infinite programming</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>Springer-Verlag</publisher><pubPlace>Berlin/Heidelberg</pubPlace><availability><p>North-Holland, 1990</p></availability><date>1987-11-30</date></publicationStmt><sourceDesc><biblStruct type="inbook"><analytic><title level="a" type="main" xml:lang="en">A note on an implementation of a method for quadratic semi-infinite programming</title><author xml:id="author-1"><persName><forename type="first">R.</forename><surname>Hettich</surname></persName><affiliation>Universität Trier, FB IV (Mathematik), P.O. Box 3825, 5500, Trier, FR Germany</affiliation></author><author xml:id="author-2"><persName><forename type="first">G.</forename><surname>Gramlich</surname></persName><affiliation>Universität Trier, FB IV (Mathematik), P.O. Box 3825, 5500, Trier, FR Germany</affiliation></author></analytic><monogr><title level="j">Mathematical Programming</title><title level="j" type="abbrev">Mathematical Programming</title><idno type="journal-ID">10107</idno><idno type="pISSN">0025-5610</idno><idno type="eISSN">1436-4646</idno><idno type="issue-article-count">31</idno><idno type="volume-issue-count">3</idno><imprint><publisher>Springer-Verlag</publisher><pubPlace>Berlin/Heidelberg</pubPlace><date type="published" when="1990-01-01"></date><biblScope unit="volume">46</biblScope><biblScope unit="issue">1-3</biblScope><biblScope unit="page" from="249">249</biblScope><biblScope unit="page" to="254">254</biblScope></imprint></monogr><idno type="istex">460ED9B51BE8530E0C135F5CE77FD433244A181C</idno><idno type="DOI">10.1007/BF01585742</idno><idno type="ArticleID">BF01585742</idno><idno type="ArticleID">Art19</idno></biblStruct></sourceDesc></fileDesc><profileDesc><creation><date>1987-11-30</date></creation><langUsage><language ident="en">en</language></langUsage><abstract xml:lang="en"><p>Abstract: For convex quadratic semi-infinite programming problems aFortran-package is described. A first coarse grid is successively refined in such a way that the solution on the foregoing grids can be used on the one hand as starting points for the subsequent grids and on the other hand to considerably reduce the number of constraints which have to be considered in the subsequent problems. This enables an efficient treatment of large problems with moderate storage requirements. Powell's (1983) numerically stable convex quadratic programming implementation is used to solve the QP-subproblems.</p></abstract><textClass><classCode scheme="AMS Subject Classifications">49D39</classCode><classCode scheme="AMS Subject Classifications">65K05</classCode></textClass><textClass><keywords scheme="Journal Subject"><list><head>Mathematics</head><item><term>Mathematics of Computing</term></item><item><term>Numerical Analysis</term></item><item><term>Combinatorics</term></item><item><term>Calculus of Variations and Optimal Control</term></item><item><term>Optimization</term></item><item><term>Mathematical and Computational Physics</term></item><item><term>Mathematical Methods in Physics</term></item><item><term>Numerical and Computational Methods</term></item><item><term>Operation Research/Decision Theory</term></item></list></keywords></textClass></profileDesc><revisionDesc><change when="1987-11-30">Created</change><change when="1990-01-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-20">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/460ED9B51BE8530E0C135F5CE77FD433244A181C/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>Springer-Verlag</PublisherName><PublisherLocation>Berlin/Heidelberg</PublisherLocation></PublisherInfo><Journal><JournalInfo JournalProductType="ArchiveJournal" NumberingStyle="Unnumbered"><JournalID>10107</JournalID><JournalPrintISSN>0025-5610</JournalPrintISSN><JournalElectronicISSN>1436-4646</JournalElectronicISSN><JournalTitle>Mathematical Programming</JournalTitle><JournalAbbreviatedTitle>Mathematical Programming</JournalAbbreviatedTitle><JournalSubjectGroup><JournalSubject Type="Primary">Mathematics</JournalSubject><JournalSubject Type="Secondary">Mathematics of Computing</JournalSubject><JournalSubject Type="Secondary">Numerical Analysis</JournalSubject><JournalSubject Type="Secondary">Combinatorics</JournalSubject><JournalSubject Type="Secondary">Calculus of Variations and Optimal Control</JournalSubject><JournalSubject Type="Secondary">Optimization</JournalSubject><JournalSubject Type="Secondary">Mathematical and Computational Physics</JournalSubject><JournalSubject Type="Secondary">Mathematical Methods in Physics</JournalSubject><JournalSubject Type="Secondary">Numerical and Computational Methods</JournalSubject><JournalSubject Type="Secondary">Operation Research/Decision Theory</JournalSubject></JournalSubjectGroup></JournalInfo><Volume><VolumeInfo VolumeType="Regular" TocLevels="0"><VolumeIDStart>46</VolumeIDStart><VolumeIDEnd>46</VolumeIDEnd><VolumeIssueCount>3</VolumeIssueCount></VolumeInfo><Issue IssueType="Combined"><IssueInfo TocLevels="0"><IssueIDStart>1</IssueIDStart><IssueIDEnd>3</IssueIDEnd><IssueArticleCount>31</IssueArticleCount><IssueHistory><CoverDate><Year>1990</Year><Month>1</Month></CoverDate></IssueHistory><IssueCopyright><CopyrightHolderName>North-Holland</CopyrightHolderName><CopyrightYear>1990</CopyrightYear></IssueCopyright></IssueInfo><Article ID="Art19"><ArticleInfo Language="En" ArticleType="OriginalPaper" NumberingStyle="Unnumbered" TocLevels="0" ContainsESM="No"><ArticleID>BF01585742</ArticleID><ArticleDOI>10.1007/BF01585742</ArticleDOI><ArticleSequenceNumber>19</ArticleSequenceNumber><ArticleTitle Language="En">A note on an implementation of a method for quadratic semi-infinite programming</ArticleTitle><ArticleFirstPage>249</ArticleFirstPage><ArticleLastPage>254</ArticleLastPage><ArticleHistory><RegistrationDate><Year>2005</Year><Month>4</Month><Day>14</Day></RegistrationDate><Received><Year>1987</Year><Month>11</Month><Day>30</Day></Received><Revised><Year>1988</Year><Month>5</Month><Day>16</Day></Revised></ArticleHistory><ArticleCopyright><CopyrightHolderName>North-Holland</CopyrightHolderName><CopyrightYear>1990</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>10107</JournalID><VolumeIDStart>46</VolumeIDStart><VolumeIDEnd>46</VolumeIDEnd><IssueIDStart>1</IssueIDStart><IssueIDEnd>3</IssueIDEnd></ArticleContext></ArticleInfo><ArticleHeader><AuthorGroup><Author AffiliationIDS="Aff1"><AuthorName DisplayOrder="Western"><GivenName>R.</GivenName><FamilyName>Hettich</FamilyName></AuthorName></Author><Author AffiliationIDS="Aff1"><AuthorName DisplayOrder="Western"><GivenName>G.</GivenName><FamilyName>Gramlich</FamilyName></AuthorName></Author><Affiliation ID="Aff1"><OrgName>Universität Trier, FB IV (Mathematik)</OrgName><OrgAddress><Postbox>P.O. Box 3825</Postbox><Postcode>5500</Postcode><City>Trier</City><Country>FR Germany</Country></OrgAddress></Affiliation></AuthorGroup><Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading><Para>For convex quadratic semi-infinite programming problems a<Emphasis Type="SmallCaps">Fortran</Emphasis>-package is described. A first coarse grid is successively refined in such a way that the solution on the foregoing grids can be used on the one hand as starting points for the subsequent grids and on the other hand to considerably reduce the number of constraints which have to be considered in the subsequent problems. This enables an efficient treatment of large problems with moderate storage requirements. Powell's (1983) numerically stable convex quadratic programming implementation is used to solve the QP-subproblems.</Para></Abstract><KeywordGroup Language="En"><Heading>AMS Subject Classifications</Heading><Keyword>49D39</Keyword><Keyword>65K05</Keyword></KeywordGroup><KeywordGroup Language="En"><Heading>Key words</Heading><Keyword>Convex quadratic semi-infinite programming</Keyword><Keyword>discretization</Keyword><Keyword>grid-refinement</Keyword></KeywordGroup></ArticleHeader><NoBody></NoBody></Article></Issue></Volume></Journal></Publisher></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>A note on an implementation of a method for quadratic semi-infinite programming</title></titleInfo><titleInfo type="alternative" contentType="CDATA" lang="en"><title>A note on an implementation of a method for quadratic semi-infinite programming</title></titleInfo><name type="personal"><namePart type="given">R.</namePart><namePart type="family">Hettich</namePart><affiliation>Universität Trier, FB IV (Mathematik), P.O. Box 3825, 5500, Trier, FR Germany</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">G.</namePart><namePart type="family">Gramlich</namePart><affiliation>Universität Trier, FB IV (Mathematik), P.O. Box 3825, 5500, Trier, FR Germany</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre type="research-article" displayLabel="OriginalPaper"></genre><originInfo><publisher>Springer-Verlag</publisher><place><placeTerm type="text">Berlin/Heidelberg</placeTerm></place><dateCreated encoding="w3cdtf">1987-11-30</dateCreated><dateIssued encoding="w3cdtf">1990-01-01</dateIssued><copyrightDate encoding="w3cdtf">1990</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: For convex quadratic semi-infinite programming problems aFortran-package is described. A first coarse grid is successively refined in such a way that the solution on the foregoing grids can be used on the one hand as starting points for the subsequent grids and on the other hand to considerably reduce the number of constraints which have to be considered in the subsequent problems. This enables an efficient treatment of large problems with moderate storage requirements. Powell's (1983) numerically stable convex quadratic programming implementation is used to solve the QP-subproblems.</abstract><classification displayLabel="AMS Subject Classifications">49D39</classification><classification displayLabel="AMS Subject Classifications">65K05</classification><relatedItem type="host"><titleInfo><title>Mathematical Programming</title></titleInfo><titleInfo type="abbreviated"><title>Mathematical Programming</title></titleInfo><genre type="journal" displayLabel="Archive Journal"></genre><originInfo><dateIssued encoding="w3cdtf">1990-01-01</dateIssued><copyrightDate encoding="w3cdtf">1990</copyrightDate></originInfo><subject><genre>Mathematics</genre><topic>Mathematics of Computing</topic><topic>Numerical Analysis</topic><topic>Combinatorics</topic><topic>Calculus of Variations and Optimal Control</topic><topic>Optimization</topic><topic>Mathematical and Computational Physics</topic><topic>Mathematical Methods in Physics</topic><topic>Numerical and Computational Methods</topic><topic>Operation Research/Decision Theory</topic></subject><identifier type="ISSN">0025-5610</identifier><identifier type="eISSN">1436-4646</identifier><identifier type="JournalID">10107</identifier><identifier type="IssueArticleCount">31</identifier><identifier type="VolumeIssueCount">3</identifier><part><date>1990</date><detail type="volume"><number>46</number><caption>vol.</caption></detail><detail type="issue"><number>1-3</number><caption>no.</caption></detail><extent unit="pages"><start>249</start><end>254</end></extent></part><recordInfo><recordOrigin>North-Holland, 1990</recordOrigin></recordInfo></relatedItem><identifier type="istex">460ED9B51BE8530E0C135F5CE77FD433244A181C</identifier><identifier type="DOI">10.1007/BF01585742</identifier><identifier type="ArticleID">BF01585742</identifier><identifier type="ArticleID">Art19</identifier><accessCondition type="use and reproduction" contentType="copyright">North-Holland, 1990</accessCondition><recordInfo><recordContentSource>SPRINGER</recordContentSource><recordOrigin>North-Holland, 1990</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 000811 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 000811 | 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:460ED9B51BE8530E0C135F5CE77FD433244A181C
|texte= A note on an implementation of a method for quadratic semi-infinite programming
}}
| This area was generated with Dilib version V0.6.31. |  |