Logic-Based Outer-Approximation Algorithm for Solving Discrete-Continuous Dynamic Optimization Problems

We present an extension of the logic outer-approximation algorithm for dealing with disjunctive discrete-continuous optimal control problems whose dynamic behavior is modeled in terms of differential-algebraic equations. Although the proposed algorithm can be applied to a wide variety of discrete-continuous optimal control problems, we are mainly interested in problems where disjunctions are also present. Disjunctions are included to take into account only certain parts of the underlying model which become relevant under some processing conditions. By doing so the numerical robustness of the optimization algorithm improves since those parts of the model that are not active are discarded leading to a reduced size problem and avoiding potential model singularities. We test the proposed algorithm using three examples of different complex dynamic behavior. In all the case studies the number of iterations and the computational effort required to obtain the optimal solutions is modest and the solutions are relatively easy to find.

New glimpses on convex infinite optimization duality

Given a convex optimization problem (P) in a locally convex topological vector space X with an arbitrary number of constraints, we consider three possible dual problems of (P), namely, the usual Lagrangian dual (D), the perturbational dual (Q), and the surrogate dual (Δ), the last one recently introduced in a previous paper of the authors (Goberna et al., J Convex Anal 21(4), 2014). As shown by simple examples, these dual problems may be all different. This paper provides conditions ensuring that inf(P)=max(D), inf(P)=max(Q), and inf(P)=max(Δ) (dual equality and existence of dual optimal solutions) in terms of the so-called closedness regarding to a set. Sufficient conditions guaranteeing min(P)=sup(Q) (dual equality and existence of primal optimal solutions) are also provided, for the nominal problems and also for their perturbational relatives. The particular cases of convex semi-infinite optimization problems (in which either the number of constraints or the dimension of X, but not both, is finite) and linear infinite optimization problems are analyzed. Finally, some applications to the feasibility of convex inequality systems are described.

Constraint qualifications in convex vector semi-infinite optimization

Convex vector (or multi-objective) semi-infinite optimization deals with the simultaneous minimization of finitely many convex scalar functions subject to infinitely many convex constraints. This paper provides characterizations of the weakly efficient, efficient and properly efficient points in terms of cones involving the data and Karush–Kuhn–Tucker conditions. The latter characterizations rely on different local and global constraint qualifications. The results in this paper generalize those obtained by the same authors on linear vector semi-infinite optimization problems.

Stability in Linear Optimization Under Perturbations of the Left-Hand Side Coefficients

This paper studies stability properties of linear optimization problems with finitely many variables and an arbitrary number of constraints, when only left hand side coefficients can be perturbed. The coefficients of the constraints are assumed to be continuous functions with respect to an index which ranges on certain compact Hausdorff topological space, and these properties are preserved by the admissible perturbations. More in detail, the paper analyzes the continuity properties of the feasible set, the optimal set and the optimal value, as well as the preservation of desirable properties (boundedness, uniqueness) of the feasible and of the optimal sets, under sufficiently small perturbations.

Stationarity and regularity of infinite collections of sets. Applications to infinitely constrained optimization

This article continues the investigation of stationarity and regularity properties of infinite collections of sets in a Banach space started in Kruger and López (J. Optim. Theory Appl. 154(2), 2012), and is mainly focused on the application of the stationarity criteria to infinitely constrained optimization problems. We consider several settings of optimization problems which involve (explicitly or implicitly) infinite collections of sets and deduce for them necessary conditions characterizing stationarity in terms of dual space elements—normals and/or subdifferentials.

Calmness modulus of linear semi-infinite programs

Our main goal is to compute or estimate the calmness modulus of the argmin mapping of linear semi-infinite optimization problems under canonical perturbations, i.e., perturbations of the objective function together with continuous perturbations of the right-hand side of the constraint system (with respect to an index ranging in a compact Hausdorff space). Specifically, we provide a lower bound on the calmness modulus for semi-infinite programs with unique optimal solution which turns out to be the exact modulus when the problem is finitely constrained. The relationship between the calmness of the argmin mapping and the same property for the (sub)level set mapping (with respect to the objective function), for semi-infinite programs and without requiring the uniqueness of the nominal solution, is explored, too, providing an upper bound on the calmness modulus of the argmin mapping. When confined to finitely constrained problems, we also provide a computable upper bound as it only relies on the nominal data and parameters, not involving elements in a neighborhood. Illustrative examples are provided.

