Related papers: Cusp bifurcations: numerical detection via two-par…
In this paper, we propose an inexact perturbed path-following algorithm in the framework of Lagrangian dual decomposition for solving large-scale structured convex optimization problems. Unlike the exact versions considered in literature,…
In this paper we consider finding an approximate second-order stationary point (SOSP) of nonconvex conic optimization that minimizes a twice differentiable function over the intersection of an affine subspace and a convex cone. In…
Linear systems with a tensor product structure arise naturally when considering the discretization of Laplace type differential equations or, more generally, multidimensional operators with separable coefficients. In this work, we focus on…
The conjugate locus of a point $p$ in a surface $\mathcal{S}$ will have a certain number of cusps. As the point $p$ is moved in the surface the conjugate locus may spontaneously gain or lose cusps. In this paper we explain this…
In many commercial and academic settings, numerical solvers fail to achieve their theoretical performance levels due to issues in the system definition, parameterization, and even implementation. We propose a pair of methods for detecting…
We use computer-assisted proof techniques to prove that a branch of non-trivial equilibrium solutions in the Kuramoto-Sivashinsky partial differential equation undergoes a Hopf bifurcation. Furthermore, we obtain an essentially constructive…
Building on the development of [MOR13], bifurcation of unstable modes that emerge from continuous spectra in a class of infinite-dimensional noncanonical Hamiltonian systems is investigated. Of main interest is a bifurcation termed the…
Divide-and-conquer Bayesian methods consist of three steps: dividing the data into smaller computationally manageable subsets, running a sampling algorithm in parallel on all the subsets, and combining parameter draws from all the subsets.…
We study bifurcation for the constant scalar curvature equation along a one-parameter family of Riemannian metrics on the total space of a harmonic Riemannian submersion. We provide an existence theorem for bifurcation points and a…
A uniform approach to computing with infinite objects like real numbers, tuples of these, compacts sets, and uniformly continuous maps is presented. In work of Berger it was shown how to extract certified algorithms working with the signed…
The uniform quadratic optimizatin problem (UQ) is a nonconvex quadratic constrained quadratic programming (QCQP) sharing the same Hessian matrix. Based on the second-order cone programming (SOCP) relaxation, we establish a new sufficient…
A numerical method is developed leading to algebraic systems based on generalized Lyapunov-Sylvester operators to approximate the solution of two-dimensional Boussinesq equation. It consists of an order reduction method and a finite…
The goal of this paper is to continue the study of the relation between the Poincar\'e inequality and the lower bounds of Minkowski content of separating sets, initiated in our previous work [Caputo, Cavallucci: Poincar\'e inequality and…
In many extensions of the SM, neutral massive stable particles (dark matter candidates) are produced at colliders in pairs due to an exact symmetry called a "parity". These particles escape detection, rendering their mass measurement…
Arclength continuation and branch switching are enormously successful algorithms for the computation of bifurcation diagrams. Nevertheless, their combination suffers from three significant disadvantages. The first is that they attempt to…
This paper aims to answer an open question recently posed in the literature, that is to find a fast exact method for solving the p-dispersion-sum problem (PDSP), a nonconcave quadratic binary maximization problem. We show that, since the…
This paper proposes low-complexity algorithms for finding approximate second-order stationary points (SOSPs) of problems with smooth non-convex objective and linear constraints. While finding (approximate) SOSPs is computationally…
We develop two-scale methods for computing the convex envelope of a continuous function over a convex domain in any dimension.This hinges on a fully nonlinear obstacle formulation [A. M. Oberman, "The convex envelope is the solution of a…
In this paper, motivated by the setting of white-space detection [1], we present theoretical and empirical results for detection of the zero-support E of x \in Cp (xi = 0 for i \in E) with reduced-dimension linear measurements. We propose…
We investigate the use of piecewise linear systems, whose coefficient matrix is a piecewise constant function of the solution itself. Such systems arise, for example, from the numerical solution of linear complementarity problems and in the…