http://www.cnr.it/ontology/cnr/individuo/prodotto/ID31039
An accelerated central cutting plane algorithm for linear semi-infinite programming (Articolo in rivista)
- Type
- Label
- An accelerated central cutting plane algorithm for linear semi-infinite programming (Articolo in rivista) (literal)
- Anno
- 2004-01-01T00:00:00+01:00 (literal)
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#doi
- 10.1007/s10107-003-0492-5 (literal)
- Alternative label
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori
- Pagina inizio
- Pagina fine
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#numeroVolume
- Rivista
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#numeroFascicolo
- Note
- Scopus (literal)
- ISI Web of Science (WOS) (literal)
- Google Scholar (literal)
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#affiliazioni
- Titolo
- An accelerated central cutting plane algorithm for linear semi-infinite programming (literal)
- Abstract
- An algorithm for linear semi-infinite programming is presented which accelerates the convergence of the central cutting plane algorithm first proposed in [4]. Compared with other algorithms, the algorithm in [4] has the advantage of being applicable under mild conditions and of providing feasible solutions. However its convergence has been shown to be rather slow in practical instances. The algorithm proposed in this paper introduces a simple acceleration scheme which gives faster convergence, as confirmed by several examples, as well as an interval of prefixed length containing the optimum value. It is also shown that the algorithm provides a solution of the dual problem and that it can be used for convex semi-infinite programming too. (literal)
- Editore
- Prodotto di
- Autore CNR
- Insieme di parole chiave
Incoming links:
- Autore CNR di
- Prodotto
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#rivistaDi
- Editore di
- Insieme di parole chiave di
