In this work, we introduce multi-interdictor games, which model interactions among multiple interdictors with differing objectives operating on a common network. As a starting point, we focus on shortest path multi-interdictor (SPMI) games, where multiple interdictors try to increase the shortest path lengths of their own adversaries attempting to traverse a common network. We first … Read more
An algorithm is proposed to optimize the performance of multiphase structures (composites) under elastodynamic loading conditions. The goal is to determine the distribution of material in the structure such that the time-averaged total stored energy of structure is minimized. A penalization strategy is suggested to avoid the checkerboard instability, simultaneously to generate near 0-1 topologies. … Read more
In this paper, we consider the problem of efficiently computing the eigenvalues of limited-memory quasi-Newton matrices that exhibit a compact formulation. In addition, we produce a compact formula for quasi-Newton matrices generated by any member of the Broyden convex class of updates. Our proposed method makes use of efficient updates to the QR factorization that … Read more
This paper studies $K$-sublinear inequalities, a class of inequalities with strong relations to K-minimal inequalities for disjunctive conic sets. We establish a stronger result on the sufficiency of $K$-sublinear inequalities. That is, we show that when $K$ is the nonnegative orthant or the second-order cone, $K$-sublinear inequalities together with the original conic constraint are always … Read more
For reducing costs of market frictions, investors need to build a small-scale portfolio by solving a cardinality constrained portfolio selection problem which is NP-hard in general and not easy to be solved eciently for a large-scale problem. In this paper, we propose a penalty proximal alternat- ing linearized minimization method for the large-scale problems in … Read more
Our contribution is twofold. Firstly, for a system of uncertain linear equations where the uncertainties are column-wise and reside in general convex sets, we show that the intersection of the set of possible solutions and any orthant is convex. We derive a convex representation of this intersection. Secondly, to obtain centered solutions for systems of … Read more
What happens to the conclusion of the Ekeland variational principle (briefly, EVP) if a considered function $f:X\to \R\cup\{+\infty\}$ is lower semicontinuous not on a whole metric space $X$ but only on its domain? We provide a straightforward proof showing that it still holds but only for $\epsilon $ varying in some interval $]0,\beta-\inf_Xf[$, where $\beta$ … Read more
In this note, we prove that the KKT mapping for nonlinear semidefinite optimization problem is upper Lipschitz continuous at the KKT point, under the second-order sufficient optimality conditions and the strict Robinson constraint qualification. Article Download View On the upper Lipschitz property of the KKT mapping for nonlinear semidefinite optimization
We deal with chance constrained problems (CCP) with differentiable nonlinear random functions and discrete distribution. We allow nonconvex functions both in the constraints and in the objective. We reformulate the problem as a mixed-integer nonlinear program, and relax the integer variables into continuous ones. We approach the relaxed problem as a mathematical problem with complementarity … Read more
An unconditionally energy stable time stepping scheme is introduced to solve Cahn-Morral-like equations in the present study. It is constructed based on the combination of David Eyre’s time stepping scheme and Schur complement approach. Although the presented method is general and independent to the choice of homogeneous free energy density function term, logarithmic and polynomial … Read more