Related papers: FMplex: A Novel Method for Solving Linear Real Ari…
Linear programming (LP) relaxations are widely employed in exact solution methods for multilinear programs (MLP). One example is the family of Recursive McCormick Linearization (RML) strategies, where bilinear products are substituted for…
In this article, we use the monotonic optimization approach to propose an outcome-space outer approximation by copolyblocks for solving strictly quasiconvex multiobjective programming problems and especially in the case that the objective…
This paper presents a hybridized formulation for the weak Galerkin mixed finite element method (WG-MFEM) which was introduced and analyzed for second order elliptic equations. The WG-MFEM method was designed by using discontinuous piecewise…
We propose an SQP algorithm for mathematical programs with vanishing constraints which solves at each iteration a quadratic program with linear vanishing constraints. The algorithm is based on the newly developed concept of $\mathcal…
The simulation of fracture using continuum ductile damage models attains a pathological discretization dependence caused by strain localization, after loss of ellipticity of the problem, in regions whose size is connected to the spatial…
Mathematical programs with complementarity constraints are notoriously difficult to solve due to their nonconvexity and lack of constraint qualifications in every feasible point. This work focuses on the subclass of quadratic programs with…
In 1994, Moulinec and Suquet introduced an efficient technique for the numerical resolution of the cell problem arising in homogenization of periodic media. The scheme is based on a fixed-point iterative solution to an integral equation of…
The diagramatic Monte Carlo method has so far been primarily used in connection with the weak coupling expansion. Here we show that the strong coupling expansion offers a significant advantage: it can be efficiently implemented on both the…
Fast and high-order accurate algorithms for three dimensional elastic scattering are of great importance when modeling physical phenomena in mechanics, seismic imaging, and many other fields of applied science. In this paper, we develop a…
In a wide range of applications, we are required to rapidly solve a sequence of convex multiparametric quadratic programs (mp-QPs) on resource-limited hardwares. This is a nontrivial task and has been an active topic for decades in control…
We propose a new first-order optimisation algorithm to solve high-dimensional non-smooth composite minimisation problems. Typical examples of such problems have an objective that decomposes into a non-smooth empirical risk part and a…
A method for the multifidelity Monte Carlo (MFMC) estimation of statistical quantities is proposed which is applicable to computational budgets of any size. Based on a sequence of optimization problems each with a globally minimizing…
We combine two iterative algorithms for solving large-scale systems of linear inequalities, the relaxation method of Agmon, Motzkin et al. and the randomized Kaczmarz method. In doing so, we obtain a family of algorithms that generalize and…
This paper considers the optimization problem in the form of $\min_{X \in \mathcal{F}_v} f(x) + \lambda \|X\|_1,$ where $f$ is smooth, $\mathcal{F}_v = \{X \in \mathbb{R}^{n \times q} : X^T X = I_q, v \in \mathrm{span}(X)\}$, and $v$ is a…
We develop a spatial branch-and-cut approach for nonconvex Quadratically Constrained Quadratic Programs with bounded complex variables (CQCQP). Linear valid inequalities are added at each node of the search tree to strengthen semidefinite…
It is well known that selecting a good Mixed Integer Programming (MIP) formulation is crucial for an effective solution with state-of-the art solvers. While best practices and guidelines for constructing good formulations abound, there is…
This paper presents a new approach on stretch processing for a fine range estimation using MPM (Matrix Pencil Method). The conventional method utilizes FFT (Fast Fourier Transform) with limited range resolution with its fixed number of…
We construct a consistent multiplier free method for the finite element solution of the obstacle problem. The method is based on an augmented Lagrangian formulation in which we eliminate the multiplier by use of its definition in a discrete…
We introduce a new Partition of Unity Method for the numerical homogenization of elliptic partial differential equations with arbitrarily rough coefficients. We do not restrict to a particular ansatz space or the existence of a finite…
The paper describes a numerical method for solving acoustic multibody scattering problems in two and three dimensions. The idea is to compute a highly accurate approximation to the scattering operator for each body through a local…