The exact absolute value penalty function method for identifying strict global minima of order m in nonconvex nonsmooth programming

In this paper, it is demonstrated that the exact absolute value penalty function method is useful for identifying the special sort of minimizers in nonconvex nonsmooth optimization problems with both inequality and equality constraints. The equivalence between the sets of strict global minima of order m in nonsmooth minimization problem and of its associated penalized optimization problem with the exact l1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$l_{1}$$\end{document} penalty function is established under nondifferentiable F,ρ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\left( F,\rho \right) $$\end{document}-convexity assumptions imposed on the involved functions. The threshold of the penalty parameter, above which this result holds, is also given.


Introduction
The notion of a strict local minimizer of order m plays an important role in the convergence analysis of iterative numerical methods (see, for example, [1]) and in stability analysis (see, for example, [2,3]). Some results and optimality conditions concerning characterizations of such minimizers for nonlinear constrained mathematical programming problems have been derived by Auslender [4], Studniarski [5], Ward [6]. These results, in general, suggest that these minimizers are often exactly those satisfy an B Tadeusz Antczak antczak@math.uni.lodz.pl "m-th derivative test". In this paper, we present a different approach for identifying of such minimizers.
In the past few years, considerable attention has been given to devising methods for solving nonlinear programming problems via unconstrained minimization techniques. One of classes of such methods which has emerged as very promising is the class of exact penalty function methods. The most popular nondifferentiable exact penalty function is the absolute value penalty function method (also called the exact l 1 penalty function method) and it has been investigated in [7][8][9][10][11][12][13][14][15][16][17][18][19][20][21][22][23][24][25][26], and others. Most of the results established on the nondifferentiable exact l 1 penalty function is devoted to the study of conditions ensuring that an optimal solution in the given convex optimization problem is also an unconstrained solution of the penalty function.
In this paper, we present a new characterization of the exact penalty method with the absolute value penalty function used to solve a class of nonconvex nondifferentiable optimization problems involving both inequality and equality constraints in which the functions constituting them are locally Lipschitz (F, ρ)-convex functions of order m, not necessarily with respect to the same ρ. Namely, we use the exact l 1 penalty function method to find a strict global minimizer of order m in the considered nonconvex nondifferentiable optimization problem involving both inequality and equality constraints. Indeed, we associate a strict global minimizer of order m in the nonsmooth constrained extremum problem with a strict global minimizer of order m in a unconstrained optimization problem (called penalized optimization problem) constructed in this approach in which the absolute value penalty function is minimized. Further, we also establish the converse result, that is, that a strict global minimizer of order m in the penalized optimization problem with the exact l 1 penalty function is also a strict global minimizer of order m in the nonlinear constrained optimization problem with both inequality and equality constraints. In this way, we prove that the sets of strict global minimizers of order m in both optimization problems coincide for a larger class of optimization problems than convex ones. The treshold of the penalty parameter above which this result holds is equal to the largest Lagrange multiplier in the absolute value. The results established in the paper are illustrated by suitable examples of nonconvex nondifferentiable optimization problems solving by using the exact l 1 penalty function method.

Preliminaries and problem formulation
Throughout this section, X is a nonempty open subset of R n .
By (ii), it is clear that Now, we give the definition of a nondifferentiable (F, ρ)-convex function of order m (see [28]).

