Related papers: The ellipsoid method redux

This work is about ME, the Method of Ellipcenters. ME was recently introduced by these very authors as a first order accelerated scheme for unconstrained minimization. Its iterates are all centers of ellipses carefully designed to somehow…

We consider the problem of computing certain parameterized minimum volume outer ellipsoidal (MVOE) approximation of the Minkowski sum of a finite number of ellipsoids. We clarify connections among several parameterizations available in the…

We consider regression problems with binary weights. Such optimization problems are ubiquitous in quantized learning models and digital communication systems. A natural approach is to optimize the corresponding Lagrangian using variants of…

We propose in this paper a proximal and contraction method for solving a convex mixed variational inequality problem in a real Hilbert space. To accelerate the convergence of our proposed method, we incorporate an inertial extrapolation…

In this work, we propose a high-order multiscale method for an elliptic model problem with rough and possibly highly oscillatory coefficients. Convergence rates of higher order are obtained using the regularity of the right-hand side only.…

In this work we combine the framework of the Reduced Basis method (RB) with the framework of the Localized Orthogonal Decomposition (LOD) in order to solve parametrized elliptic multiscale problems. The idea of the LOD is to split a high…

We introduce the use of $p$-descent techniques for elliptic surfaces over a perfect field of characteristic not $2$ or $3$. Under mild hypotheses, we obtain an upper bound for the rank of a non-constant elliptic surface. When $p=2$, this…

In this paper we propose an idea of constructing a macro--scale matrix system given a micro--scale matrix linear system. Then the macro--scale system is solved at cheaper computing costs. The method uses the idea of the generalized…

We consider optimization problems on manifolds with equality and inequality constraints. A large body of work treats constrained optimization in Euclidean spaces. In this work, we consider extensions of existing algorithms from the…

We present a new method for minimizing the sum of a differentiable convex function and an $\ell_1$-norm regularizer. The main features of the new method include: $(i)$ an evolving set of indices corresponding to variables that are predicted…

In this article we prove solvability results for $L^2$ boundary value problems of some elliptic systems $Lu=0$ on the upper half-space $\R^{n+1}_{+}, n\ge 1$, with transversally independent coefficients. We use the first order formalism…

Using a method of factorization and by introducing a generalized discrete Dirichlet's Laplacian matrix $(-\Delta_{\Lambda})$, we establish an extended improved discrete Hardy's inequality and Rellich inequality in one dimension. We prove…

Parametric model order reduction using reduced basis methods can be an effective tool for obtaining quickly solvable reduced order models of parametrized partial differential equation problems. With speedups that can reach several orders of…

The arithmetic of elliptic curves, namely polynomial addition and scalar multiplication, can be described in terms of global sections of line bundles on $E\times E$ and $E$, respectively, with respect to a given projective embedding of $E$…

We develop a new least squares method for solving the second-order elliptic equations in non-divergence form. Two least-squares-type functionals are proposed for solving the equations in two steps. We first obtain a numerical approximation…

This paper is devoted to the variational inequality problems. We consider two classes of problems, the first is classical constrained variational inequality and the second is the same problem with functional (inequality type) constraints.…

A version of the nonlinear Hodge equations is introduced in which the irrotationality condition is weakened. An elliptic estimate for solutions is derived.

We develop a class of mixed virtual volume methods for elliptic problems on polygonal/polyhedral grids. Unlike the mixed virtual element methods introduced in \cite{brezzi2014basic,da2016mixed}, our methods are reduced to symmetric,…

We study a nonlinear system made up of an elliptic equation of blended singular/degenerate type and Poisson's equation with a lowly integrable source. We prove the existence of a weak solution in any space dimension and, chiefly, derive an…

Topology optimization problems often support multiple local minima due to a lack of convexity. Typically, gradient-based techniques combined with continuation in model parameters are used to promote convergence to more optimal solutions;…