An interval branch and bound method for global Robust optimization

In this paper, we design a Branch and Bound algorithm based on interval arithmetic to address nonconvex robust optimization problems. This algorithm provides the exact global solution of such difficult problems arising in many real life applications. A code was developed in MatLab and was used to solve some robust nonconvex problems with few variables. This first numerical study shows the interest of this approach providing the global solution of such difficult robust nonconvex optimization problems.

     

Superquantiles at Work: Machine Learning Applications and Efficient Subgradient Computation

Set-Valued and Variational Analysis - R. Tyrell Rockafellar and his collaborators introduced, in a series of works, new regression modeling methods based on the notion of superquantile (or...     

Baer sums for a natural class of monoid extensions

Semigroup Forum - It is well known that the set of isomorphism classes of extensions of groups with abelian kernel is characterized by the second cohomology group. In this paper we generalise this...     

Correction to: Impact of leg bending in the patient-specific computational fluid dynamics of popliteal stenting

Acta Mechanica Sinica - A Correction to this paper has been published: https://doi.org/10.1007/s10409-021-01066-2     

A study for the selection of NPE-free cocktails for LSC routine measurements

Journal of Radioanalytical and Nuclear Chemistry - In this paper a study for the selection of an NPE (nonylphenol ethoxylates)—free cocktail is discussed in order to be used for our routine...     

Tandem silylation—desilylation reaction in the synthesis of N-methyl carboxamides

Russian Chemical Bulletin - The N-methylation of primary carboxamides is based on two consecutive reactions. The silylation of the corresponding carboxamides with chloro(chloromethyl)dimethylsilane...     

Operator Interpolation and Systems of Linear Equations and Inequalities in Euclidean Spaces

Ukrainian Mathematical Journal - We establish new criteria of compatibility for a linear system of equations (equivalent to the Kronecker–Capelli theorem) or inequalities (equivalent to the...     

Restricted testing conditions for the multilinear maximal operator

Restricted testing conditions were considered recently. For the maximal operator, Hytönen, Li and Sawyer [8] first obtained parental testing condition. Later, they [9] showed that it suffices to restrict testing to doubling cubes. Chen and Lacey [3] gave a similar restricted testing condition. In our paper, we discuss a version of the latter in the multilinear setting.