Challenges in the creation and development of a mathematics MOOC

The fast development of distance learning tools such as Open Educational Resources (OER) and Massive Open Online Courses (MOOC or MOOCs) are indicators of a shift in the way in which digital teaching and learning are understood. MOOC are a new style of online classes that allow any person with web access, anywhere, usually free of charge, to participate through video lectures, computer graded tests and discussion forums. They have been capturing the attention of many higher education institutions around the world. This paper will give us an overview of the “Introduction to Differential Calculus” a MOOC Project, created by an engaged volunteer team of Mathematics lecturers from four schools of the Polytechnic Institute of Oporto (IPP). The MOOC theories and their popularity are presented and complemented by a discussion of some MOOC definitions and their inherent advantages and disadvantages. It will also explore what MOOC mean for Mathematics education. The Project development is revealed by focusing on used MOOC structure, as well as the quite a lot of types of course materials produced. It ends with a presentation of a short discussion about problems and challenges met throughout the development of the project. It is also our goal to contribute for a change in the way teaching and learning Mathematics is seen and practiced nowadays, trying to make education more accessible to as many people as possible and increase our institution (IPP) recognition.

Self-adaptive combination of global tabu search and local search for nonlinear equations

Solving systems of nonlinear equations is a very important task since the problems emerge mostly through the mathematical modelling of real problems that arise naturally in many branches of engineering and in the physical sciences. The problem can be naturally reformulated as a global optimization problem. In this paper, we show that a self-adaptive combination of a metaheuristic with a classical local search method is able to converge to some difficult problems that are not solved by Newton-type methods.

Derivative-free optimization and filter methods to solve nonlinear constrained problems

In real optimization problems, usually the analytical expression of the objective function is not known, nor its derivatives, or they are complex. In these cases it becomes essential to use optimization methods where the calculation of the derivatives, or the verification of their existence, is not necessary: the Direct Search Methods or Derivative-free Methods are one solution. When the problem has constraints, penalty functions are often used. Unfortunately the choice of the penalty parameters is, frequently, very difficult, because most strategies for choosing it are heuristics strategies. As an alternative to penalty function appeared the filter methods. A filter algorithm introduces a function that aggregates the constrained violations and constructs a biobjective problem. In this problem the step is accepted if it either reduces the objective function or the constrained violation. This implies that the filter methods are less parameter dependent than a penalty function. In this work, we present a new direct search method, based on simplex methods, for general constrained optimization that combines the features of the simplex method and filter methods. This method does not compute or approximate any derivatives, penalty constants or Lagrange multipliers. The basic idea of simplex filter algorithm is to construct an initial simplex and use the simplex to drive the search. We illustrate the behavior of our algorithm through some examples. The proposed methods were implemented in Java.