Recursive Algorithms for Inner Ellipsoidal Approximation of Convex Polytopes (Articolo in rivista)

Type

• Articolo in rivista (Classe)
• Prodotto della ricerca (Classe)

Label

• Recursive Algorithms for Inner Ellipsoidal Approximation of Convex Polytopes (Articolo in rivista) (literal)

Anno

• 2003-01-01T00:00:00+01:00 (literal)

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#doi

• 10.1016/S0005-1098(03)00180-8 (literal)

Alternative label

• F. Dabbene, P. Gay, B. T. Polyak (2003)
  Recursive Algorithms for Inner Ellipsoidal Approximation of Convex Polytopes
  in Automatica (Oxf.)
  (literal)

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori

• F. Dabbene, P. Gay, B. T. Polyak (literal)

Pagina inizio

• 1773 (literal)

Pagina fine

• 1781 (literal)

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#altreInformazioni

• Times Cited: 4 (from Web of Science) (literal)

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#numeroVolume

• 39 (literal)

Rivista

• Automatica (Rivista)

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#numeroFascicolo

• 10 (literal)

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#descrizioneSinteticaDelProdotto

• In this paper, fast recursive algorithms for the approximation of an n-dimensional convex polytope by means of an inscribed ellipsoid are presented. These algorithms consider at each step a single inequality describing the polytope and, under mild assumptions, they are guaranteed to converge in a finite number of steps. For their recursive nature, the proposed algorithms are better suited to treat a quite large number of constraints than standard off-line solutions, and have their natural application to problems where the set of constraints is iteratively updated, as on-line estimation problems, nonlinear convex optimization procedures and set membership identification. (literal)

Note

• ISI Web of Science (WOS) (literal)

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#affiliazioni

• Fabrizio Dabbene is with IEIIT-CNR, Politecnico di Torino, Corso Duca degli Abruzzi 24, 10129 Torino, Italy Paolo Gay is with Dipartimento di Economia e Ingegneria Agraria, Forestale e Ambientale, Università degli Studi di Torino, Grugliasco (To), Italy Boris T. Polyak is with Institute for Control Science, Moscow, Russia (literal)

Titolo

• Recursive Algorithms for Inner Ellipsoidal Approximation of Convex Polytopes (literal)

Abstract

• In this paper, fast recursive algorithms for the approximation of an n-dimensional convex polytope by means of an inscribed ellipsoid are presented. These algorithms consider at each step a single inequality describing the polytope and, under mild assumptions, they are guaranteed to converge in a finite number of steps. For their recursive nature, the proposed algorithms are better suited to treat a quite large number of constraints than standard off-line solutions, and have their natural application to problems where the set of constraints is iteratively updated, as on-line estimation problems, nonlinear convex optimization procedures and set membership identification. (literal)

Prodotto di

• Istituto di elettronica e di ingegneria dell'informazione e delle telecomunicazioni (IEIIT) (Istituto)

Autore CNR

• PAOLO GAY (Persona)
• FABRIZIO DABBENE (Unità di personale interno)

Insieme di parole chiave

• Keywords of "Recursive Algorithms for Inner Ellipsoidal Approximation of Convex Polytopes" (Insieme di parole chiave)

Incoming links:

Prodotto

• Istituto di elettronica e di ingegneria dell'informazione e delle telecomunicazioni (IEIIT) (Istituto)

Autore CNR di

• FABRIZIO DABBENE (Unità di personale interno)
• PAOLO GAY (Persona)

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#rivistaDi

• Automatica (Rivista)

Insieme di parole chiave di

• Keywords of "Recursive Algorithms for Inner Ellipsoidal Approximation of Convex Polytopes" (Insieme di parole chiave)