ŁOJASIEWICZ-TYPE INEQUALITIES AND GLOBAL ERROR BOUNDS FOR NONSMOOTH DEFINABLE FUNCTIONS IN O-MINIMAL STRUCTURES

In this paper, we give some Łojasiewicz-type inequalities for continuous definable functions in an o-minimal structure. We also give a necessary and sufficient condition for the existence of a global error bound and the relationship between the Palais–Smale condition and this global error bound. Moreover, we give a Łojasiewicz nonsmooth gradient inequality at infinity near the fibre for continuous definable functions in an o-minimal structure.

Error Bounds and Finite Termination for Constrained Optimization Problems

We present a global error bound for the projected gradient of nonconvex constrained optimization problems and a local error bound for the distance from a feasible solution to the optimal solution set of convex constrained optimization problems, by using the merit function involved in the sequential quadratic programming (SQP) method. For the solution sets (stationary points set andKKTpoints set) of nonconvex constrained optimization problems, we establish the definitions of generalized nondegeneration and generalized weak sharp minima. Based on the above, the necessary and sufficient conditions for a feasible solution of the nonconvex constrained optimization problems to terminate finitely at the two solutions are given, respectively. Accordingly, the results in this paper improve and popularize existing results known in the literature. Further, we utilize the global error bound for the projected gradient with the merit function being computed easily to describe these necessary and sufficient conditions.

An Improvement of Global Error Bound for the Generalized Nonlinear Complementarity Problem over a Polyhedral Cone

We consider the global error bound for the generalized nonlinear complementarity problem over a polyhedral cone (GNCP). By a new technique, we establish an easier computed global error bound for the GNCP under weaker conditions, which improves the result obtained by Sun and Wang (2013) for GNCP.

A Sharper Global Error Bound for the Generalized Nonlinear Complementarity Problem over a Polyhedral Cone

We revisit the global error bound for the generalized nonlinear complementarity problem over a polyhedral cone (GNCP). By establishing a new equivalent formulation of the GNCP, we establish a sharper global error bound for the GNCP under weaker conditions, which improves the existing error bound estimation for the problem.

The Solution Set Characterization and Error Bound for the Extended Mixed Linear Complementarity Problem

For the extended mixed linear complementarity problem (EML CP), we first present the characterization of the solution set for the EMLCP. Based on this, its global error bound is also established under milder conditions. The results obtained in this paper can be taken as an extension for the classical linear complementarity problems.