Results 21 to 30 of about 1,554 (121)
General algorithm and sensitivity analysis for variational inequalities
International Journal of Stochastic Analysis, Volume 5, Issue 1, Page 29-41, 1992., 1991 The fixed point technique is used to prove the existence of a solution for a class of variational inequalities related to odd order boundary value problems, and to suggest a general algorithm. We also study the sensitivity analysis for these variational inequalities and complementarity problems using the projection technique.
Muhammad Aslam Noor
wiley +1 more source
Acceleration of the Halpern algorithm to search for a fixed point of a nonexpansive mapping
, 2014 This paper presents an algorithm to accelerate the Halpern fixed point algorithm in a real Hilbert space. To this goal, we first apply the Halpern algorithm to the smooth convex minimization problem, which is an example of a fixed point problem for a ...
Kaito Sakurai, H. Iiduka
semanticscholar +1 more source
Convergence and Perturbation Resilience of Dynamic String-Averaging Projection Methods [PDF]
, 2012 We consider the convex feasibility problem (CFP) in Hilbert space and concentrate on the study of string-averaging projection (SAP) methods for the CFP, analyzing their convergence and their perturbation resilience.
A. Cegielski +29 more
core +2 more sources
, 2014 In this paper, it is our purpose to introduce an iterative process for the approximation of a common fixed point of a finite family of multi-valued Bregman relatively nonexpansive mappings.
N. Shahzad, H. Zegeye
semanticscholar +1 more source
Strong convergence of a relaxed CQ algorithm for the split feasibility problem
, 2013 The split feasibility problem (SFP) is finding a point in a given closed convex subset of a Hilbert space such that its image under a bounded linear operator belongs to a given closed convex subset of another Hilbert space.
Songnian He, Ziyi Zhao
semanticscholar +1 more source
Obstructions to determinantal representability [PDF]
, 2010 There has recently been ample interest in the question of which sets can be represented by linear matrix inequalities (LMIs). A necessary condition is that the set is rigidly convex, and it has been conjectured that rigid convexity is also sufficient. To
Borcea +15 more
core +2 more sources
Intelligent Systems with Applications, 2022 We propose new mathematical models of inventory management in a reverse logistics system. The proposed models extend the model introduced by Nahmias and Rivera with the assumption that the demand for newly produced and repaired (remanufacturing) items ...
M. Forkan, M.M. Rizvi, M.A.M. Chowdhury
doaj
Correction Bounds on measures satisfying moment conditions
, 2004 The Annals of Applied Probability (2002) 12 1114 ...
Lasserre, Jean B.
core +1 more source
, 2014 The main purpose of this paper is to introduce an iterative algorithm for equilibrium problems and split feasibility problems in Hilbert spaces. Under suitable conditions we prove that the sequence converges strongly to a common element of the set of ...
Jinfang Tang, Shih-sen Chang, Fei Yuan
semanticscholar +1 more source
First-Order Methods for Convex Optimization
EURO Journal on Computational Optimization, 2021 First-order methods for solving convex optimization problems have been at the forefront of mathematical optimization in the last 20 years. The rapid development of this important class of algorithms is motivated by the success stories reported in various
Pavel Dvurechensky +2 more
doaj