FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2099680089> ?p ?o ?g. }

• W2099680089 abstract "Optimization is a major field in applied mathematics. Many applications involve the search of the best solution to a problem according to some criterion. Depending on the considered optimization problem, finding the best solution is not always possible in a reasonable amount of time. Heuristic algorithms are often used when the problem is too difficult to solve exactly. These methods are used to speed up the search for a good solution but they do not guarantee that an optimal solution will be found. In this thesis, we explore such heuristic approaches for three different matrix problems. First, we study the minimum-volume bounding box problem, which consists in finding the smallest rectangular parallelepiped enclosing a given set of points in the three-dimensional space. This problem appears for example in collision detection, which is a very important issue in computational geometry and computer graphics. In these applications, a solution has to be determined in a very short amount of time. We propose a new hybrid algorithm able to approximate optimal bounding boxes at a low computational cost. In particular, it is several orders of magnitude faster than the only currently known exact algorithm. Second, we investigate the subset selection problem. Given a large set of features, we want to choose a small subset containing the most relevant features while removing the redundant ones. This problem has applications in data mining since this can be seen as a dimensionality reduction problem. We develop several windowed algorithms that tackle the subset selection problem for the maximum-volume criterion, which is NP-hard. Finally, we address the topic of the approximation of the joint spectral radius. This quantity characterizes the growth rate of product of matrices and is NP-hard to approximate. The joint spectral radius appears in many fields, including system theory, graph theory, combinatorics, language theory... We present an experimental study of existing approaches and propose a new genetic-based algorithm that is able to find bounds on the joint spectral radius in a short amount of time." @default.
• W2099680089 created "2016-06-24" @default.
• W2099680089 creator A5066659898 @default.
• W2099680089 date "2012-01-01" @default.
• W2099680089 modified "2023-09-27" @default.
• W2099680089 title "Heuristic optimization methods for three matrix problems" @default.
• W2099680089 cites W101848008 @default.
• W2099680089 cites W147998453 @default.
• W2099680089 cites W1492640216 @default.
• W2099680089 cites W1497256448 @default.
• W2099680089 cites W150175414 @default.
• W2099680089 cites W1523741643 @default.
• W2099680089 cites W1533419692 @default.
• W2099680089 cites W1552094772 @default.
• W2099680089 cites W1564665474 @default.
• W2099680089 cites W1591868040 @default.
• W2099680089 cites W1597116596 @default.
• W2099680089 cites W1604546801 @default.
• W2099680089 cites W1605061593 @default.
• W2099680089 cites W1632601927 @default.
• W2099680089 cites W1642990561 @default.
• W2099680089 cites W1700290541 @default.
• W2099680089 cites W1718587448 @default.
• W2099680089 cites W172314470 @default.
• W2099680089 cites W1782870224 @default.
• W2099680089 cites W1787402657 @default.
• W2099680089 cites W179323378 @default.
• W2099680089 cites W181733065 @default.
• W2099680089 cites W1829555682 @default.
• W2099680089 cites W1965748532 @default.
• W2099680089 cites W1968027100 @default.
• W2099680089 cites W1969483458 @default.
• W2099680089 cites W1975323734 @default.
• W2099680089 cites W1976744965 @default.
• W2099680089 cites W1978242229 @default.
• W2099680089 cites W1981313592 @default.
• W2099680089 cites W1981663184 @default.
• W2099680089 cites W1986583171 @default.
• W2099680089 cites W1988849934 @default.
• W2099680089 cites W1990304174 @default.
• W2099680089 cites W1991656001 @default.
• W2099680089 cites W1996952488 @default.
• W2099680089 cites W1999250663 @default.
• W2099680089 cites W2002509771 @default.
• W2099680089 cites W2003950764 @default.
• W2099680089 cites W2005102720 @default.
• W2099680089 cites W2005136695 @default.
• W2099680089 cites W2005314985 @default.
• W2099680089 cites W2006041360 @default.
• W2099680089 cites W2008442517 @default.
• W2099680089 cites W2011039300 @default.
• W2099680089 cites W2012231377 @default.
• W2099680089 cites W2012655811 @default.
• W2099680089 cites W2013318791 @default.
• W2099680089 cites W2013583229 @default.
• W2099680089 cites W2016852342 @default.
• W2099680089 cites W2017587562 @default.
• W2099680089 cites W2017899631 @default.
• W2099680089 cites W2018525258 @default.
• W2099680089 cites W2020110698 @default.
• W2099680089 cites W2020979852 @default.
• W2099680089 cites W2024060531 @default.
• W2099680089 cites W2030934791 @default.
• W2099680089 cites W2032326995 @default.
• W2099680089 cites W2038184042 @default.
• W2099680089 cites W2038210983 @default.
• W2099680089 cites W2038260770 @default.
• W2099680089 cites W2039057583 @default.
• W2099680089 cites W2044610104 @default.
• W2099680089 cites W2048103084 @default.
• W2099680089 cites W2053601654 @default.
• W2099680089 cites W2055354539 @default.
• W2099680089 cites W2055472587 @default.
• W2099680089 cites W2076410399 @default.
• W2099680089 cites W2076566814 @default.
• W2099680089 cites W2078409719 @default.
• W2099680089 cites W2079227289 @default.
• W2099680089 cites W2079872371 @default.
• W2099680089 cites W2080042417 @default.
• W2099680089 cites W2082419392 @default.
• W2099680089 cites W2084970142 @default.
• W2099680089 cites W2093818546 @default.
• W2099680089 cites W2093900036 @default.
• W2099680089 cites W2096498192 @default.
• W2099680089 cites W2103111465 @default.
• W2099680089 cites W2104670598 @default.
• W2099680089 cites W2105111377 @default.
• W2099680089 cites W2105333183 @default.
• W2099680089 cites W2112311198 @default.
• W2099680089 cites W2113826709 @default.
• W2099680089 cites W2116656166 @default.
• W2099680089 cites W2117566669 @default.
• W2099680089 cites W2118863844 @default.
• W2099680089 cites W2119233169 @default.
• W2099680089 cites W2123224804 @default.
• W2099680089 cites W2123703543 @default.
• W2099680089 cites W2133860287 @default.
• W2099680089 cites W2134634502 @default.
• W2099680089 cites W2140839682 @default.
• W2099680089 cites W2143560894 @default.

• next