Results 1 to 10 of about 1,574 (145)
The exactness of the ℓ1 penalty function for a class of mathematical programs with generalized complementarity constraints [PDF]
Fundamental ResearchIn a mathematical program with generalized complementarity constraints (MPGCC), complementarity relation is imposed between each pair of variable blocks.
Yukuan Hu, Xin Liu
doaj +2 more sources
A mathematical justification for metronomic chemotherapy in oncology [PDF]
Mathematical Modelling of Natural Phenomena, 2021 We mathematically justify metronomic chemotherapy as the best strategy to apply most cytotoxic drugs in oncology for both curative and palliative approaches, assuming the classical pharmacokinetic model together with the Emax pharmacodynamic and the ...
L. Fern'andez +2 more
semanticscholar +1 more source
Journal of Computational Mathematics, 2022 In the present paper, we study the restricted inexact Newton-type method for solving the generalized equation 0 ∈ f(x)+F (x), where X and Y are Banach spaces, f : X → Y is a Fréchet differentiable function and F : X ⇉ Y is a set-valued mapping with ...
M. Rashid
semanticscholar +1 more source
Combining the cross-entropy algorithm and ∈-constraint method for multiobjective optimization
Moroccan Journal of Pure and Applied Analysis, 2021 This paper aims to propose a new hybrid approach for solving multiobjective optimization problems. This approach is based on a combination of global and local search procedures.
Ezzine Abdelmajid +2 more
doaj +1 more source
Good Characteristics of The New Spectral Conjugate Gradient Method for Unconstrained Optimization
Journal of Physics: Conference Series, 2021 The spectral conjugate gradient (SCG) method is an effective method to solve large-scale nonlinear unconstrained optimization problems. In this work, we propose a new SCG method in which performance is numerically analyzed.
A. H. Sheekoo, G. Al-Naemi
semanticscholar +1 more source
Pareto front approximation through a multi-objective augmented Lagrangian method
EURO Journal on Computational Optimization, 2021 In this manuscript, we consider smooth multi-objective optimization problems with convex constraints. We propose an extension of a multi-objective augmented Lagrangian Method from recent literature.
Guido Cocchi +2 more
doaj +1 more source
Convergence rate of the modified Levenberg-Marquardt method under Hölderian local error bound
Open Mathematics, 2022 In this article, we analyze the convergence rate of the modified Levenberg-Marquardt (MLM) method under the Hölderian local error bound condition and the Hölderian continuity of the Jacobian, which are more general than the local error bound condition ...
Zheng Lin, Chen Liang, Tang Yangxin
doaj +1 more source
RAIRO Oper. Res., 2021 In this paper, a new modified Perry-type derivative-free projection method for solving largescale nonlinear monotone equations is presented. The method is developed by combining a modified Perry’s conjugate gradient method with the hyperplane projection ...
M. Koorapetse +2 more
semanticscholar +1 more source
Topological Algebra and its Applications, 2022 Conjugate gradient methods are very popular for solving large scale unconstrained optimization problems because of their simplicity to implement and low memory requirements.
Diphofu T., Kaelo P., Tufa A.R.
doaj +1 more source
KT-E-invexity in E-differentiable vector optimization problems
, 2021 In this paper, a new concept of generalized convexity is introduced for E-differentiable vector optimization problems. Namely, the concept of KT-E-invexity is defined for (not necessarily) differentiable vector optimization problems in which the ...
Najeeb Abdulaleem
semanticscholar +1 more source