Procedure for calculating the chloride diffusion coefficient and surface concentration from a profile having a maximum beyond the concrete surface

Chlorides induce local corrosion in the steel reinforcements when reaching the bar surface. The measurement of the rate of ingress of these ions, is made by mathematically fitting the so called “error function equation” into the chloride concentration profile, obtaining so the diffusion coefficient and the chloride concentration at the concrete surface. However, the chloride profiles do not always follow Fick’s law by having the maximum concentration at the concrete surface, but often the profile shows a maximum concentration more in the interior, which indicates a different composition and performance of the most external concrete layer with respect to the internal zones. The paper presents a procedure prepared during the time of the RILEM TC 178-TMC: “Testing and modeling chloride penetration in concrete”, which suggests neglecting the external layer where the chloride concentration increases and using the maximum as an “apparent” surface concentration, called C max and to fit the error function equation into the decreasing concentration profile towards the interior. The prediction of evolution should be made also from the maximum.

Comparative study of RPSALG algorithm for convex semi-infinite programming

The Remez penalty and smoothing algorithm (RPSALG) is a unified framework for penalty and smoothing methods for solving min-max convex semi-infinite programing problems, whose convergence was analyzed in a previous paper of three of the authors. In this paper we consider a partial implementation of RPSALG for solving ordinary convex semi-infinite programming problems. Each iteration of RPSALG involves two types of auxiliary optimization problems: the first one consists of obtaining an approximate solution of some discretized convex problem, while the second one requires to solve a non-convex optimization problem involving the parametric constraints as objective function with the parameter as variable. In this paper we tackle the latter problem with a variant of the cutting angle method called ECAM, a global optimization procedure for solving Lipschitz programming problems. We implement different variants of RPSALG which are compared with the unique publicly available SIP solver, NSIPS, on a battery of test problems.