Results 41 to 50 of about 1,594 (145)
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
Numerical construction of structured matrices with given eigenvalues
Special Matrices, 2019 We consider a structured inverse eigenvalue problem in which the eigenvalues of a real symmetric matrix are specified and selected entries may be constrained to take specific numerical values or to be nonzero.
Sutton Brian D.
doaj +1 more source
On nonlinear variational inequalities
International Journal of Mathematics and Mathematical Sciences, Volume 14, Issue 2, Page 399-402, 1991., 1990 The fixed point technique is used to prove the existence of a solution for a class of nonlinear variational inequalities related with odd order constrained boundary value problems and to suggest an iterative algorithm to compute the approximate solution.
Muhammed Aslam Noor
wiley +1 more source
Coupled best proximity points in ordered metric spaces
, 2014 In this paper, we prove the existence and uniqueness of a coupled best proximity point for mappings satisfying the proximally coupled contraction condition in a complete ordered metric space.
Poom Kumam +3 more
semanticscholar +1 more source
Multifacility location problems on a sphere
International Journal of Mathematics and Mathematical Sciences, Volume 10, Issue 3, Page 583-595, 1987., 1987 A unified approach to multisource location problems on a sphere is presented. Euclidean, squared Euclidean and the great circle distances are considered. An algorithm is formulated and its convergence properties are investigated.
Turgut Aykin, A. J. G. Babu
wiley +1 more source
Optimality conditions for pessimistic semivectorial bilevel programming problems
, 2014 In this paper, a class of pessimistic semivectorial bilevel programming problems is investigated. By using the scalarization method, we transform the pessimistic semivectorial bilevel programming problem into a scalar objective optimization problem with ...
Bingbing Liu +3 more
semanticscholar +1 more source
On interval-valued optimization problems with generalized invex functions
, 2013 This paper is devoted to study interval-valued optimization problems. Sufficient optimality conditions are established for LU optimal solution concept under generalized (p,r)−ρ−(η,θ)-invexity.
I. Ahmad +2 more
semanticscholar +1 more source
The use of Grossone in Mathematical Programming and Operations Research
, 2012 The concepts of infinity and infinitesimal in mathematics date back to anciens Greek and have always attracted great attention. Very recently, a new methodology has been proposed by Sergeyev for performing calculations with infinite and infinitesimal ...
De Cosmis, Sonia, De Leone, Renato
core +1 more source
Veterinary Dermatology, Volume 36, Issue 1, Page 74-82, February 2025.Background — Anal sac impaction is common in dogs and manual expression may be effective, yet recurrence remains a problem. To facilitate physiological emptying of the sacs, it is important to maintain a bulky stool consistency. Objectives — The study evaluated if supplementation with ProGlan, a complementary feed containing Bacillus velezensis C‐3102 ...
Marta Salichs +2 more
wiley +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