On continuous selections of polynomial functions

被引:1
作者
Guo, Feng [1 ]
Jiao, Liguo [2 ]
Sang Kim, Do [3 ]
机构
[1] Dalian Univ Technol, Sch Math Sci, Dalian, Peoples R China
[2] Northeast Normal Univ, Acad Adv Interdisciplinary Studies, Changchun, Jilin, Peoples R China
[3] Pukyong Natl Univ, Dept Appl Math, Busan, South Korea
基金
新加坡国家研究基金会;
关键词
Continuous selections; polynomial functions; critical points; generic properties; ERROR-BOUNDS; OPTIMALITY CONDITIONS; GENERIC PROPERTIES; STABILITY; OPTIMIZATION; SYSTEMS; POINT;
D O I
10.1080/02331934.2022.2103417
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
A continuous selection of polynomial functions is a continuous function whose domain can be partitioned into finitely many pieces on which the function coincides with a polynomial. Given a set of finitely many polynomials, we show that there are only finitely many continuous selections of it and each one is semi-algebraic. Then, we establish some generic properties regarding the critical points, defined by the Clarke subdifferential, of these continuous selections. In particular, given a set of finitely many polynomials with generic coefficients, we show that the critical points of all continuous selections of it are finite and the critical values are all different, and we also derive the coercivity of those continuous selections which are bounded from below. We point out that some existing results about Lojasiewicz's inequality and error bounds for the maximum function of some finitely many polynomials can be extended to all the continuous selections of them.
引用
收藏
页码:295 / 328
页数:34
相关论文
共 49 条
[1]   On the stable equilibrium points of gradient systems [J].
Absil, P-A. ;
Kurdyka, K. .
SYSTEMS & CONTROL LETTERS, 2006, 55 (07) :573-577
[2]   On morse theory for piecewise smooth functions [J].
A. A. Agrachev ;
D. Pallaschke ;
S. Scholtes .
Journal of Dynamical and Control Systems, 1997, 3 (4) :449-469
[3]   Complementarity and nondegeneracy in semidefinite programming [J].
Alizadeh, F ;
Haeberly, JPA ;
Overton, ML .
MATHEMATICAL PROGRAMMING, 1997, 77 (02) :111-128
[4]  
Aze D, 2003, ESAIM P, V1, P1, DOI DOI 10.1051/proc:2003004
[5]   The Morse-Sard theorem for Clarke critical values [J].
Barbet, Luc ;
Dambrine, Marc ;
Daniilidis, Aris .
ADVANCES IN MATHEMATICS, 2013, 242 :217-227
[6]   CONTINUOUS-SELECTIONS OF LINEAR FUNCTIONS AND NONSMOOTH CRITICAL-POINT THEORY [J].
BARTELS, SG ;
KUNTZ, L ;
SCHOLTES, S .
NONLINEAR ANALYSIS-THEORY METHODS & APPLICATIONS, 1995, 24 (03) :385-407
[7]  
BENEDETTI R, 1990, REAL ALGEBRAIC SEMIA
[8]  
Bochnak J., 1998, Real Algebraic Geometry
[9]   QUALIFICATION CONDITIONS IN SEMIALGEBRAIC PROGRAMMING [J].
Bolte, Jerome ;
Hochart, Antoine ;
Pauwels, Edouard .
SIAM JOURNAL ON OPTIMIZATION, 2018, 28 (02) :1867-1891
[10]   From error bounds to the complexity of first-order descent methods for convex functions [J].
Bolte, Jerome ;
Trong Phong Nguyen ;
Peypouquet, Juan ;
Suter, Bruce W. .
MATHEMATICAL PROGRAMMING, 2017, 165 (02) :471-507