Topic
Concave function
About: Concave function is a research topic. Over the lifetime, 1415 publications have been published within this topic receiving 33278 citations.
Papers published on a yearly basis
Papers
More filters
TL;DR: This study reveals that the lower bound affords a steplength domain which guarantees the convergence of the entire algorithm, and presents two new stepl lengths which can be computed via searching the positive root of a one dimension concave lower bound function.
7 citations
Journal Article•
TL;DR: The proposed PSO algorithm with decreasing inertia weight based on Gaussian funtion has better improvement in search ability, convergence rate and computation efficiency.
Abstract: To efficiently balance the global search and local search ability,this paper presented a particle swarm optimization(PSO) algorithm with decreasing inertia weight based on Gaussian funtion(GDIWPSO),this algorithm took advantage of the distribution and locality property of Gaussian function to implement nonlinear inertia weight adjustment.In simulation experiment,optimizing the benchmark function to determine the strategy of decreasing inertia weight and comparing the performance with weight of linear decreasing,convex function decreasing and concave function decreasing.The stimulation results show that the proposed PSO algorithm has better improvement in search ability,convergence rate and computation efficiency.
7 citations
01 Jan 2004
TL;DR: This paper studies general mixed fractional packing and covering problems (MPCe) of the following form: given a vector f and g, find an approximately feasible vector x ∈ B such that f(x) ≤ (1 + e) a and g (x) ≥ (1 – e) b.
Abstract: We study general mixed fractional packing and covering problems (MPCe ) of the following form: Given a vector $f: B \rightarrow {\rm IR}^{M}_{+}$ of M nonnegative continuous convex functions and a vector $g: B \rightarrow {\rm IR}^{M}_{+}$ of M nonnegative continuous concave functions, two M – dimensional nonnegative vectors a,b, a nonempty convex compact set B and a relative tolerance e ∈ (0,1), find an approximately feasible vector x ∈ B such that f(x) ≤ (1 + e) a and g(x) ≥ (1 – e) b or find a proof that no vector is feasible (that satisfies x ∈ B, f(x) ≤ a and g(x) ≥ b).
7 citations
TL;DR: Petrović's inequality is generalized for h−convex functions on coordinates with the condition that h is supermultiplicative in this paper, which is the case when h is submultiplicative.
Abstract: In this paper, Petrović’s inequality is generalized for h−convex functions on coordinates with the condition that h is supermultiplicative. In the case, when h is submultiplicative, Petrović’s inequality is generalized for h−concave functions. Also particular cases for P−function, Godunova-Levin functions, s−Godunova-Levin functions and s−convex functions has been discussed.
7 citations
TL;DR: The estimates of entropy numbers of operators on Calderon-Lozanovskii spaces are applied to approximation of the volume of @f-absolute convex hull of n points in R^k generated by a class of concave functions.
7 citations