Error bounds for parametric polynomial systems with applications to higher-order stability analysis and convergence rates (Q2413090)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Error bounds for parametric polynomial systems with applications to higher-order stability analysis and convergence rates |
scientific article |
Statements
Error bounds for parametric polynomial systems with applications to higher-order stability analysis and convergence rates (English)
0 references
6 April 2018
0 references
The authors study a parametric inequality system of the form \[ f_k(x,y) \leq 0,~x \in \mathbb R^n,~y \in Y(x),~1 \leq k \leq L, \] where \(f_k(x,y)\), \(k = 1, \dots,L\), are polynomials, \(Y: \mathbb R^n\longrightarrow \mathbb R^m\) is a set-valued mapping that is also described by finitely many polynomials via inequality and equality constraints. The primary goal of the paper is to obtain explicit error bounds for polynomial systems with infinite and variable sets \(Y(x) \subset \mathbb R^m\). The results are obtained by an extension of the Lojasiewicz inequality to the class of supremum marginal functions \[ \Phi(x) = \sup_{y \in Y(x)} f(x,y). \] Applications of the results to higher-order stability analysis in generalized semi-infinite programming, optimization of matrix inequalities, and second-order cone programming are surveyed. Explicit estimates for convergence rates for the cyclic projection algorithm and for asymptotic analysis of subgradient dynamical systems are described.
0 references
polynomial optimization
0 references
error bounds
0 references
variational analysis
0 references
semi-algebraic functions
0 references
higher-order stability analysis
0 references
convergence rate of algorithms
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references