Definition 3
A locally Lipschitz function f : X → R is said to be (F, ρ)-convex of order m at u ∈ X on X if, there exist a sublinear (with respect to the third component) functional F : X × X × R n → R, an integer m ≥ 1 and a real number ρ such that, the following inequality holds for every ξ ∈ ∂ f (u) and all x ∈ X . If the above inequality is satisfied for all u ∈ X , then f is said to be (F, ρ)-convex on X .
In the paper, we consider the following constrained optimization problem: where f : X → R and g i : X → R, i ∈ I , h j : X → R, j ∈ J , are locally Lipschitz functions on a nonempty open set X ⊂ R n . For the purpose of simplifying our presentation, we will next introduce some notations which will be used frequently throughout this paper. Let D := {x ∈ X : g i (x) ≤ 0, i ∈ I , h j (x) = 0, j ∈ J be the set of all feasible solutions of problem (P). Further, by I (x) = {i ∈ I : g i (x) = 0}, we denote the set of active inequality constraints at point x ∈ D.
The concept of a strict local minimizer of order m was defined by Cromme [1], under the name "strongly unique" minimizer, in a study of iterative numerical methods.

Definition 4
Let m ≥ 1 be an integer. We say that x is a strict global minimizer of order m in the considered optimization problem (P) if there exists β > 0 such that It is well known (see, for example, [27,29,30]) that, if x ∈ D is an optimal solution for problem (P), then the following conditions, known as the generalized form of the Karush-Kuhn-Tucker conditions, are satisfied: Theorem 5 (Generalized Karush-Kuhn-Tucker necessary optimality conditions). Let x ∈ D be an optimal solution of problem (P) and a suitable constraint qualification be satisfied at x. Then, there exist λ ∈ R p , μ ∈ R s such that Remark 6 Note that, following Hiriart-Urruty [30], a constraint qualification assuring the conclusion of the above theorem is the following one: there exists v ∈ R n , In the presence of inequality constraints, from Fritz John type optimality conditions, Clarke [27] established generalized Karush-Kuhn-Tucker necessary optimality conditions under the assumptions of "calmness" of the optimization problem. This constraint qualification has the advantage to be present in most problems, even if it seems difficult to verify it in general. Further, it is possible to use the following Cottle constraint qualification: Since the results in the paper have been established for nondifferentiable optimization problems with generalized convex functions (that is, locally Lipschitz (F, ρ)-convex of order m), it is possible to use also generalized Slater constraint qualification.
In the paper, we will assume that a suitable constraint qualification is satisfied at any optimal solution in the considered nonlinear constrained optimization problem (P).

Definition 7
The point x ∈ D is said to be a Karush-Kuhn-Tucker point (a KKT point, for short) if there exist the Lagrange multipliers λ ∈ R p , μ ∈ R s such that the conditions (2)-( 4) are satisfied at x with these Lagrange multipliers.

The exact l 1 penalty method for optimization problems with locally Lipschitz (F, ρ)-convex functions of order m
The unconstrained optimization problem with the exact l 1 penalty function constructed in the exact l 1 penalty function method for the considered constrained minimization problem (P) can be written in the following form where, for a given inequality constraint g i (x) ≤ 0, the function g + i (x) is defined as follows: We will call the unconstrained optimization problem (P(c)) the penalized optimization problem (with the absolute value penalty function).

Theorem 8 Let x ∈ D be a Karush-Kuhn-Tucker point of the constrained optimization problem (P), at which the Generalized Karush-Kuhn-Tucker conditions
(2)-(4) are satisfied with the Lagrange multipliers λ ∈ R p and μ ∈ R s . Let Furthermore, assume the following hypotheses are satisfied:

If the penalty parameter c is assumed to be sufficiently large (it is sufficient to set
. . , s, are the Lagrange multipliers associated with the constraint g i and h j , respectively), then x is also a strict global minimizer of order m in its associated penalized optimization problem (P(c)) with the exact l 1 penalty function.
Proof By assumption, x is a Karush-Kuhn-Tucker point of the constrained optimization problem (P). Then, there exist the Lagrange multipliers λ ∈ R p and μ ∈ R s such that the Generalized Karush-Kuhn-Tucker conditions (2)-(4) are satisfied at x. Since assumptions (a)-(d) are fulfilled, by Definition 3, the following inequalities hold for all x ∈ X . Multiplying the inequalities (8) and (9) by the corresponding Lagrange multipliers and the inequalities (10) by −μ j , j ∈ J − (x), then, adding both sides of the obtained inequalities, we get, for all x ∈ X , Since the functional F : X × X × R n → R is sublinear (with respect to the third component), by (11)-(13), we have, for all x ∈ X , respectively, Adding both sides of (7) and (14)- (16), we get Hence, by the Generalized Karush-Kuhn-Tucker condition (2), it follows that the inequality holds for all x ∈ X . Thus, (1) gives By the Generalized Karush-Kuhn-Tucker condition (3) and taking the Lagrange multipliers equal to 0, we have, for all x ∈ X , Using x ∈ D together with (6), we obtain that the inequality holds for all x ∈ X . By assumption, the penalty parameter c is assumed to satisfy the condition c ≥ max λ i , i ∈ I , μ j , j ∈ J ). Since x ∈ D, the inequality above gives for all x ∈ X , By definition of the objective function in the penalized optimization problem (P(c)) with the exact l 1 penalty function, it follows that the inequality holds for all x ∈ X , where Since β > 0, by (17) and Definition 4, we conclude that x is a strict global minimizer of order m in the penalized optimization problem (P(c)) with the absolute value penalty function. Thus, the conclusion of theorem is established.
The result below follows directly from Theorem 8.

