In recent years, numerical and experimental investigations on the draft tube performance have confirmed the importance of the inlet swirling flow created by the runner vanes. The results indicate that it is still a challenge to get the optimal flow distribution at the draft tube inlet which...

Many derivative-free methods for constrained problems are not efficient for minimizing functions on “thin” domains. Other algorithms, like those based on Augmented Lagrangians, deal with thin constraints using penalty-like strategies. When the constraints are computationally inexpensive but...

This paper proposes the use of multiagent cooperation for solving global optimization problems through the introduction of a new multiagent environment, MANGO. The strength of the environment lays in its flexible structure based on communicating software agents that attempt to solve a problem...

Karush–Kuhn–Tucker (KKT) optimality conditions are often checked for investigating whether a solution obtained by an optimization algorithm is a likely candidate for the optimum. In this study, we report that although the KKT conditions must all be satisfied at the optimal point, the extent...

In this paper, a class of composite multiobjective nonsmooth optimization problems with cone constraints is considered. Necessary optimality conditions for weak minimum are established in terms of Semi-infinite Gordan type theorem. η-generalized null space condition, which is a proper...

This paper presents branch-and-bound algorithms for the partial inverse mixed integer linear programming (PInvMILP) problem, which is to find a minimal perturbation to the objective function of a mixed integer linear program (MILP), measured by some norm, such that there exists an optimal...

In this paper we present an extension of the proximal point algorithm with Bregman distances to solve constrained minimization problems with quasiconvex and convex objective function on Hadamard manifolds. The proposed algorithm is a modified and extended version of the one presented in Papa...

We describe the minimum volume simplex enclosure problem (MVSEP), which is known to be a global optimization problem, and further investigate its multimodality. The problem is a basis for several (unmixing) methods that estimate so-called endmembers and fractional values in a linear mixing...

We introduce the notion of strongly <InlineEquation ID="IEq1"> <EquationSource Format="TEX">$$t$$</EquationSource> </InlineEquation>-convex set-valued maps and present some properties of it. In particular, a Bernstein–Doetsch and Sierpiński-type theorems for strongly midconvex set-valued maps, as well as a Kuhn-type result are obtained. A representation of strongly <InlineEquation ID="IEq2"> <EquationSource Format="TEX">$$t$$</EquationSource> </InlineEquation>-convex...</equationsource></inlineequation></equationsource></inlineequation>

This note studies an exchange economy in which there are n traders and n “kinds” of commodities. Each trader has n utility functions corresponding to n “kinds” of commodities, respectively. Thus, a multiple non-transferable utility game can be derived from this exchange economy. It is...