Related papers: Probabilistic formulation of the Hadwiger--Nelson …

Previous algorithms can solve convex-concave minimax problems $\min_{x \in \mathcal{X}} \max_{y \in \mathcal{Y}} f(x,y)$ with $\mathcal{O}(\epsilon^{-2/3})$ second-order oracle calls using Newton-type methods. This result has been…

We consider a multi-agent optimization problem where agents subject to local, intermittent interactions aim to minimize a sum of local objective functions subject to a global inequality constraint and a global state constraint set. In…

We extend the classical regularity theorem of elliptic operators to maximally hypoelliptic differential operators. More precisely, given vector fields $X_1,\ldots,X_m$ on a smooth manifold which satisfy H\"ormander's bracket generating…

Given a $d$-dimensional continuous (resp. discrete) probability distribution $\mu$ and a discrete distribution $\nu$, the semi-discrete (resp. discrete) Optimal Transport (OT) problem asks for computing a minimum-cost plan to transport mass…

In this Doctoral Dissertation we propose new variational principles for traffic assignment problems. So to find equillibrium we have to solve large-scale convex optimization problem of special (multilevel) type. We propose different…

In this paper, we considered the problem of finding the upper bound Hausdorff matrix operator from sequence spaces $l_p(v)$ (or $d(v,p)$) into $l_p(w)$ (or $d(w,p)$). Also we considered the upper bound problem for matrix operators from…

In this paper, we define the upper (resp. lower) covariance under multiple probabilities via a corresponding max-min-max (resp. min-max-min) optimization problem and the related properties of covariances are obtained. In particular, we…

Lam\'e's differential equation is a linear differential equation of the second order with a periodic coefficient involving the Jacobian elliptic function ${\rm sn}$ depending on the modulus $k$, and two additional parameters $h$ and $\nu$.…

Let $(p_n)_n$ be either the $q$-Meixner or the $q$-Laguerre polynomials. We form a new sequence of polynomials $(q_n)_n$ by considering a linear combination of two consecutive $p_n$: $q_n=p_n+\beta_np_{n-1}$, $\beta_n\in \RR$. Using the…

The skew-normal and the skew-$t$ distributions are parametric families which are currently under intense investigation since they provide a more flexible formulation compared to the classical normal and $t$ distributions by introducing a…

In this paper we initiate the study of $2$nd order variational problems in $L^\infty$, seeking to minimise the $L^\infty$ norm of a function of the hessian. We also derive and study the respective PDE arising as the analogue of the…

Dwork's $p$-adic hypergeometric function is defined to be a ratio ${}_sF_{s-1}(t)/{}_sF_{s-1}(t^p)$ of hypergeometric power series. Dwork showed that it is a uniform limit of rational functions, and hence one can define special values on…

A new algorithm for deciding the satisfiability of polynomial formulas over the reals is proposed. The key point of the algorithm is a new projection operator, called sample-cell projection operator, custom-made for Conflict-Driven Clause…

Proportional apportionment is the problem of assigning seats to parties according to their relative share of votes. Divisor methods are the de-facto standard solution, used in many countries. In recent literature, there are two algorithms…

This article presents a general solution to the problem of computational complexity. First, it gives a historical introduction to the problem since the revival of the foundational problems of mathematics at the end of the 19th century.…

We show how to reduce a general, strictly-feasible LP problem, into a min-max problem, which can be solved by the algorithm from the third section of my thesis.

Nonlinear Schr\"{o}dinger equation was originally derived in nonlinear optics as a model for beam propagation, which naturally requires its application in cylindrical coordinates. However, the derivation was done in the Cartesian…

In this work, we focuses on the following saddle point problem $\min_x \max_y p(x) + R(x,y) - q(y)$ where $R(x,y)$ is $L_R$-smooth, $\mu_x$-strongly convex, $\mu_y$-strongly concave and $p(x), q(y)$ are convex and $L_p, L_q$-smooth…

This thesis starts from a review on current research on the local hypoellipticity of the $\bar\partial$-Neumann problem. It presents the classical method of regularity from estimates of the energy: subelliptic as well as superlogarithmic.…

In this paper, we present an improvement for the problem of deterministically finding an element of large multiplicative order modulo some integer $N$. This problem arises as a key subroutine in current deterministic factoring algorithms,…