Stability of Solutions in Parametric Variational Relation Problems

The purpose of this paper is to investigate topological properties and stability of solution sets in parametric variational relation problems. The results of the paper give a unifying way to treat these questions in the theory of variational inequalities, variational inclusions and equilibrium problems.     

Numerical recovery strategies for parallel resilient Krylov linear solvers

As the computational power of high‐performance computing systems continues to increase by using a huge number of cores or specialized processing units, high‐performance computing applications are increasingly prone to faults. In this paper, we present a new class of numerical fault tolerance algorithms to cope with node crashes in parallel distributed environments. This new resilient scheme is designed at application level and does not require extra resources, that is, computational unit or computing time, when no fault occurs. In the framework of iterative methods for the solution of sparse linear systems, we present numerical algorithms to extract relevant information from available data after a fault, assuming a separate mechanism ensures the fault detection. After data extraction, a well‐chosen part of missing data is regenerated through interpolation strategies to constitute meaningful inputs to restart the iterative scheme. We have developed these methods, referred to as interpolation–restart techniques, for Krylov subspace linear solvers. After a fault, lost entries of the current iterate computed by the solver are interpolated to define a new initial guess to restart the Krylov method. A well‐suited initial guess is computed by using the entries of the faulty iterate available on surviving nodes. We present two interpolation policies that preserve key numerical properties of well‐known linear solvers, namely, the monotonic decrease of the A‐norm of the error of the conjugate gradient or the residual norm decrease of generalized minimal residual algorithm for solving. The qualitative numerical behavior of the resulting scheme has been validated with sequential simulations, when the number of faults and the amount of data losses are varied. Finally, the computational costs associated with the recovery mechanism have been evaluated through parallel experiments. Copyright © 2016 John Wiley & Sons, Ltd.     

Multi-commodity supply network planning in the forest supply chain

We consider in this paper a two echelon timber procurement system in which the first echelon consists of multiple harvesting blocks and the second echelon consists of multiple mills (e.g., sawmills), both distributed geographically. Demand is put forward by mills in the form of volumes of logs of specific length and species. Due to the impact of log handling and sorting on cut-to-length harvester and forwarder productivity [Gingras, J.-F., Favreau, J., 2002. Incidence du triage sur la productivité des systèmes par bois tronçonnés. Avantage 3], the harvesting cost per unit volume increases as the number of product variety harvested per block increases. The overall product allocation problem is a large scale mixed integer programming problem with the objective of minimizing combined harvesting and aggregated transportation costs, under demand satisfaction constraints. A heuristic is first introduced then, an algorithm based on the branch-and-price approach is proposed for larger scale problems. Experimentations compare solutions found with the heuristic with the corresponding optimal solutions obtained with both Cplex (using the branch-and-bound approach) and the branch-and-price approach. Results demonstrate the good performance level of the heuristic approach for small scale problems, and of the branch-and-price approach for large scale problems.     

Gradient algorithms for quadratic optimization with fast convergence rates

We propose a family of gradient algorithms for minimizing a quadratic function f(x)=(Ax,x)/2−(x,y) in ℝ ^d or a Hilbert space, with simple rules for choosing the step-size at each iteration. We show that when the step-sizes are generated by a dynamical system with ergodic distribution having the arcsine density on a subinterval of the spectrum of A, the asymptotic rate of convergence of the algorithm can approach the (tight) bound on the rate of convergence of a conjugate gradient algorithm stopped before d iterations, with d≤∞ the space dimension.     

Surfaces in a pseudo-sphere with harmonic or 1-type pseudo-spherical Gauss map

We give a complete classification of Riemannian and Lorentzian surfaces of arbitrary codimension in a pseudo-sphere whose pseudo-spherical Gauss maps are of 1-type or, in particular, harmonic. In some cases a concrete global classification is obtained, while in other cases the solutions are described by an explicit system of partial differential equations.     

Conformally flat,minimal, Lagrangian submanifolds in complex space forms

We investigate n-dimensional (n ⩾ 4), conformally flat, minimal, Lagrangian submanifolds of the n-dimensional complex space form in terms of the multiplicities of the eigenvalues of the Schouten tensor and classify those that admit at most one eigenvalue of multiplicity one. In the case where the ambient space is ℂⁿ, the quasi umbilical case was studied in Blair (2007). However, the classification there is not complete and several examples are missing. Here, we complete (and extend) the classification and we also deal with the case where the ambient complex space form has non-vanishing holomorphic sectional curvature.

     

PMMA‐grafted dextran glycopolymers by atom transfer radical polymerization

The four‐step synthesis of amphiphilic glycopolymers associating dextran as backbone and poly(methyl methacrylate) (PMMA) as grafts is reported, using the “grafting from” strategy. In the first step, the dextran OH functions were partially acetylated. The second step consisted in linking initiator groups by reaction of 2‐bromoisobutyryl bromide (BⁱBB) with the unprotected OH functions. Third, the atom transfer radical polymerization (ATRP) of methyl methacrylate was carried out in DMSO from the resulting dextran derivative used as a macroinitiator. Finally, the cleavage of the acetate groups led to the expected glycopolymers. Careful attention was given both to the copolymer structure and the control of polymerization. PMMA grafts were analyzed by SEC‐MALLS after their deliberate cleavage from the backbone to evidence a controlled polymerization. Moreover, the mildness of the final deprotection conditions was proved to ensure acetate cleavage without either degrading dextran backbone and PMMA grafts or cleaving grafts from dextran backbone. © 2008 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 46: 7606–7620, 2008