相关论文: Construction of signed distance functions with an …

A new exact projective penalty method is proposed for the equivalent reduction of constrained optimization problems to nonsmooth unconstrained ones. In the method, the original objective function is extended to infeasible points by summing…

In this article we introduce a new type of cyclic contraction mapping on a pair of subsets of a metric space with a graph and prove best proximity points results for the same. Also, we demonstrate that the number of such points is same with…

A unified view is given to recent developments about a systematic method of constructing rational mappings as ergodic transformations with non-uniform invariant measures on the unit interval I=[0,1]. All of the rational ergodic mappings of…

In this paper, we investigate optimal control problems governed by semilinear elliptic variational inequalities involving constraints on the state, and more precisely the obstacle problem. Since we adopt a numerical point of view, we first…

We use novel integral representations developed by the second author to prove certain rigorous results concerning elliptic boundary value problems in convex polygons. Central to this approach is the so-called global relation, which is a…

We study the finite element approximation of linear second-order elliptic partial differential equations in nondivergence form with highly heterogeneous diffusion and drift coefficients. A generalized Cordes condition is imposed to…

The main purpose of this note is to provide an algorithm for approximating the value of the balanced $p$-adic $L$-function, as constructed in [Hsi21], at the point $(2,1,1)$, which is lying outside of the interpolation region. The…

We establish two new estimates which control a function (after subtracting its average) in $L^1$ by only the $L^1$ norm of its radial derivative. While the interior estimate holds for all superharmonic functions, the boundary version is…

We present a new feasible proximal gradient method for constrained optimization where both the objective and constraint functions are given by the summation of a smooth, possibly nonconvex function and a convex simple function. The…

Minimizing finite sums of functions is a central problem in optimization, arising in numerous practical applications. Such problems are commonly addressed using first-order optimization methods. However, these procedures cannot be used in…

We demonstrate that a graph-based search algorithm-relying on the construction of an approximate neighborhood graph-can directly work with challenging non-metric and/or non-symmetric distances without resorting to metric-space mapping…

We provide upper bounds of the expected Wasserstein distance between a probability measure and its empirical version, generalizing recent results for finite dimensional Euclidean spaces and bounded functional spaces. Such a generalization…

Optimization problems with convex quadratic cost and polyhedral constraints are ubiquitous in signal processing, automatic control and decision-making. We consider here an enlarged problem class that allows to encode logical conditions and…

Constructing optimal $(r,\delta)$-LRCs that attain the Singleton-type bound is an active and important research direction, particularly due to their practical applications in distributed storage systems. In this paper, we focus on the…

We prove the existence of infinitely many solutions to an elliptic problem by borrowing the techniques from algebraic topology. The solution(s) thus obtained will also be proved to be bounded.

Decentralized optimization is well studied for smooth unconstrained problems. However, constrained problems or problems with composite terms are an open direction for research. We study structured (or composite) optimization problems, where…

In this paper, using the Bregman distance, we introduce a new projection-type algorithm for finding a common element of the set of solutions of an equilibrium problem and the set of fixed points. Then the strong convergence of the sequence…

We consider a class of optimization problems that involve determining the maximum value that a function in a particular class can attain subject to a collection of difference constraints. We show that a particular linear programming…

This paper aims to develop the mathematical representation of a surface generated by elliptical arcs joining the sides of a regular polygon to a point lying vertically upward on the central axis of the polygon. The volume of the…

In this work, we present a novel approach for solving stochastic shape optimization problems. Our method is the extension of the classical stochastic gradient method to infinite-dimensional shape manifolds. We prove convergence of the…