Corollary 9
Let x be a strict global minimizer of order m for the considered constrained optimization problem (P) and the suitable constraint qualification be satisfied at x . Furthermore, assume that all assumptions of Theorem 8 are fulfilled. Then x is also a strict global minimizer of order m in the penalized optimization problem (P(c)) with the absolute value penalty function.
In the example below, we consider a nonconvex nonsmooth optimization problem with (F, ρ)-convex functions of order 3, for which assumption e) of Theorem 8 is not satisfied. We show that a strict global minimizer of order 3 in the considered nonconvex nonsmooth optimization problem is not a strict global minimizer of order 3 in its penalized optimization problem (P(c)) with the absolute value penalty function.
Example 10 Consider the following nonsmooth constrained optimization problem Note that D = {x ∈ R : x ≥ 0} and x = 0 is a strict global minimizer of order 3 in the considered nonsmooth optimization problem. It can be shown, by Definition 3, that the objective function f is locally Lipschitz F, ρ f -convex of order 3 at x on R and the constraint function g is locally Lipschitz F, ρ g -convex of order 3 at x on R, where a functional F : Note that assumption e) in Theorem 8 is not satisfied in this case. However, we use the exact l 1 penalty function method to solve the considered nonsmooth optimization problem (P1). Therefore, we construct the following unconstrained optimization problem Further, it is not difficult to see that, for any c > 0, x = 0 is not a strict global minimizer of order 3 in the above unconstrained optimization problem generated in the exact l 1 penalty method (more exactly, it is not a strict global minimizer of any order). This follows from the fact that the downward order of growth of f exceeds the upward of growth of g at x when moving from x towards smaller values. Indeed, note that inf x∈R P(x, c) → −∞ when x → −∞ for any c > 0. As it follows from this example, although the functions constituting the original optimization problem are locally Lipschitz (F, ρ)-convex of order 3 at x on R, then a feasible point x = 0, being a strict global minimizer of order 3 in the given constrained optimization problem (P1), is not a strict global minimizer of order 3 in its associated penalized optimization problem generated in the exact l 1 penalty function method. This is a consequence of the fact that the assumption (e) in Theorem 8 is not satisfied in the considered case. Hence, as it follows even from this example, assumption (e) in Theorem 8 is essential to prove the result in this theorem and it can not be omitted.
Now, under some stronger assumptions, we prove the converse result.

