A cutting plane method for solving minimax problems in the complex plane

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Numerical algorithms 1992-10, Vol.2 (3), p.409-436
1. Verfasser: Reemtsen, Rembert
Format: Artikel
Sprache:eng
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 436
container_issue 3
container_start_page 409
container_title Numerical algorithms
container_volume 2
creator Reemtsen, Rembert
description
doi_str_mv 10.1007/BF02139477
format Article
fullrecord <record><control><sourceid>crossref</sourceid><recordid>TN_cdi_crossref_primary_10_1007_BF02139477</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>10_1007_BF02139477</sourcerecordid><originalsourceid>FETCH-LOGICAL-c144t-70da10fbcb4da18eb47a9e14f985f6a4292237caf8cedddaec655ba18dd241d83</originalsourceid><addsrcrecordid>eNpFUEtLAzEYDKJgrV78BTkL0SSbbHaPtVgrFLzoecnji13JbpZklfrvTangaQbmwTAI3TJ6zyhVD48bylnVCqXO0IJJxUnLa3leOGWKFKW5RFc5f1Ja7Fwt0HaF7dc89-MHnoIeAQ8w76PDPiacY_g-CkM_9oM-4ClFE2DIuB_xvAds4zAFOJyC1-jC65Dh5g-X6H3z9Lbekt3r88t6tSOWCTETRZ1m1BtrRCENGKF0C0z4tpG-1oK3nFfKat9YcM5psLWUpjid44K5plqiu1OvTTHnBL6bUlmXfjpGu-MH3f8H1S_cZU-i</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>A cutting plane method for solving minimax problems in the complex plane</title><source>SpringerLink Journals - AutoHoldings</source><creator>Reemtsen, Rembert</creator><creatorcontrib>Reemtsen, Rembert</creatorcontrib><identifier>ISSN: 1017-1398</identifier><identifier>EISSN: 1572-9265</identifier><identifier>DOI: 10.1007/BF02139477</identifier><language>eng</language><ispartof>Numerical algorithms, 1992-10, Vol.2 (3), p.409-436</ispartof><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c144t-70da10fbcb4da18eb47a9e14f985f6a4292237caf8cedddaec655ba18dd241d83</citedby><cites>FETCH-LOGICAL-c144t-70da10fbcb4da18eb47a9e14f985f6a4292237caf8cedddaec655ba18dd241d83</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids></links><search><creatorcontrib>Reemtsen, Rembert</creatorcontrib><title>A cutting plane method for solving minimax problems in the complex plane</title><title>Numerical algorithms</title><issn>1017-1398</issn><issn>1572-9265</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1992</creationdate><recordtype>article</recordtype><recordid>eNpFUEtLAzEYDKJgrV78BTkL0SSbbHaPtVgrFLzoecnji13JbpZklfrvTangaQbmwTAI3TJ6zyhVD48bylnVCqXO0IJJxUnLa3leOGWKFKW5RFc5f1Ja7Fwt0HaF7dc89-MHnoIeAQ8w76PDPiacY_g-CkM_9oM-4ClFE2DIuB_xvAds4zAFOJyC1-jC65Dh5g-X6H3z9Lbekt3r88t6tSOWCTETRZ1m1BtrRCENGKF0C0z4tpG-1oK3nFfKat9YcM5psLWUpjid44K5plqiu1OvTTHnBL6bUlmXfjpGu-MH3f8H1S_cZU-i</recordid><startdate>199210</startdate><enddate>199210</enddate><creator>Reemtsen, Rembert</creator><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>199210</creationdate><title>A cutting plane method for solving minimax problems in the complex plane</title><author>Reemtsen, Rembert</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c144t-70da10fbcb4da18eb47a9e14f985f6a4292237caf8cedddaec655ba18dd241d83</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1992</creationdate><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Reemtsen, Rembert</creatorcontrib><collection>CrossRef</collection><jtitle>Numerical algorithms</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Reemtsen, Rembert</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A cutting plane method for solving minimax problems in the complex plane</atitle><jtitle>Numerical algorithms</jtitle><date>1992-10</date><risdate>1992</risdate><volume>2</volume><issue>3</issue><spage>409</spage><epage>436</epage><pages>409-436</pages><issn>1017-1398</issn><eissn>1572-9265</eissn><doi>10.1007/BF02139477</doi><tpages>28</tpages></addata></record>
fulltext fulltext
identifier ISSN: 1017-1398
ispartof Numerical algorithms, 1992-10, Vol.2 (3), p.409-436
issn 1017-1398
1572-9265
language eng
recordid cdi_crossref_primary_10_1007_BF02139477
source SpringerLink Journals - AutoHoldings
title A cutting plane method for solving minimax problems in the complex plane
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-04T20%3A11%3A56IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-crossref&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20cutting%20plane%20method%20for%20solving%20minimax%20problems%20in%20the%20complex%20plane&rft.jtitle=Numerical%20algorithms&rft.au=Reemtsen,%20Rembert&rft.date=1992-10&rft.volume=2&rft.issue=3&rft.spage=409&rft.epage=436&rft.pages=409-436&rft.issn=1017-1398&rft.eissn=1572-9265&rft_id=info:doi/10.1007/BF02139477&rft_dat=%3Ccrossref%3E10_1007_BF02139477%3C/crossref%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true