Showing 1 - 4 of 4
In optimization, objective functions which are both pseudoconvex and pseudoconcave have extensively been studied. Generalizing these results, we characterize pseudomonotone maps F where also -F is pseudomonotone and explore their properties in variational inequality problems. In particular, we...
Persistent link: https://www.econbiz.de/10005474839
Duality is studied for an abstract equilibrium problem which includes, among others, optimization problems and variational inequality problems. Follwing different schemes, various duals are proposed and primal-dual relationships are established under certaing generalized convexity and...
Persistent link: https://www.econbiz.de/10005474843
In the first part of this paper we prove that the global quadratic optimization problem over a simplex can be solved with a constant relative accuracy. In the second part we consider some natural extensions of the result.
Persistent link: https://www.econbiz.de/10005779402
This paper presents a combinatorial polynomial-time algorithm for minimizing submodular set functions. The algorithm employs a scaling scheme that uses a flow in the complete directed graph on the underlying set with each arc capacity equal to the scaled parameter.
Persistent link: https://www.econbiz.de/10005779433