Results 41 to 50 of about 253 (176)
On generalized derivatives for C1,1 vector optimization problems
We introduce generalized definitions of Peano and Riemann directional derivatives in order to obtain second‐order optimality conditions for vector optimization problems involving C1,1 data. We show that these conditions are stronger than those in literature obtained by means of second‐order Clarke subdifferential.
Davide La Torre
wiley +1 more source
In 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
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
A nonlinear preconditioner for optimum experimental design problems
We show how to efficiently compute A-optimal experimental designs, which are formulated in terms of the minimization of the trace of the covariance matrix of the underlying regression process, using quasi-Newton sequential quadratic programming methods ...
Mario S. Mommer +3 more
doaj +1 more source
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 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
Global optimality conditions and optimization methods for quadratic integer programming problems
Global optimality conditions, Quadratic integer programming problem, Optimization method, Auxiliary function, 41A65, 41A29, 90C30,
Wu, Zhiyou +7 more
core +1 more source
The 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
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
A remark on Gwinner′s existence theorem on variational inequality problem
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

