Skip to main content Accessibility help

Computation of the distance to semi-algebraic sets

  • Christophe Ferrier (a1)


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.



Hide All
[1] Alizadeth, F., Interior point methods in semidefinite programming with application to combinatorial optimisation. SIAM J. Optim. 5 (1995) 13-51.
[2] A. Bellido, Construction de fonctions d'itération pour le calcul simultané des solutions d'équations et de systèmes d'équations algébriques. Thèse de doctorat de l'Universté Paul Sabatier, Toulouse (1992).
[3] S. Boyd et al., Linear Matrix Inequalities Problem in Control Theory. SIAM, Philadelphia, Stud. Appl. Math. 15 (1995).
[4] Dedieu, J.-P. and Yakoubsohn, J.-C., Localization of an algebraic hypersurface by the exclusion algorithm. Appl. Algebra Engrg. Comm. Comput. 2 (1992) 239-256.
[5] Ch. Ferrier, Hilbert's 17th problem and best dual bounds in quadratic minimization. Cybernetics and System Analysis 5 (1998) 76-91.
[6] A.V. Fiacco and G.P. McCormick, Nonlinear Programming: Sequential Unconstrained Minimization Techniques. John Wiley (1968). Reprinted SIAM, 1990.
[7] Fletcher, R., Semi-definite matrix constraints in optimization. SIAM J. Control Optim. 23 (1985) 493-513.
[8] C. Lemarechal and J.-B. Hiriart-Urruty, Convex Analysis and Minimization Algorithms II. Springer Verlag, Comprehensive Studies in Mathematics 306 (1991).
[9] Jarre, F., Interior-point methods for convex programming. Appl. Math. Optim. 26 (1992) 287-391.
[10] Jarre, F., An interior-point method for minimizing the maximum eigenvalue of a linear combination of matrices. SIAM J. Control Optim. 31 (1993) 1360-1377.
[11] Karmarkar, N., A new polynomial-time algorithm for linear programming. Combinatorica 4 (1984) 373-395.
[12] Kearfott, R.B., Some tests of generalized bisection. ACM Trans. Math. Software 13 (1987) 197-200.
[13] Yu. Nesterov and A. Nemirovsky, Interior-point polynomial methods in convex programming. SIAM, Philadelphia, Stud. Appl. Math. 13 (1994).
[14] Shor, N.Z., Dual estimate in multi-extremal problems. J. Global Optim. 2 (1992) 411-418.
[15] G. Sonnevend, An ``analytical centre'' for polyhedrons and a new classe of global algorithms for linear (smooth, convex) programming. Springer Verlag, Lecture Notes in Control and Inform. Sci. 84, System Modeling and Optimisation. 12th IFIP Conference on system optimisation 1984 (1986) 866-878.
[16] Sonnevend, G. and Stoer, J., Global ellipsoidal approximation and homotopy methods for solving convex analitic programs. Appl. Math. Optim. 21 (1990) 139-165.
[17] D.E. Stewart, Matrix Computation in C. University of Queensland, Australia (1992). ftp site: directory: pub/meschach
[18] Vandenberghe, L. and Boyd, S., Semidefinite programming. SIAM Rev. 1 (1996) 49-95.
[19] Verschelde, J., Verlinden, P. and Cools, R., Homotopy exploiting newton polytopes for solving sparse polynomials systems. SIAM J. Numer. Anal. 31 (1994) 915-930.
[20] Wright, A., Finding solutions to a system of polynomial equations. Math. Comp. 44 (1985) 125-133.


Related content

Powered by UNSILO

Computation of the distance to semi-algebraic sets

  • Christophe Ferrier (a1)


Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed.