A D.C. Algorithm via Convex Analysis Approach for Solving a Location Problem Involving Sets

We study a location problem that involves a weighted sum of distances to closed convex sets. As several of the weights might be negative, traditional solution methods of convex optimization are not applicable. After obtaining some existence theorems, we introduce a simple, but effective, algorithm for solving the problem. Our method is based on the Pham Dinh - Le Thi algorithm for d.c. programming and a generalized version of the Weiszfeld algorithm, which works well for convex location problems

Sensitivity Analysis of a Stationary Point Set Map under Total Perturbations. Part 2: Robinson Stability

In Part 1 of this paper, we have estimated the Fr\'echet coderivative and the Mordukhovich coderivative of the stationary point set map of a smooth parametric optimization problem with one smooth functional constraint under total perturbations. From these estimates, necessary and sufficient conditions for the local Lipschitz-like property of the map have been obtained. In this part, we establish sufficient conditions for the Robinson stability of the stationary point set map. This allows us to revisit and extend several stability theorems in indefinite quadratic programming. A comparison of our results with the ones which can be obtained via another approach is also given.Comment: This manuscript is based on the paper "Sensitivity Analysis of a Stationary Point Set Map under Total Perturbations. Part 2: Robinson Stability" which has been pubplished in Journal of Optimization Theory and Applications (DOI: 10.1007/s10957-018-1295-4). We have added the Section 6 "Appendices" to the paper. This section presents two proofs of Lemmas 5.1 and 5.

SONOCHEMICAL DEGRADATION OF CARBON TETRACHLORIDE IN AQUEOUS SOLUTION AT TWO FREQUENCIES : 200KHZ AND 600KHZ, 200W ACOUSTIC POWER

Joint Research on Environmental Science and Technology for the Eart