Results 11 to 20 of about 231 (178)
On
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
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
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
Two decades of blackbox optimization applications
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
On Convergence of Binary Trust-Region Steepest Descent [PDF]
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
A three-term Polak-Ribière-Polyak derivative-free method and its application to image restoration
In this paper, a derivative-free method for solving convex constrained nonlinear equations involving a monotone operator with a Lipschitz condition imposed on the underlying operator is introduced and studied.
Abdulkarim Hassan Ibrahim +3 more
doaj +1 more source
Relations between Abs-Normal NLPs and MPCCs. Part 2: Weak Constraint Qualifications [PDF]
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
A new elementary proof for M-stationarity under MPCC-GCQ for mathematical programs with complementarity constraints [PDF]
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
The complexity of optimizing over a simplex, hypercube or sphere: a short survey [PDF]
Computational complexity, Global optimization, Linear and semidefinite programming, Approximation algorithms, 68Q25, 90C30, 90C60,
Etienne Klerk +3 more
core +1 more source
We propose new mathematical models of inventory management in a reverse logistics system. The proposed models extend the model introduced by Nahmias and Rivera with the assumption that the demand for newly produced and repaired (remanufacturing) items ...
M. Forkan, M.M. Rizvi, M.A.M. Chowdhury
doaj +1 more source

