About: Contracting Optimally an Interval Matrix without Loosing Any Positive Semi-Definite Matrix Is a Tractable Problem     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
Description
  • Není k dispozici (cs)
  • In this paper, we show that the problem of computing the smallest interval submatrix of a given interval matrix [A] which contains all symmetric positive semi-definite (PSD) matrices of [A], is a linear matrix inequality (LMI) problem, a convex optimization problem over the cone of positive semidefinite matrices, that can be solved in polynomial time. From a constraint viewpoint, this problem corresponds to projecting the global constraint PSD (A) over its domain [A]. Projecting such a global constraint, in a constraint propagation process, makes it possible to avoid the decomposition of the PSD constraint into primitive constraints and thus increases the efficiency and the accuracy of the resolution.
  • In this paper, we show that the problem of computing the smallest interval submatrix of a given interval matrix [A] which contains all symmetric positive semi-definite (PSD) matrices of [A], is a linear matrix inequality (LMI) problem, a convex optimization problem over the cone of positive semidefinite matrices, that can be solved in polynomial time. From a constraint viewpoint, this problem corresponds to projecting the global constraint PSD (A) over its domain [A]. Projecting such a global constraint, in a constraint propagation process, makes it possible to avoid the decomposition of the PSD constraint into primitive constraints and thus increases the efficiency and the accuracy of the resolution. (en)
Title
  • Contracting Optimally an Interval Matrix without Loosing Any Positive Semi-Definite Matrix Is a Tractable Problem
  • Není k dispozici (cs)
  • Contracting Optimally an Interval Matrix without Loosing Any Positive Semi-Definite Matrix Is a Tractable Problem (en)
skos:prefLabel
  • Contracting Optimally an Interval Matrix without Loosing Any Positive Semi-Definite Matrix Is a Tractable Problem
  • Není k dispozici (cs)
  • Contracting Optimally an Interval Matrix without Loosing Any Positive Semi-Definite Matrix Is a Tractable Problem (en)
skos:notation
  • RIV/68407700:21230/05:03107958!RIV06-GA0-21230___
http://linked.open.../vavai/riv/strany
  • 1 ; 17
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(GA102/02/0709), P(ME 698)
http://linked.open...iv/cisloPeriodika
  • 1
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 516296
http://linked.open...ai/riv/idVysledku
  • RIV/68407700:21230/05:03107958
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • interval matrix; semi-definite matrix (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...odStatuVydavatele
  • DE - Spolková republika Německo
http://linked.open...ontrolniKodProRIV
  • [1E063FF12832]
http://linked.open...i/riv/nazevZdroje
  • Reliable Computing
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...v/svazekPeriodika
  • 11
http://linked.open...iv/tvurceVysledku
  • Henrion, Didier
  • Jaulin, L.
issn
  • 1385-3139
number of pages
http://localhost/t...ganizacniJednotka
  • 21230
is http://linked.open...avai/riv/vysledek of
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software