set D of all feasible solutions in the constrained optimization problem (P) is
compact.
If the penalty parameter c is sufficiently large (namely, it is sufficient that c satisfies the condition c > max λ i , i ∈ I , μ j , j ∈ J ), then x is also a strict global minimizer of order m for problem (P).
Proof Assume that x is a global minimizer of order m for the penalized optimization problem (P(c)) with the absolute value penalty function. Then, by definition of the penalized problem (P(c)) and Definition 4, the following inequality holds for all x ∈ X . Using (6) together with the definition of the absolute value, we get that the following inequality holds for all x ∈ X . Therefore, it is also satisfied for all x ∈ D. Hence, by (6), the inequality holds for all x ∈ D. The inequality above means that values of the objective function f are bounded below on the set D. Since f is a continuous function bounded below on the compact set D, therefore, by Weierstrass' theorem, f admits its minimum x on D. Now, we prove that x is a strict global minimizer of order m in the constrained optimization problem (P). First, we show that x is feasible in the given extremum problem (P). By means of contradiction, we suppose that x is not feasible in problem (P). As we have established above, the considered constrained optimization problem (P) has an optimal solution x. Since the suitable constraint qualification is satisfied at x, there exist the Lagrange multipliers λ ∈ R p and μ ∈ R s such that the Generalized Karush-Kuhn-Tucker necessary optimality conditions (2)-(4) are satisfied at x. By hypotheses (a)-(d) and Definition 3, the inequalities hold. Multiplying inequalities (21)-(23) by the corresponding Lagrange multipliers, respectively, by the sublinearity of the functional F (with respect to the third component), it follows that Since the Generalized Karush-Kuhn-Tucker necessary optimality condition (2) is satisfied at x, by (1), the above inequality implies Since the Generalized Karush-Kuhn-Tucker necessary optimality condition (3) is satisfied at x, we have Using the feasibility of x in the original optimization problem (P) together with (6) and (25), we obtain Since x is not feasible in problem (P), (6) implies Combining (24)- (27), we get We By assumption (e), it follows that β > 0. Thus, by the definition of the objective function in problem (P(c)), the following inequality holds. Hence, Since β > 0, it follows that the following inequality holds for every β > 0. But the inequality above contradicts the assumption that x is a global minimizer of order m in the penalized optimization problem (P(c)) with the exact absolute penalty function. Thus, we have established that x is feasible in the constrained optimization problem (P). Then, the conclusion of theorem, that is, the result that x is a global minimizer of order m in the given constrained optimization problem (P) follows directly from (19).
The following result follows directly from Corollary 9 and Theorem 11: , ρ g = − 9 8 , then, by Definition 3, the objective function f is F, ρ f -convex of order 1 at x on R and the constraint function g is locally Lipschitz F, ρ g -convex of order 1 at x on R , and, moreover, the condition ρ f + λρ g ≥ 0 is satisfied. Since we solve problem (P2) by using the exact l 1 penalty function method, we construct the following unconstrained optimization problem P(x, c) = arctan x 2 + |x| + 1 + c max 0, ln x 2 − |x| + 1 . (P2(c)) Then, by Theorem 8, it is follows that, for any penalty parameter c satisfying c > λ, the point x = 0 is also a strict global minimizer of order 1 for the penalized optimization problem (P2(c)) with the absolute value penalty function given above. Furthermore, since both the objective function f is F, ρ f -convex of order 1 and the constraint function g is locally Lipschitz F, ρ g -convex of order 1 at any Karush-Kuhn-Tucker point of problem (P2) on R, by Theorem 11, x = 0, being a strict global minimizer of order 1 for the penalized optimization problem (P2(c)) for all penalty parameters no less than 0, is also a strict global minimizer of order 1 for the considered optimization problem (P2) Thus, in fact, there is the equivalence between the sets of strict global minimizers of order 1 for optimization problems (P2) and (P2(c)).
In the next example, we consider a nonconvex nonsmooth optimization problem in which not all involved functions are (F, ρ)-convex functions of the same order with respect to any sublinear functional F : R × R × R → R. We show in this case that there is no equivalence between the considered nonsmooth optimization problem and its associated penalized optimization problem with the absolute value penalty function in the sense discussed in the paper. In other words, the sets of strict global minimizers of the same order are not the same in these two optimization problems.
Example 14 Consider the following nonsmooth constrained optimization problem Note that D = {x ∈ R : −1 ≤ x ≤ 0} and x = 0 is a strict global minimizer of order 3 for the considered optimization problem. It can be proved that the objective function f is not F, ρ f -convex of order m on R with respect to any sublinear (with respect to the third component) functional F : R × R × R → R (see [28]). In other words, there do not exist real numbers ρ f , ρ g (with ρ f > 0 or ρ g > 0) and the same sublinear functional F : R × R × R → R with respect to which the objective function f is F, ρ f -convex on R and the constraint function g is F, ρ g -convex on R. Since we use the exact l 1 penalty method to solve the considered optimization problem (P3), we construct the following unconstrained optimization problem: Then note that x = 0 is not a strict global minimizer of order 3 for its associated penalized optimization problem (P3(c)) with the exact l 1 penalty function for any penalty parameter c, and the more so, for any penalty parameter c satisfying the condition c > λ 1 . Indeed, it is not difficult to see that the downward order of growth of f exceeds the upward of growth of g at x when moving from x towards smaller values. In fact, note that inf x∈R P c (x) → −∞ when x → −∞ for any c > 0. This follows from the fact that the functions constituting the constrained optimization problem (P3) are not locally Lipschitz (F, ρ)-convex of order m with respect to the same (sublinear with respect to the third component) functional F : Now, we give an example of such a nonsmooth optimization problem in which the objective function is coercive [23], but it is not F, ρ f -convex of order m on R with respect to any sublinear (with respect to the third component) functional F : R × R × R → R (see [28]). We show also in such a case that there is no the equivalence between the considered nonsmooth optimization problem and its associated penalized optimization problem with the absolute value penalty function in the sense discussed in the paper. In other words, the corecivity property of the objective function is not sufficient to ensure that the sets of strict global minimizers of the same order are the same in these two optimization problems.
Example 15 Consider the following nonsmooth constrained optimization problem f (x) = 2 |x + 1| − 2 |x| + |x − 1| → min g(x) = −x ≤ 0. (P4) Note that D = {x ∈ R : x ≥ 0} and it can be shown, by Definition 4, that x = 1 is a strict global minimizer of order 1 in the considered nonsmooth optimization problem (P4). Further, note that the objective function f is coercive (see [23]), but it is not F, ρ f -convex of order 1 on R with respect to any sublinear (with respect to the third component) functional F : R × R × R → R (see [28]). Since we use the exact l 1 penalty method to solve the considered optimization problem (P4), we construct the following unconstrained optimization problem: P(x, c) = 2 |x + 1| − 2 |x| + |x − 1| + c max {0, −x} → min .
(P4(c)) Then note that x = 1 is not a strict global minimizer of order 1 in its associated penalized optimization problem (P4(c)) with the exact l 1 penalty function for any penalty parameter c satisfying the condition c > λ 1 = 1. Further, it can be shown, by Definition 4, that x = −1 is a strict global minimizer of order 1 for penalty parameters c ∈ [1,2). In other words, the treshold of penalty parameters above which there is the equivalence between the sets of strict global minimizers of order 1 in problems (P4) and (P4(c)) is not equal to the largest Lagrange multiplier in the absolute value. This follows from the fact that the the objective function in the constrained optimization problem (P4) is not locally Lipschitz (F, ρ)-convex of order 1 with respect to any sublinear with respect to the third component functional F : R × R × R → R.
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.