It appears you dont have a pdf plugin for this barrpostingser. We extend the standard procedure in two major ways and describe several variations. Note that the convexity of level sets does not characterize convex functions. There is a natural way to embed the set of convex bodies in that of logconcave functions, and there are surprisingly many analogies between the theory of convex bodies and that of logconcave date. Theorem 1 shows that any function, subject to weak conditions, can be expressed as the sum of a convex and concave part this decomposition is not unique. If this definition is followed, then yes a constant function, indeed any linear function, would be concave. We say that f is concave if the line segment joining any two points on the graph of f is never above the graph. Firstorder methods of smooth convex optimization with inexact oracle. Necessary and sufficient conditions such that extended mean values are schur convex or schur concave chu, yuming and zhang, xiaoming, journal of mathematics of kyoto university, 2008 a note on integral inequalities of hadamard type for log convex and log concave functions yang, gousheng, tseng, kueilin, and wang, hungta, taiwanese journal of. The concaveconvex procedure cccp is a majorizationminimization algorithm that solves d. Like strictly convex functions, strongly convex functions have unique minima on compact sets.
Curved mirrors concave and convex linkedin slideshare. Thanks for contributing an answer to economics stack exchange. According to the wikipedia defintion, for a function to be concave on the interval between a and b, the following must hold. So are the log convex functions, the multiplicatively convex functions, the subharmonic functions, and the functions which are convex with respect to a subgroup of the linear group. Finally, for convex f, fis concave, hence fis continuous, and fis continuous i fis continuous. In particular, if the domain is a closed interval in r, then concave functions can jump down at end points and convex functions can jump up. If the function u gx is convex downward, and the function y fu is convex downward and nondecreasing, then the composite function y fgx is also convex downward. International journal of scientific and research publications ijsrp 8. Convex functions whose subdi erentials have range with nonconvex interior are constructed on nonre exive spaces, and we exhibit examples of convex functions on in nite dimensional spaces whose subdi erentials have sparse domains. How to determine whether a function is concave, convex, quasiconcave and quasiconvex. It is a wellknown fact from convex analysis27 that the convex envelope of. In fact, a ne functions are the only functions that are both convex and concave. Convex lenses are converging lenses, and concave lenses are diverging lenses. Convex envelopes of products of convex and componentwise.
Concave and convex functions1 washington university. A concave function uy is continuous, di erentiable from the left and from the right. The axes for g are shown in perspective, like those for f, to make. A 5 a cartesian product of convex functions remains convex, so we. On convex envelopes and underestimators for bivariate functions. Convex sets and concave functions carmen astornefigari. Because results on concave functions can easily translated for convex functions we will only consider concave functions in the sequel. C f x 2 dom f j f x g sublevel sets of convex functions.
For a function of a single variable, along any stretch of the curve the highest point is one of the endpoints. Convex function, bounded subdi erential, domain, range, mackey convergence, support points. Concave production function implies convex cost function. Lenses concave and convex apparatus selection of lenses, collimated light source, e. Why is this composition of concave and convex functions concave. The negative of a quasiconvex function is said to be quasiconcave. We derive closedform expressions for convex envelopes of various. In mathematics, a quasiconvex function is a realvalued function defined on an interval or on a convex subset of a real vector space such that the inverse image of any set of the form. Necessary and sufficient conditions such that extended mean values are schurconvex or schurconcave chu, yuming and zhang, xiaoming, journal of mathematics of kyoto university, 2008 a note on integral inequalities of hadamard type for logconvex and logconcave functions yang, gousheng, tseng, kueilin, and wang, hungta, taiwanese journal of. The concave convex procedure cccp is a way to construct discretetime iterative dynamical systems that are guaranteed to decrease global optimization and energy functions monotonically. New york university department of economics econua 6 mathematics for economists c. This implies that cccp can be applied to almost any optimization problem.
They should try to describe any images they form in terms of magnification, upright or inverted, real or. It covers a large variety of subjects, from one real variable. Mathematics stack exchange is a question and answer site for people studying math at any level and professionals in related fields. Another relevant result about polyhedral convex envelopes is presented in 16 and will be discussed later. If f is convex and f is convex and increasing, then ux ffx is convex. The inequalities in the definition of concave and convex functions are weak. Concave functions havenice characterizationwhen theyaredifferentiable. Today well talk about characterizations of convex functions, show simple ways to test whether a function is convex, and importantly present the gradient ascent algorithm for minimizing a convex function. Critics of this account often rely on assumptions about preferences over wide ranges of.
However, the mathematical foundations of duality theory rest on the theory of convex sets and concave and convex functions. Today well talk about characterizations of convex functions, show simple ways to test whether a function is convex, and importantly present the. R is convex, if and only if the socalled epigraph of f, which is the subset of rn r consisting of all points x. A convex functional bounded from above in a neighbourhood of some point is continuous at that point. On exponentially concave functions and their impact in. Theorem 6 let f be a differentiable function on the open convex set c. There are two kind of a curved mirror, the concave and the convex mirrors. The \proper characterization of convex functions in terms of convex sets is given by proposition 3. In 15, 23 edgeconcave functions over a polytope p i. Note that the union of convex sets is not necessarily convex.
I have a quick silly question about a statement given without proof in convex optimization by boyd and vandenberghe page 87. Concavity and convexity ofc2functions of 2 variablestheorem 2. A concave function that has no linear parts is said to be strictly concave. There is a very close connection between convex sets and convex functions. In machine learning, cccp is extensively used in many learning algorithms like sparse support vector machines svms, transductive svms, sparse principal component analysis, etc. Our book aims to be a thorough introduction to the contemporary convex functions theory. Variations and extension of the convexconcave procedure. Firstorder methods of smooth convex optimization with. Why is this composition of concave and convex functions.
A convex lens gives a real, inverted image if the object is outside the focal length of the lens. The certain regularity conditions in the statement below will be speci. If f is concave and f is concave and increasing, then ux ffx is concave. Curvedspherical mirror a curved mirror is a mirror with a curved reflecting surface.
Socalled exponentially concave functions are of similar importance in information theory. It is strictly concave if and only if the inequality is strict for x x0. This is a minmax relation between a pair of convex and concave functions and their conjugate functions. If a convex functional is finite at some point, it has a finite or infinite derivative in any direction at that point. It will give a virtual upright image if the object is within the focal length. When you plot a function in the cartesian system, if the curve opens towards the positive y axis then it is said to be concave up or convex function while if it opens downwards then the curve is said to be concave down or concave function. Convex and concave functions of singular values of. Convexconcave programming is an organized heuristic for solving nonconvex problems that involve objective and constraint functions that are a sum of a convex and a concave term. Y denote real vector spaces, unless otherwise speci ed. But avoid asking for help, clarification, or responding to other answers. On convex envelopes and underestimators for bivariate. Take a look at a function that is both convex and concave on math\mathbb rmath.
Concave and convex functions 1concaveandconvexfunctions 1. Convex sets separation concave and convex functions quasiconcave functions other useful properties a. C f x 2 dom f j f x g sublevel sets of convex functions are convex converse is fa lse epigraph of f. Concave and convex maintain their status as adjectives when used in this context. Roughly speaking concavity of a function means that the graph is above chord. Uniformly convex functions edit a uniformly convex function, 9 10 with modulus. The dotted line is the set of convex combinations of these two points. Katarina nordblomconcave and convex functionsseptember 6, 20191 11.
The class of dc problems includes many difficult problems such as the traveling salesman problem. Quasi concave functions have nice properties for maximization. Conversely, any function that is convex and concave is a. The concaveconvex procedure cccp is a way to construct discretetime iterative dynamical systems that are guaranteed to decrease global optimization and energy functions monotonically. In mathematics, a realvalued function defined on an ndimensional interval is called convex or convex downward or concave upward if the line segment between any two points on the graph of the function lies above or on the graph. Abstract concave functions play a central role in optimization. The surface may be either convex bulging outward or concave bulging inward. A spoon is a kind of a curved mirror with both concave and convex surfaces. A concave surface curves inward, like the mouth of a cave. It is also possible to characterize concavity or convexity of functions in terms of the convexity of particular sets. Convex functions and their applications a contemporary. Concave converging mirror it is a curved mirror in which the reflective.
Equivalently, a function is convex if its epigraph the set of points on or above the graph of the function is a convex set. Thanks for contributing an answer to mathematics stack exchange. The concave convex procedure cccp is a majorizationminimization algorithm that solves d. Developing a working knowledge of convex optimization can be mathematically demanding, especially for the reader interested primarily in applications. Concave and convex functions let f be a function of many variables, defined on a convex set s. We investigate the convexconcave procedure, a local heuristic that utilizes the tools of convex optimization to find local optima of difference of convex dc programming problems. If you have trouble remembering whether a surface is convex or concave, there is an easy way to find out. Can a function be both convex and concave, or neither. In this paper, we comprehensively discuss mathematical properties of the class of exponentially concave functions, like closedness under linear and convex combi. For simplicity, assume mathf \colon \mathbb r \to \mathbb rmath, and take mathx,y \in \mathbb r2math and math\lambda \in 0,1math. Is f concave first note that the domain of f is a convex set, so the definition of concavity can apply the functions g and f are illustrated in the following figures. Convex functions basic properties and examples operations that preserve convexity the conjugate function quasiconvex functions logconcave and logconvex functions convexity with respect to generalized inequalities 31.
236 602 867 901 683 1427 627 426 335 989 818 778 1118 107 102 590 139 250 17 848 714 792 1282 994 286 874 1477 89 1213 447 211 1455 176 387