Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-17T11:14:30.801Z Has data issue: false hasContentIssue false

Computation of the distance to semi-algebraic sets

Published online by Cambridge University Press:  15 August 2002

Christophe Ferrier*
Affiliation:
Département Mathématiques Appliquées et Analyse Numérique, Centre National d'Études Spatiales, 18 avenue E. Belin, 31401 Toulouse Cedex 4, France; Christophe.Ferrier@cnes.fr.
Get access

Abstract

This paper is devoted to the computation of distance to set, called S, defined by polynomial equations. First we consider the case of quadratic systems. Then, application of results stated for quadratic systems to the quadratic equivalent of polynomial systems (see [5]), allows us to compute distance to semi-algebraic sets. Problem of computing distance can be viewed as non convex minimization problem: $ d(u,S) = \inf_{x \in S} \| x-u\|^2$ , where u is in $\mathcal{R}^{n}$ . To have, at least, lower approximation of distance, we consider the dual bound m(u) associated with the dual problem and give sufficient conditions to guarantee m(u) = d(u,S). The second part deal with numerical computation of m(u) using an interior point method in semidefinite programming. Last, various examples, namely from chemistry and robotic, are given.

Information

Type
Research Article
Copyright
© EDP Sciences, SMAI, 2000

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable