Results 41 to 50 of about 231 (178)
International Journal of Mathematics and Mathematical Sciences, Volume 25, Issue 9, Page 621-628, 2001., 2001 A new method for obtaining sensitivity information for parametric vector optimization problems (VOP) v is presented, where the parameters in the objective functions and anywhere in the constraints. This method depends on using differential equations technique for solving multiobjective nonlinear programing problems which is very effective in finding ...
Fatma M. Ali
wiley +1 more source
Demonstratio MathematicaIn this paper, a modified Rivaie-Mohd-Ismail-Leong (RMIL) conjugate gradient-based projection algorithm for constrained nonlinear equations is proposed, which integrates projection techniques and line search approaches to enhance solution accuracy and ...
Wang Kai, Li Dandan, Wang Songhua
doaj +1 more source
A new branch and bound algorithm for minimax ratios problems
Open Mathematics, 2017 This study presents an efficient branch and bound algorithm for globally solving the minimax fractional programming problem (MFP). By introducing an auxiliary variable, an equivalent problem is firstly constructed and the convex relaxation programming ...
Zhao Yingfeng, Liu Sanyang, Jiao Hongwei
doaj +1 more source
Veterinary Dermatology, Volume 37, Issue 2, Page 293-305, April 2026.Background: Canine atopic dermatitis (cAD) is a common, chronic skin condition characterised by epidermal barrier dysfunction, immune dysregulation and cutaneous dysbiosis. While “emollient plus” formulations are widely used in human atopic dermatitis, their role in cAD remains underexplored. Hypothesis/Objectives: To evaluate the clinical efficacy and
Beatriz Fernandes +8 more
wiley +1 more source
A remark on Gwinner′s existence theorem on variational inequality problem
International Journal of Mathematics and Mathematical Sciences, Volume 24, Issue 8, Page 573-575, 2000., 2000 Gwinner (1981) proved an existence theorem for a variational inequality problem involving an upper semicontinuous multifunction with compact convex values. The aim of this paper is to solve this problem for a multifunction with open inverse values.
V. Vetrivel, S. Nanda
wiley +1 more source
Unsupervised and supervised data classification via nonsmooth and global optimization
, 2003 Clustering, classification, cluster function, nonsmooth optimization, global optimization, 65K05, 90C26, 90C30, 90C90,
A. Bagirov +7 more
core +1 more source
Demonstratio MathematicaThe conjugate gradient (CG) method is recognized for resolving unconstrained optimization problems because of its efficiency, robustness, and minimal memory demands.
Masmali Sultanah +4 more
doaj +1 more source
International Journal of Mathematics and Mathematical Sciences, Volume 2026, Issue 1, 2026.This paper presents an inertial‐based hybrid conjugate gradient projection algorithm for solving nonlinear equations with convex constraints. The proposed algorithm integrates Polak–Ribière–Polyak and Hestenes–Stiefel methods within a conjugate gradient framework, incorporating an inertial‐relaxed technique to accelerate iterative convergence.
Yan Xia, Dandan Li, Nian-Sheng Tang
wiley +1 more source
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
Open MathematicsIn this article, we work on vector optimization problems in linear topological spaces. Our vector optimization problems have weakened convex inequality constraints and weakened affine equality constraints.
Zeng Renying
doaj +1 more source