How Does Intimate Partner Violence Differ Depending on Level of Rurality of Residential Area in Spain?

Intimate partner violence (IPV) is recognized as a worldwide public health problem. Most theories ascribe IPV to individual, family, or cultural factors. Authors analyzed different residential areas in Spain in terms of IPV frequency as well as its impact on health and the use of services. A standardized self-administered cross-sectional survey was administered to ever-partnered adult women ages 18 to 70 years receiving care at primary health care centers (N = 10,322). Logistic regression analyzed the association between the level of rurality and health indicators, IPV, and use of services. The lowest frequency of IPV among women is reflected in higher rurality. Women of medium and low rurality presented a poorer self-perceived health and more physical health problems. Women from medium and low rurality areas declared seeking health services more frequently. These results show the importance of the environment in health and indicate the need for research on urban–rural differences in health problems to develop specific public health programs for each country.

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.

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.

Influencia del esquema aditivo en el desarrollo del razonamiento proporcional

El objetivo de este estudio es analizar la influencia del esquema aditivo en el desarrollo del razonamiento proporcional en estudiantes de educación secundaria. 558 estudiantes de educación secundaria respondieron a un cuestionario de problemas proporcionales y no proporcionales. Los resultados indican (i) que la capacidad de los estudiantes en identificar las relaciones proporcionales en los problemas proporcionales no implica necesariamente que sean capaces de identificar correctamente las relaciones aditivas en los problemas no proporcionales y viceversa; y (ii) que el tipo de relación multiplicativa entre las cantidades (entera o no entera) influía en el nivel de éxito en la resolución de los problemas proporcionales y no proporcionales.

Estrategias didácticas para la promoción de la química en la enseñanza secundaria y bachillerato

El alarmante descenso del número de alumnos que estudian química en bachillerato hace necesaria la búsqueda de herramientas para recuperar los niveles de finales de la pasada década. Los autores proponen algunas estrategias, aplicables en todos los niveles de enseñanza no universitaria, que van desde experiencias de laboratorio para alumnos de primaria, hasta la creación de una serie de personajes de ficción, que intervienen en los enunciados de los problemas de química, poner a disposición de los alumnos colecciones de problemas resueltos y la participación en pruebas como las olimpiadas de química.

Logic-Based Outer Approximation for the Design of Discrete-Continuous Dynamic Systems with Implicit Discontinuities

We address the optimization of discrete-continuous dynamic optimization problems using a disjunctive multistage modeling framework, with implicit discontinuities, which increases the problem complexity since the number of continuous phases and discrete events is not known a-priori. After setting a fixed alternative sequence of modes, we convert the infinite-dimensional continuous mixed-logic dynamic (MLDO) problem into a finite dimensional discretized GDP problem by orthogonal collocation on finite elements. We use the Logic-based Outer Approximation algorithm to fully exploit the structure of the GDP representation of the problem. This modelling framework is illustrated with an optimization problem with implicit discontinuities (diver problem).

Cyclobutadiene automerization and rotation of ethylene: Energetics of the barriers by using Spin-polarized wave functions

Spin-projected spin polarized Møller–Plesset and spin polarized coupled clusters calculations have been made to estimate the cyclobutadiene automerization, the ethylene torsion barriers in their ground state, and the gap between the singlet and triplet states of ethylene. The results have been obtained optimizing the geometries at MP4 and/or CCSD levels, by an extensive Gaussian basis set. A comparative analysis with more complex calculations, up to MP5 and CCSDTQP, together with others from the literature, have also been made, showing the efficacy of using spin-polarized wave functions as a reference wave function for Møller–Plesset and coupled clusters calculations, in such problems.