Related papers: Constrained Ordered Equilibrium Problems
This paper is concerned with a class of stochastic optimization problems defined on a Banach space with almost sure conic-type constraints. For this class of problems, we investigate the consistency of optimal values and solutions…
We establish lower semi-continuity and strict convexity of the energy functionals for a large class of vector equilibrium problems in logarithmic potential theory. This in particular implies the existence and uniqueness of a minimizer for…
Greedy algorithms which use only function evaluations are applied to convex optimization in a general Banach space $X$. Along with algorithms that use exact evaluations, algorithms with approximate evaluations are treated. A priori upper…
In this paper we present efficient algorithmic solutions for several constrained resource allocation, management and discovery problems. We consider new types of resource allocation models and constraints, and we present new geometric…
We prove new characterisations of exponential stability for positive linear discrete-time systems in ordered Banach spaces, in terms of small-gain conditions. Such conditions have played an important role in the finite-dimensional systems…
For operators representing ill-posed problems, an ordering by ill-posedness is proposed, where one operator is considered more ill-posed than another one if the former can be expressed as a cocatenation of bounded operators involving the…
In this paper, using sunny generalized nonexpansive retraction, we propose new extragradient and linesearch algorithms for finding a common element of the set of solutions of an equilibrium problem and the set of fixed points of a…
The objective of this paper is to introduce and study a complicated nonlinear system, called coupled variational-hemivariational inequalities, which is described by a highly nonlinear coupled system of inequalities on Banach spaces. We…
We introduce and study a general concept of multiple fixed point for mappings defined on partially ordered distance spaces in the presence of a contraction type condition and appropriate monotonicity properties. This notion and the obtained…
In this work we recast parametrized time dependent optimal control problems governed by partial differential equations in a saddle point formulation and we propose reduced order methods as an effective strategy to solve them. Indeed, on one…
Constructing or learning a function from a finite number of sampled data points (measurements) is a fundamental problem in science and engineering. This is often formulated as a minimum norm interpolation problem, regularized learning…
This paper is devoted to studying of some properties of multivalued mappings in Euclidean space. There were proved theorems on a fixed point for multivalued mappings whose restrictions to some subset in the closure of a domain satisfy "a…
A branch of generalizations of the Banach Fixed Point Theorem replaces contractivity by a weaker but still effective property. The aim of the present note is to extend the contraction principle in this spirit for such complete semimetric…
We introduce an alternative approach for constrained mathematical programming problems. It rests on two main aspects: an efficient way to compute optimal solutions for unconstrained problems, and multipliers regarded as variables for a…
We study order-to-weak continuous operators from an ordered Banach space to a normed space. It is proved that under rather mild conditions every order-to-weak continuous operator is bounded.
We propose a regularized saddle-point algorithm for convex networked optimization problems with resource allocation constraints. Standard distributed gradient methods suffer from slow convergence and require excessive communication when…
We study generalized Nash equilibrium problems (GNEPs) such that objectives are polynomial functions, and each player's constraints are linear in their own strategy. For such GNEPs, the KKT sets can be represented as unions of simpler sets…
Deciding whether saddle points exist or are approximable for nonconvex-nonconcave problems is usually intractable. This paper takes a step towards understanding a broad class of nonconvex-nonconcave minimax problems that do remain…
We study generalized games defined over Banach spaces using variational analysis. To reformulate generalized games as quasi-variational inequality problems, we will first form a suitable principal operator and study some significant…
Motivated by a seminal paper of professor M. Z. Nashed published in 1987 on classification of ill-posed linear operator equations and distinguishing two types of ill-posedness in Banach and Hilbert spaces, we present, illustrate and justify…