Related papers: A Bisection Method to Solve The Elvis Problem With…
This paper studies a class of simple bilevel optimization problems where we minimize a composite convex function at the upper-level subject to a composite convex lower-level problem. Existing methods either provide asymptotic guarantees for…
The graph bisection problem is the problem of partitioning the vertex set of a graph into two sets of given sizes such that the sum of weights of edges joining these two sets is optimized. We present a semidefinite programming relaxation…
This paper addresses non-convex constrained optimization problems that are characterized by a scalar complicating constraint. We propose an iterative bisection method for the dual problem (DualBi Algorithm) that recovers a feasible primal…
A suitable notion of weak solution to infinite-dimensional rate-independent systems, called Inertial Balanced Viscosity (IBV) solution, is introduced. The key feature of such notion is that the energy dissipated at jump discontinuities…
In this paper, we consider a moving rigid solid immersed in a potential fluid. The fluid-solid system fills the whole two dimensional space and the fluid is assumed to be at rest at infinity. Our aim is to study the inverse problem,…
This work introduces a multidimensional generalization of the maximum bisection problem. A mixed integer linear programming formulation is proposed with the proof of its correctness. The numerical tests, made on the randomly generated…
An analytical solution is derived for the bifurcations of an elastic disc that is constrained on the boundary with an isoperimetric Cosserat coating. The latter is treated as an elastic circular rod, either perfectly or partially bonded…
This paper presents a decomposition method for solving elliptic boundary value problems in one-dimension. The method is an improvement to an existing technique for approximating elliptic systems. It is demonstrated to be computationally…
The H\'enon equation, a generalized form of the Emden equation, admits symmetry-breaking bifurcation for a certain ratio of the transverse velocity to the radial velocity. Therefore, it has asymmetric solutions on a symmetric domain even…
In [Lacave, IHP, ana, to appear (2008)] the author considered the two dimensional Euler equations in the exterior of a thin obstacle shrinking to a curve and determined the limit velocity. In the present work, we consider the same problem…
A Coefficient Inverse Problem for the radiative transport equation is considered. The globally convergent numerical method, the so-called convexification, is developed. For the first time, the viscosity solution is considered for a boundary…
In this paper, we study the gradient descent-ascent method for convex-concave saddle-point problems. We derive a new non-asymptotic global convergence rate in terms of distance to the solution set by using the semidefinite programming…
In the present paper we introduce a Virtual Element Method (VEM) for the approximate solution of general linear second order elliptic problems in mixed form, allowing for variable coefficients. We derive a theoretical convergence analysis…
In this paper, we study a class of bilevel programming problem where the inner objective function is strongly convex. More specifically, under some mile assumptions on the partial derivatives of both inner and outer objective functions, we…
The aim of this paper is to study and classify the multiplicity of distinguished limits and asymptotic solutions for the advection equation with a general oscillating velocity field with the systematic use of the two-timing method. Our…
We consider the problem of designing a smooth trajectory that traverses a sequence of convex sets in minimum time, while satisfying given velocity and acceleration constraints. This problem is naturally formulated as a nonconvex program. To…
We develop a novel method for finding bifurcations for nonlinear systems of equations based on directly finding bifurcations through saddle points of extended quotients. The method is applied to find the saddle-node bifurcation point for…
A bivariate spline method is developed to numerically solve second order elliptic partial differential equations (PDE) in non-divergence form. The existence, uniqueness, stability as well as approximation properties of the discretized…
The virtual element method (VEM) allows discretization of elasticity and plasticity problems with polygons in 2D and polyhedrals in 3D. The polygons (and polyhedrals) can have an arbitrary number of sides and can be concave or convex. These…
The maximum graph bisection problem is a well known graph partition problem. The problem has been proven to be NP-hard. In the maximum graph bisection problem it is required that the set of vertices is divided into two partition with equal…