On the convergence of critical points on real algebraic sets and applications to optimization

Abstract

Let F ∈ [X1,…,Xn] and the zero set V=(P,n), where P:=\P1,…,Ps\ ⊂ [X1,…,Xn] is a finite set of polynomials. We investigate existence of critical points of F on an infinitesimal perturbation V = (\P1-1,…,Ps-s\,n). Our main motivation is to understand the limiting behavior of local minimizers of the log-barrier function (and central paths) in polynomial optimization, whose existence plays a fundamental role, in theory and practice, for modern interior point methods. We establish different sets of conditions that ensure existence, finiteness, boundedness, and non-degeneracy of critical points of F on V, respectively. These lead to new conditions for the existence, convergence, and smoothness of central paths of polynomial optimization and its extension to non-linear optimization problems involving definable sets and functions in an o-minimal structure. In particular, for non-linear programs defined by real globally analytic functions, our extension provides a stronger form of the convergence result obtained by Drummond and Peterzil.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…