Mathematical approach for predicting non-negative tristimulus values using the CAT02 chromatic adaptation transform

It has been reported that for certain colour samples, the chromatic adaptation transform CAT02 imbedded in the CIECAM02 colour appearance model predicts corresponding colours with negative tristimulus values (TSVs), which can cause problems in certain applications. To overcome this problem, a mathematical approach is proposed for modifying CAT02. This approach combines a non-negativity constraint for the TSVs of corresponding colours with the minimization of the colour differences between those values for the corresponding colours obtained by visual observations and the TSVs of the corresponding colours predicted by the model, which is a constrained non-linear optimization problem. By solving the non-linear optimization problem, a new matrix is found. The performance of the CAT02 transform with various matrices including the original CAT02 matrix, and the new matrix are tested using visual datasets and the optimum colours. Test results show that the CAT02 with the new matrix predicted corresponding colours without negative TSVs for all optimum colours and the colour matching functions of the two CIE standard observers under the test illuminants considered. However, the accuracy with the new matrix for predicting the visual data is approximately 1 CIELAB colour difference unit worse compared with the original CAT02. This indicates that accuracy has to be sacrificed to achieve the non-negativity constraint for the TSVs of the corresponding colours.

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.

Primary school teacher’s noticing of students’ mathematical thinking in problem solving

Professional noticing of students’ mathematical thinking in problem solving involves the identification of noteworthy mathematical ideas of students’ mathematical thinking and its interpretation to make decisions in the teaching of mathematics. The goal of this study is to begin to characterize pre-service primary school teachers’ noticing of students’ mathematical thinking when students solve tasks that involve proportional and non-proportional reasoning. From the analysis of how pre-service primary school teachers notice students’ mathematical thinking, we have identified an initial framework with four levels of development. This framework indicates a possible trajectory in the development of primary teachers’ professional noticing.

Global behavior of the Douglas–Rachford method for a nonconvex feasibility problem

In recent times the Douglas–Rachford algorithm has been observed empirically to solve a variety of nonconvex feasibility problems including those of a combinatorial nature. For many of these problems current theory is not sufficient to explain this observed success and is mainly concerned with questions of local convergence. In this paper we analyze global behavior of the method for finding a point in the intersection of a half-space and a potentially non-convex set which is assumed to satisfy a well-quasi-ordering property or a property weaker than compactness. In particular, the special case in which the second set is finite is covered by our framework and provides a prototypical setting for combinatorial optimization problems.

Cost sharing solutions defined by non-negative eigenvectors

The problem of sharing a cost M among n individuals, identified by some characteristic ci∈R+,ci∈R+, appears in many real situations. Two important proposals on how to share the cost are the egalitarian and the proportional solutions. In different situations a combination of both distributions provides an interesting approach to the cost sharing problem. In this paper we obtain a family of (compromise) solutions associated to the Perron’s eigenvectors of Levinger’s transformations of a characteristics matrix A. This family includes both the egalitarian and proportional solutions, as well as a set of suitable intermediate proposals, which we analyze in some specific contexts, as claims problems and inventory cost games.