Related papers: On Projected Solutions for Quasi Equilibrium Probl…
We study the navigation problem for a robot moving amidst static and dynamic obstacles and rely on a hierarchical approach to solve it. First, the reference trajectory is planned by the safe interval path planning algorithm that is capable…
This paper tackles the problem of nonlinear systems, with sublinear growth but unbounded control, under perturbation of some time-varying state constraints. It is shown that, given a trajectory to be approximated, one can find a neighboring…
We model a problem motivated by road design as a feasibility problem. Projections onto the constraint sets are obtained, and projection methods for solving the feasibility problem are studied. We present results of numerical experiments…
We derive novel algorithms for optimization problems constrained by partial differential equations describing multiscale particle dynamics, including non-local integral terms representing interactions between particles. In particular, we…
Iterative algorithms aimed at solving some problems are discussed. For certain problems, such as finding a common point in the intersection of a finite number of convex sets, there often exist iterative algorithms that impose very little…
We outline a new approach for solving optimization problems which enforce triangle inequalities on output variables. We refer to this as metric-constrained optimization, and give several examples where problems of this form arise in machine…
A way of constructing a nonlinear filter close to the optimal Kolmogorov - Wiener filter is proposed within the framework of the statistical approach to inverse problems. Quasi-optimal filtering, which has no Bayesian assumptions, produces…
In this article, we derive an iterative scheme through a quasi-Newton technique to capture robust weakly efficient points of uncertain multiobjective optimization problems under the upper set less relation. It is assumed that the set of…
Stochastic nonconvex optimization problems with nonlinear constraints have a broad range of applications in intelligent transportation, cyber-security, and smart grids. In this paper, first, we propose an inexact-proximal accelerated…
A risk-aware decision-making problem can be formulated as a chance-constrained linear program in probability measure space. Chance-constrained linear program in probability measure space is intractable, and no numerical method exists to…
In this article, we propose a quasi-Newton method for unconstrained set optimization problems to find its weakly minimal solutions with respect to lower set-less ordering. The set-valued objective mapping under consideration is given by a…
This paper has two central aims: first, to provide simple conditions under which the generalized games in choice form and, consequently, the abstract economies, admit equilibrium; second, to study the solvability of several types of systems…
We survey the recent developments in the theory of quasireg- ular mappings in metric spaces. In particular, we study the geometric porosity of the branch set of quasiregular mappings in general metric measure spaces, and then, introduce the…
In quasi-exactly solvable problems partial analytic solution (energy spectrum and associated wavefunctions) are obtained if some potential parameters are assigned specific values. We introduce a new class in which exact solutions are…
In this paper we study the problem of maximizing the distance to a given point over an intersection of balls. It was already known that this problem can be solved in polynomial time and space if the given point is not in the convex hull of…
This article analyses the simple projection method proposed by Izuchukwu et al. [8, Algorithm 3.2] for solving variational inequality problems by incorporating momentum terms. A new step size strategy is also introduced, in which the step…
This paper discusses a special kind of convex constrained optimization problem, whose constraints consist of box inequalities and linear equalities. For this problem, in addition to general optimization algorithms such as exact penalty…
We consider scalar equilibrium problems governed by a bifunction in a finite-dimensional framework. By using classical arguments in Convex Analysis, we show that under suitable generalized convexity assumptions imposed on the bifunction,…
In this paper, we introduce new implicit and explicit iterative schemes which converge strongly to a unique solution of variational inequality problems for strongly accretive operators over a common fixed point set of finite family of…
This paper is devoted to the problem of finding a common fixed point of quasinonexpansive mappings defined on a Hilbert space. To approximate the solution to this problem, we present several iterative processes using the parallel method…