Institution
Laboratory for Analysis and Architecture of Systems
Facility•Toulouse, France•
About: Laboratory for Analysis and Architecture of Systems is a facility organization based out in Toulouse, France. It is known for research contribution in the topics: Semidefinite programming & Polynomial. The organization has 379 authors who have published 407 publications receiving 10115 citations. The organization is also known as: LAAS-CNRS & LAAS.
Topics: Semidefinite programming, Polynomial, Robustness (computer science), Petri net, Dependability
Papers published on a yearly basis
Papers
More filters
••
TL;DR: It is shown that the problem of finding the unconstrained global minimum of a real-valued polynomial p(x): R n to R, in a compact set K defined byPolynomial inequalities reduces to solving an (often finite) sequence of convex linear matrix inequality (LMI) problems.
Abstract: We consider the problem of finding the unconstrained global minimum of a real-valued polynomial p(x): {\mathbb{R}}^n\to {\mathbb{R}}$, as well as the global minimum of p(x), in a compact set K defined by polynomial inequalities. It is shown that this problem reduces to solving an (often finite) sequence of convex linear matrix inequality (LMI) problems. A notion of Karush--Kuhn--Tucker polynomials is introduced in a global optimality condition. Some illustrative examples are provided.
2,774 citations
•
02 Oct 2009TL;DR: The semidefinite programming methodology to solve the generalized problem of moments is presented and several applications of the GPM are described in detail (notably in optimization, probability, optimal control andmathematical finance).
Abstract: . From a theoretical viewpoint, the GPM has developments and impact in var-ious area of Mathematics like algebra, Fourier analysis, functional analysis, operator theory, probabilityand statistics, to cite a few. In addition, and despite its rather simple and short formulation, the GPMhas a large number of important applications in various fields like optimization, probability, mathematicalfinance, optimal control, control and signal processing, chemistry, cristallography, tomography, quantumcomputing, etc.In its full generality, the GPM is untractable numerically. However when K is a compact basic semi-algebraic set, and the functions involved are polynomials (and in some cases piecewise polynomials orrational functions), then the situation is much nicer. Indeed, one can define a systematic numerical schemebased on a hierarchy of semidefinite programs, which provides a monotone sequence that converges tothe optimal value of the GPM. (A semidefinite program is a convex optimization problem which up toarbitrary fixed precision, can be solved in polynomial time.) Sometimes finite convergence may evenocccur.In the talk, we will present the semidefinite programming methodology to solve the GPM and describein detail several applications of the GPM (notably in optimization, probability, optimal control andmathematical finance).R´ef´erences[1] J.B. Lasserre, Moments, Positive Polynomials and their Applications, Imperial College Press, inpress.[2] J.B. Lasserre, A Semidefinite programming approach to the generalized problem of moments,Math. Prog. 112 (2008), pp. 65–92.
1,020 citations
••
TL;DR: The current research in wearable is examined to serve as references for researchers and provide perspectives for future research, focusing on multi-parameter physiological sensor systems and activity and mobility measurement system designs that reliably measure mobility or vital signs and integrate real-time decision support processing for disease prevention, symptom detection, and diagnosis.
765 citations
01 Jan 2000
TL;DR: The Origins and Integration of the Concepts Critical Applications was held in 1989 fostered the interaction of the dependability and security communities, and advanced the integration of security into the framework of dependable computing.
Abstract: 1 Origins and Integration of the Concepts Critical Applications was held in 1989 This and the six working conferences that followed fostered the interaction of the dependability and security communities, and advanced the integration of security (confidentiality, integrity and availability) into the framework of dependable computing [22] A summary of [22] is presented next The concept of dependable computing first appears in the 1830’s in the context of Babbage’s Calculating Engine [1,2] The first generation of electronic computers (late 1940’s to mid-50’s) used rather unreliable components, therefore practical techniques were employed to improve their reliability, such as error control codes, duplexing with comparison, triplication with voting, diagnostics to locate failed components, etc [3-5] 2 The Principal Concepts: a Summary
765 citations
••
12 Dec 2005
TL;DR: In this article, two different non-linear complementary filters are proposed: Direct complementary filter and Passive nonlinear complementary filter, which evolve explicity on the special orthogonal group SO(3) and can be expressed in quaternion form for easy implementation.
Abstract: This paper considers the problem of obtaining high quality attitude extraction and gyros bias estimation from typical low cost intertial measurement units for applications in control of unmanned aerial vehiccles. Two different non-linear complementary filters are proposed: Direct complementary filter and Passive non-linear complementary filter. Both filters evolve explicity on the special orthogonal group SO(3) and can be expressed in quaternion form for easy implementation. An extension to the passive ocmplementary filter is proposed to provide adaptive gyro bias estimation.
290 citations
Authors
Showing all 385 results
Name | H-index | Papers | Citations |
---|---|---|---|
Jean-Paul Laumond | 55 | 209 | 11121 |
Jean B. Lasserre | 53 | 459 | 15913 |
Rachid Alami | 50 | 242 | 9450 |
Didier Henrion | 45 | 315 | 8249 |
Sophie Tarbouriech | 44 | 363 | 8201 |
Antonio Franchi | 43 | 210 | 5484 |
Sethu Vijayakumar | 42 | 338 | 8921 |
Christophe Prieur | 40 | 348 | 5908 |
Konstantin Avrachenkov | 39 | 322 | 6626 |
Alexandre Seuret | 39 | 201 | 7817 |
Nicolas Mansard | 36 | 123 | 4339 |
Carole Rossi | 36 | 131 | 3957 |
Dimitri Peaucelle | 34 | 170 | 4500 |
Julien Pettré | 34 | 150 | 4118 |
Mario Sznaier | 34 | 330 | 6047 |