SwePub
Sök i LIBRIS databas

  Utökad sökning

id:"swepub:oai:DiVA.org:miun-9338"
 

Sökning: id:"swepub:oai:DiVA.org:miun-9338" > Fast local optimiza...

Fast local optimization in decision analytic software

Ding, Xiasong (författare)
Mittuniversitetet,Institutionen för informationsteknologi och medier (-2013),FSCN - Fibre Science and Communication Network
Ekenberg, Love (preses)
 (creator_code:org_t)
ISBN 9187908794
Sundsvall : Mittuniversitetet, 2004
Engelska 83 s.
Serie: Mid Sweden University licentiate thesis, 1652-8948 ; 2
  • Licentiatavhandling (övrigt vetenskapligt/konstnärligt)
Abstract Ämnesord
Stäng  
  • In decision analysis, significant recognition has been given to the fact that requiring numerically precise information seems unrealistic for real-life decision situations, Despite the emergence of many modern apporaches, which attempt to handle imprecise estimates, concentration has focused more on representation and less on evaluation. Methods such as the DELTA method  challenged this issue by its evaluation framework that can accommodate both precision an imprecision, and thus pushes forward the disign of advanced dicision analysis systems. However, computationally, DELTA may incur time-consuming calculations due to the introduction of imprecise information into the probability space as well as the value space. Although two fast linear programming based bilinear optimazation algorithms were suggested, which were supporsed to satisfy certain presumed conditions, they are found to be too restrictive.This thesis presents a fast potimization approach that can be viewed as a generalized version of the two fast algorithms. The motivation stems from the attempts to discard those presumed conditions. This approach combines ideas from both matrix computations and linear programming, and is, in fact, an iterative method. Since the DELTA method inteds to compute the difference of two expected utilities, this bilinear optimization issue is non-convex, and thus will certainly touch upon the global optimization area. As previously suggested, actually all methods for global optimization consist of two phases: a global phose to thoroughly explore subsets of the feasible region where it is known the blobal optimum will be found, an a local phase to improve the approximation to some local optima, Basically, this fast algorithm is devoted to the local optimization phase.

Ämnesord

NATURVETENSKAP  -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
NATURAL SCIENCES  -- Computer and Information Sciences -- Computer Sciences (hsv//eng)

Nyckelord

bilinear programming
decision analysis
optimization
linear progamming
decision support systems
iterative method
Computer science
Datavetenskap

Publikations- och innehållstyp

vet (ämneskategori)
lic (ämneskategori)

Hitta via bibliotek

Till lärosätets databas

Hitta mer i SwePub

Av författaren/redakt...
Ding, Xiasong
Ekenberg, Love
Om ämnet
NATURVETENSKAP
NATURVETENSKAP
och Data och informa ...
och Datavetenskap
Delar i serien
Mid Sweden Unive ...
Av lärosätet
Mittuniversitetet

Sök utanför SwePub

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy