词条 | Pseudoconvex function |
释义 |
In convex analysis and the calculus of variations, branches of mathematics, a pseudoconvex function is a function that behaves like a convex function with respect to finding its local minima, but need not actually be convex. Informally, a differentiable function is pseudoconvex if it is increasing in any direction where it has a positive directional derivative. Formal definitionFormally, a real-valued differentiable function ƒ defined on a (nonempty) convex open set X in the finite-dimensional Euclidean space Rn is said to be pseudoconvex if, for all {{nowrap|x, y ∈ X}} such that , we have .[1] Here ∇ƒ is the gradient of ƒ, defined by PropertiesEvery convex function is pseudoconvex, but the converse is not true. For example, the function {{nowrap|ƒ(x) {{=}} x + x3}} is pseudoconvex but not convex. Any pseudoconvex function is quasiconvex, but the converse is not true since the function {{nowrap|ƒ(x) {{=}} x3}} is quasiconvex but not pseudoconvex. Pseudoconvexity is primarily of interest because a point x* is a local minimum of a pseudoconvex function ƒ if and only if it is a stationary point of ƒ, which is to say that the gradient of ƒ vanishes at x*: [2] Generalization to nondifferentiable functionsThe notion of pseudoconvexity can be generalized to nondifferentiable functions as follows.[3] Given any function {{nowrap|ƒ : X → R}} we can define the upper Dini derivative of ƒ by where u is any unit vector. The function is said to be pseudoconvex if it is increasing in any direction where the upper Dini derivative is positive. More precisely, this is characterized in terms of the subdifferential ∂ƒ as follows:
Related notionsA {{visible anchor|pseudoconcave function}} is a function whose negative is pseudoconvex. A {{visible anchor|pseudolinear function}} is a function that is both pseudoconvex and pseudoconcave.[4] For example, linear–fractional programs have pseudolinear objective functions and linear–inequality constraints: These properties allow fractional–linear problems to be solved by a variant of the simplex algorithm (of George B. Dantzig).[5][6][7] See also
Notes1. ^{{harvnb|Mangasarian|1965}} 2. ^{{harvnb|Mangasarian|1965}} 3. ^{{harvnb|Floudas|Pardalos|2001}} 4. ^{{harvnb|Rapcsak|1991}} 5. ^Chapter five: {{cite book| last=Craven|first=B. D.|title=Fractional programming|series=Sigma Series in Applied Mathematics|volume=4|publisher=Heldermann Verlag|location=Berlin|year=1988|pages=145|isbn=3-88538-404-3 |mr=949209}} 6. ^{{cite news | last1=Kruk | first1=Serge|last2=Wolkowicz|first2=Henry|title=Pseudolinear programming |journal=SIAM Review|volume=41 |year=1999 |number=4 |pages=795–805 |mr=1723002 | jstor = 2653207 |doi=10.1137/S0036144598335259}} 7. ^{{cite news | last1=Mathis|first1=Frank H.|last2=Mathis|first2=Lenora Jane|title=A nonlinear programming algorithm for hospital management |journal=SIAM Review|volume=37 |year=1995 |number=2 |pages=230–234|mr=1343214 | jstor = 2132826 |doi=10.1137/1037046}} References
4 : Convex analysis|Convex optimization|Types of functions|Generalized convexity |
随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识,基本涵盖了大多数领域的百科知识,是一部内容自由、开放的电子版国际百科全书。