English

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

Algebraic Geometry 2025-07-31 v2 Optimization and Control

Abstract

Let FR[X1,,Xn]F \in \R[X_1,\ldots,X_n] and the zero set V=\zero(P,Rn)V=\zero(\mathcal{P},\R^n), where P:={P1,,Ps}R[X1,,Xn]\mathcal{P}:=\{P_1,\ldots,P_s\} \subset \R[X_1,\ldots,X_n] is a finite set of polynomials. We investigate existence of critical points of FF on an infinitesimal perturbation Vξ=\zero({P1ξ1,,Psξs},Rn)V_{\xi} = \zero(\{P_1-\xi_1,\ldots,P_s-\xi_s\},\R^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 FF on VξV_{\xi}, 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.

Keywords

Cite

@article{arxiv.2506.20565,
  title  = {On the convergence of critical points on real algebraic sets and applications to optimization},
  author = {Saugata Basu and Ali Mohammad-Nezhad},
  journal= {arXiv preprint arXiv:2506.20565},
  year   = {2025}
}

Comments

45 Pages, 4 figures