This paper refers to Clarke generalized gradient for a smooth composition of max-type functions of the form: f(x) = g(x, maxj∈J1 f1j(x),''', maxj∈Jm fmj(x)), where x ∈Rn, Ji, i = 1,''',m are...This paper refers to Clarke generalized gradient for a smooth composition of max-type functions of the form: f(x) = g(x, maxj∈J1 f1j(x),''', maxj∈Jm fmj(x)), where x ∈Rn, Ji, i = 1,''',m are finite index sets, g and fij,j ∈ Ji, i = 1,... )m, are continuously differentiable on Rm+n and Rn, respectively. In a previous paper) we proposed an algorithm of finding an element of Clarke generalized gradient for f, at a point. In that paper, finding an element of Clarke generalized gradient for f, at a point, is implemented by determining the compatibilities of systems of linear inequalities many times. So its computational amount is very expensive. In this paper) we will modify the algorithm to reduce the times that the compatibilities of systems of linear inequalities have to be determined.展开更多
基金This project is supported by the Science Function of Liaoning Province.
文摘This paper refers to Clarke generalized gradient for a smooth composition of max-type functions of the form: f(x) = g(x, maxj∈J1 f1j(x),''', maxj∈Jm fmj(x)), where x ∈Rn, Ji, i = 1,''',m are finite index sets, g and fij,j ∈ Ji, i = 1,... )m, are continuously differentiable on Rm+n and Rn, respectively. In a previous paper) we proposed an algorithm of finding an element of Clarke generalized gradient for f, at a point. In that paper, finding an element of Clarke generalized gradient for f, at a point, is implemented by determining the compatibilities of systems of linear inequalities many times. So its computational amount is very expensive. In this paper) we will modify the algorithm to reduce the times that the compatibilities of systems of linear inequalities have to be determined.
