The minimal time function associated with a collection of sets

Abstract

We define the minimal time function associated with a collection of sets which is motivated by the optimal time problem for nonconvex constant dynamics. We first provide various basic properties of this new function: lower semicontinuity, principle of optimality, convexity, Lipschitz continuity, among others. We also compute and estimate proximal, Fr\'echet and limiting subdifferentials of the new function at points inside the target set as well as at points outside the target. An application to location problems is also given.

A New Algorithm for Privacy-Preserving Horizontally Partitioned Linear Programs

“…Recently, people have become interested in privacy-preserving classification and data mining [1][2][3][4][5][6][7][8][9][10] and have been involved in the field of optimization, especially in linear programming [11][12][13][14][15], where the data to be classified or mined belongs to different entities that are not willing to disclose the data. Mangasarian [13] proposed a random matrix which make the original linear programming problem into a secure linear programming problem.…”

A New Study on Halpern and Nonconvex Combination Algorithm for Nonlinear Mappings in Banach Spaces with Applications

“…Recntly, the SFP and its variants have been investigated by many authors due to its real applications such as medical imaging, radiation therapy, and treatment planning; see, e.g., [2][3][4][5]. For solving SFP (1), it needs to get the inverse A − 1 (assuming the existence of A − 1 ) in algorithm of Censor and Elfving [1].…”

“…e authors proved that x n generated by ( 5) strongly converges to a fixed point of T under some certain conditions on α n and μ n . Later on, Marino et al [28] extended (5) to strict pseudocontraction.…”

A splitting method for a family of equilibrium and inclusion problems

“…Indeed, it includes saddle problems, complementary problems, fixed point problems, and variational inequality problems. On the other hand, it also finds a number of real applications in machine learning, economic and finance, traffic network, medical imaging etc; see, e.g., [3,4,5,6,7,8] and the references therein. From Blum and Oettli [1], one can define a resolvent mapping and transfer the solution problem of the equilibrium problem into a fixed point problem of the resolvent mapping.…”