scispace - formally typeset
Search or ask a question
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
More filters
Journal ArticleDOI
TL;DR: In this article, a global minimizer of a concave function over a sphere was found by constructing a canonical dual function, and two theorems concerning the global optimality of an extrema of the optimization problem were presented.

7 citations

Journal ArticleDOI
TL;DR: In this paper, new estimates on generalization of Hermite-Hadamard-like type inequalities for functions whose second derivatives in absolute value at certain powers are convex and concave are established.
Abstract: In this article, new estimates on generalization of Hermite-Hadamardlike type inequalities for functions whose second derivatives in absolute value at certain powers are convex and concave are established. Mathematics Subject Classication: 26D15, 26A51

7 citations

Journal ArticleDOI
TL;DR: Results with univariate data show that the proposed valid inequalities improve the root relaxation lower bound, permitting significant improvements in solution time.

7 citations

Journal ArticleDOI
TL;DR: An algorithm that combines branch and bound with cutting planes to globally minimize a concave function over a polyhedron solves a series of linear underestimating subproblems over subsets of the feasible region, yielding lower and upper bounds on the optimal objective value of the original problem.

7 citations

Journal ArticleDOI
TL;DR: The maximum-entropy is shown to be a concave function of the specified parameters and this is used to give a new method of handling inequality constraints.
Abstract: The maximum-entropy complexity measures introduced by Ferdinand4 and Comacchio1 have been examined. It is shown that for linearly independent constraints, μ>-transition points do not in general exit for μ>1. Two new concepts viz of transition hypersurfaces and of new maximum-entropy complexity measures are introduced. The maximum-entropy is shown to be a concave function of the specified parameters and this Tact is used to give a new method of handling inequality constraints.

7 citations


Network Information
Related Topics (5)
Markov chain
51.9K papers, 1.3M citations
74% related
Bounded function
77.2K papers, 1.3M citations
74% related
Polynomial
52.6K papers, 853.1K citations
72% related
Upper and lower bounds
56.9K papers, 1.1M citations
72% related
Eigenvalues and eigenvectors
51.7K papers, 1.1M citations
72% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202316
202240
202158
202049
201952
201860