Results 11 to 20 of about 253 (176)
On
Fixed Point Theory and Applications, 2011 A multiobjective fractional optimization problem (MFP), which consists of more than two fractional objective functions with convex numerator functions and convex denominator functions, finitely many convex constraint functions, and a geometric constraint
Kim Gwi, Lee Gue, Kim Moon
doaj +1 more source
Infant Mental Health Journal: Infancy and Early Childhood, Volume 43, Issue 6, Page 899-909, November 2022., 2022 Abstract The Team for Infants Exposed to Substance use (TIES) Program is a longstanding home‐based family support program that provides a multidisciplinary, community‐facing model to address the complex needs of families with young children affected by maternal substance use.
Danielle F. Chiang +2 more
wiley +1 more source
Veterinary Dermatology, Volume 33, Issue 1, Page 17-e6, February 2022., 2022 Background – Because of the increased incidence of multidrug‐resistant (MDR) bacteria, the use of disinfectants over antibiotics has been encouraged. However, the interactions between disinfectants and host local immunity are poorly understood. Objective – To assess the effects of chlorhexidine digluconate (Chx), with and without selected host defence ...
Domenico Santoro +3 more
wiley +1 more source
On implicit variables in optimization theory [PDF]
Journal of Nonsmooth Analysis and Optimization, 2021 Implicit variables of a mathematical program are variables which do not need to be optimized but are used to model feasibility conditions. They frequently appear in several different problem classes of optimization theory comprising bilevel programming ...
Matúš Benko, Patrick Mehlitz
doaj +1 more source
Relations between Abs-Normal NLPs and MPCCs. Part 2: Weak Constraint Qualifications [PDF]
Journal of Nonsmooth Analysis and Optimization, 2021 This work continues an ongoing effort to compare non-smooth optimization problems in abs-normal form to Mathematical Programs with Complementarity Constraints (MPCCs).
Lisa C. Hegerhorst-Schultchen +2 more
doaj +1 more source
Analysis and comparisons of some solution concepts for stochastic programming problems [PDF]
, 2002 Stochastic programming, optimal solution concepts, 90C15, 90C30,
L. Rey +8 more
core +1 more source
On Convergence of Binary Trust-Region Steepest Descent [PDF]
Journal of Nonsmooth Analysis and Optimization, 2023 Binary trust-region steepest descent (BTR) and combinatorial integral approximation (CIA) are two recently investigated approaches for the solution of optimization problems with distributed binary-/discrete-valued variables (control functions).
Paul Manns +4 more
doaj +1 more source
Two decades of blackbox optimization applications
EURO Journal on Computational Optimization, 2021 This article reviews blackbox optimization applications of direct search optimization methods over the past twenty years. Emphasis is placed on the Mesh Adaptive Direct Search (Mads) derivative-free optimization algorithm.
Stéphane Alarie +4 more
doaj +1 more source
Characterizations of the Solution Sets of Generalized Convex Fuzzy Optimization Problem
Open Mathematics, 2019 This paper provides some new characterizations of the solution sets for non-differentiable generalized convex fuzzy optimization problem. Firstly, we introduce some new generalized convex fuzzy functions and discuss the relationships among them. Secondly,
Chen Wang, Zhou Zhiang
doaj +1 more source
A new elementary proof for M-stationarity under MPCC-GCQ for mathematical programs with complementarity constraints [PDF]
Journal of Nonsmooth Analysis and Optimization, 2021 It is known in the literature that local minimizers of mathematical programs with complementarity constraints (MPCCs) are so-called M-stationary points, if a weak MPCC-tailored Guignard constraint qualification (called MPCC-GCQ) holds.
Felix Harder
doaj +1 more source