Related papers: Variational Inequalities Governed By Strongly Pseu…
In this article, we study bipartite quantum steering using a general class of measurement operators known as the generalized equiangular measurement (GEAM). Our approach allows for the construction of steering inequalities that are…
We consider the approximation of singularly perturbed linear second-order boundary value problems by $hp$-finite element methods. In particular, we include the case where the associated differential operator may not be coercive. Within this…
A theoretical, and potentially also practical, problem with stochastic gradient descent is that trajectories may escape to infinity. In this note, we investigate uniform boundedness properties of iterates and function values along the…
Variable order structures model situations in which the comparison between two points depends on a point-to-cone map. In this paper, an inexact projected gradient method for solving smooth constrained vector optimization problems on…
Motivated by Ridgway's proof of the perceptron algorithm, we study a simple subgradient method for convex inequality systems in Hilbert space. Assuming strict feasibility and bounded subgradients, we establish finite termination for several…
In this paper we introduce conformally covariant boundary operators for Poincar\'e-Einstein manifolds satisfying a mild spectral assumption. Using these boundary operators we set up higher order Dirichlet problems whose solutions are such…
In this paper, we propose a scaled gradient modified non-monotone line search method for solving constrained minimization problems, and explore several specific properties of this method, namely, its convergence analysis. We discuss the…
In this paper, we analyze the iteration-complexity of Generalized Forward--Backward (GFB) splitting algorithm, as proposed in \cite{gfb2011}, for minimizing a large class of composite objectives $f + \sum_{i=1}^n h_i$ on a Hilbert space,…
Quasi-convex optimization acts a pivotal part in many fields including economics and finance; the subgradient method is an effective iterative algorithm for solving large-scale quasi-convex optimization problems. In this paper, we…
Convergence of a projected stochastic gradient algorithm is demonstrated for convex objective functionals with convex constraint sets in Hilbert spaces. In the convex case, the sequence of iterates ${u_n}$ converges weakly to a point in the…
Additive processes are obtained from L\'{e}vy ones by relaxing the condition of stationary increments, hence they are spatially (but not temporally) homogeneous. By analogy with the case of time-homogeneous Markov processes, one can define…
Resolvents of set-valued operators play a central role in various branches of mathematics and in particular in the design and the analysis of splitting algorithms for solving monotone inclusions. We propose a generalization of this notion,…
Motivated by the recent developments of pseudo-Hermitian quantum mechanics, we analyze the structure generated by unbounded metric operators in a Hilbert space. To that effect, we consider the notions of similarity and quasi-similarity…
We propose a method for solving constrained fixed point problems involving compositions of Lipschitz pseudo contractive and firmly nonexpansive operators in Hilbert spaces. Each iteration of the method uses separate evaluations of these…
Recently, many machine learning optimizers have been analysed considering them as the asymptotic limit of some differential equations when the step size goes to zero. In other words, the optimizers can be seen as a finite difference scheme…
We consider a generalized equation governed by a strongly monotone and Lipschitz single-valued mapping and a maximally monotone set-valued mapping in a Hilbert space. We are interested in the sensitivity of solutions w.r.t. perturbations of…
The principle underlying this paper is the basic observation that the problem of simultaneously solving a large class of composite monotone inclusions and their duals can be reduced to that of finding a zero of the sum of a maximally…
Gradient-based iterative optimization methods are the workhorse of modern machine learning. They crucially rely on careful tuning of parameters like learning rate and momentum. However, one typically sets them using heuristic approaches…
This paper focuses on solving a stochastic variational inequality (SVI) problem under relaxed smoothness assumption for a class of structured non-monotone operators. The SVI problem has attracted significant interest in the machine learning…
We study an abstract family of asymptotically degenerating variational problems. Those are natural generalisations of families of problems emerging upon application of a rescaled Floquet-Bloch-Gelfand transform to resolvent problems for…