Abstract This paper presents computationally feasible rank-one relaxation algorithms for the efficient simulation of a time-incremental damage model with nonconvex incremental stress potentials in multiple spatial dimensions. While standard suffers from numerical issues due to lack convexity, our experiments showed that by convexification delivering an approximation quasiconvex envelope prevent...

This paper is concerned with the study of a version globally convergent convexification method direct application to synthetic aperture radar (SAR) imaging. Results numerical testing are presented for experimentally collected data fake landmine. The SAR imaging technique common tool used create maps parts surface Earth or other planets. Recently, it has been applied in context noninvasive inspe...

The new characterization, based on perspective functions, dominates the standard McCormick convexification approach. In practice, this result is useful in the presence of linear constraints linking variables x and y, but can also be of great value in global optimization frameworks, suggesting a branching strategy based on dominance, i.e., x ď y _ x ě y. The new relaxation yields tight lower bou...

Optimization techniques have been widely used in deformable registration, allowing for the incorporation of similarity metrics with regularization mechanisms. These regularization mechanisms are designed to mitigate the effects of trivial solutions to ill-posed registration problems and to otherwise ensure the resulting deformation fields are well-behaved. This paper introduces a novel deformab...

We consider a non-interacting unbounded spin system with conservation of the mean spin. We derive a uniform logarithmic Sobolev inequality (LSI) provided the single-site potential is a bounded perturbation of a strictly convex function. The scaling of the LSI constant is optimal in the system size. The argument adapts the two-scale approach of Grunewald, Otto, West-dickenberg, and Villani from ...

This paper proposes a multi-objective optimization model (P1) that determines the optimal selection of parallel units considering the trade-off between the availability of a serial producing system and total investment costs. Model (P1) is solved through the constrained MINLP model (P1’) that maximizes system availability subject to a series of upper bounds of the total cost, which yields a set...

Abstract Manufacturing systems flexibility is critical to meet the challenges arising from the uncertain demands. In this paper, a framework is proposed to evaluate the effect of utilizing flexibility in manufacturing systems which have the capability of producing multiple products at multiple plants. After transformation, a nonlinear polynomial programming model was proposed to describe the pr...

In this article, a novel convexification approach for small-signal stability constraint optimal power flow has been presented that does not rely on eigenvalue analysis. The proposed methodology is based the sufficient condition stability, developed as bilinear matrix inequality (BMI), and uses network structure-preserving differential algebraic equation modeling of system. formulation semidefin...

The following conjecture of Fejes T6th is proved: The density of a lattice of convex bodies in [w” is at least i, provided that each connected component of the complementary set is bounded. The cases of equality are also determined. For any polytope P in [w” one can define a convexification P* (see Section 1) and it is proved that Vol P S Vol P*. It is also shown that if P and P’ are two convex...