Convex Functions

Total Page:16

File Type:pdf, Size:1020Kb

Convex Functions Lecture 3: Convex Functions Xiugang Wu University of Delaware Fall 2019 1 Outline • Basic Properties and Examples • Operations that Preserve Convexity • The Conjugate Function • Quasiconvex Functions • Log-concave and Log-convex Functions • Convexity with respect to Generalized Inequalities 2 Outline • Basic Properties and Examples • Operations that Preserve Convexity • The Conjugate Function • Quasiconvex Functions • Log-concave and Log-convex Functions • Convexity with respect to Generalized Inequalities 3 Convex Function A function f : Rn R is convex if dom f is a convex set and ! f(✓x +(1 ✓)y) ✓f(x)+(1 ✓)f(y) − − for all x, y dom f and ✓ [0, 1] 2 2 - f is strictly convex if the above holds with “ ” replaced by “<” - f is concave if f is convex − -affine functions are both convex and concave; conversely, if a function is both convex and concave, then it is affine - f is convex i↵ it is convex when restricted to any line that intersects its domain, i.e. i↵ for all x dom f and all v, the function g(t)=f(x + tv) on its domain t x + tv dom2 f is convex { | 2 } 4 Extended-Value Extension - The extended-value extension f˜ of f is defined by f(x) x dom f f˜(x)= 2 x/dom f (1 2 - This simplifies notation as f is convex i↵ f˜(✓x +(1 ✓)y) ✓f˜(x)+(1 ✓)f˜(y), x, y Rn, ✓ [0, 1] − − 8 2 2 - We can recover the domain of f from the extension by taking dom f = x f˜(x) < { | 1} 5 First Order Condition - f is di↵erentiable if dom f is open and the gradient @f @f @f f(x)= , ,..., r @x @x @x ✓ 1 2 n ◆ exists at each x dom f 2 -di↵erentiable f with convex domain is convex i↵ f(y) f(x)+ f(x)T (y x), x, y dom f ≥ r − 8 2 - Note that the affine function g(y)=f(x)+ f(x)T (y x) is the first-order Taylor approximation of f near x. The abover says that− f is convex i↵ the first-order Taylor approximation is always an underestimator of f. 6 Second Order Condition - f is twice di↵erentiable if dom f is open and the Hessian 2f(x) Sn, r 2 2 2 @ f f(x)ij = ,i,j [1 : n] r @xi@xj 2 exists at each x dom f 2 -twicedi↵erentiable f with convex domain is convex i↵ the Hessian 2f(x)is PSD for all x dom f r 2 -twicedi↵erentiable f with convex domain is strictly convex if the Hessian 2f(x) is PD for all x dom f r 2 1 T T - Quadratic function f(x)= 2 x Px+ q x + r is convex i↵ its Hessian P is PSD [Note that (xT Px)=2Px and 2(xT Px)=2P ] r r 2 T - Least-squares objective f(x)= Ax b 2 is convex because f =2A (Ax b) and 2f =2AT A 0 for any Ak − k r − r ⌫ 7 Examples in One Dimension Convex -affine: ax + b on R, for any a, b R 2 - exponential: eax on R, for any a R 2 -powers:xa on R , for a 1 or a 0 ++ ≥ - powers of absolute value: x a on R, for a 1 | | ≥ - negative entropy: x log x on R++ Concave -affine: ax + b on R, for any a, b R 2 -powers:xa on R , for a [0, 1] ++ 2 - logarithm: log x on R++ 8 Examples in High Dimensions affine functions are convex and concave; all norms are convex Examples on Rn -affine function: f(x)=aT x + b n p 1/p - norms: e.g., x p =( i=1 xi ) for p 1; x = maxi [1:n] xi k k | | ≥ k k1 2 | | P m n Examples on R ⇥ -affine function: T f(X)=tr(A X)+b = AijXij + b i [1:m] j [1:n] 2X 2X - spectral (maximum singlar value) norm: f(X)= X = σ (X)=(λ (XT X))1/2 k k2 max max 9 Examples in High Dimensions - max function: f(x) = maxi xi is convex - Quadratic over linear function: f(x, y)=x2/y is convex for y>0 2 y2 xy 2 y 2f(x, y)= − = y x 0 r y3 xy x2 y3 x − ⌫ − − ⇥ ⇤ - Log-sum-exponential: f(x) = log(ex1 + +exn ) is convex; also called softmax ··· 1/n - Geometric mean: f(x)=( i xi) is concave Q n - Log determinant: f(x) = log detX, dom f = S++ is concave g(t) = log det(Z + tV ) 1/2 1/2 1/2 1/2 = log det(Z (I + tZ− VZ− )Z ) 1/2 1/2 = log detZ + log det(I + tZ− VZ− ) n = log detZ + log(1 + tλi) i=1 X 1/2 1/2 where λ ,i [1 : n] are the eigenvalues of Z− VZ− i 2 10 Sublevel Set and Epigraph -The↵-sublevel set of f is x domf f(x) ↵ .Iff is convex, then its sublevel set is convex. Converse{ 2 is not true:| ex is} concave, but its sublevel sets are convex. − - The graph of function f is defined as (x, f(x) x dom f) ,whichisasubset in Rn+1. The epigraph is defined as{epif =| (2x, t) x dom} f,t f(x) . Function f is convex i↵ its epigraph is a convex{ set. | 2 ≥ } 11 Jensen’s Inequality -Iff is convex, then f(Ex) Ef(x) for any random variable x with x dom f w.p. 1. If f is non-convex, then there is a random variable x with x2 domf w.p. 1, such that f(Ex) > Ef(x). 2 - An intepretation: Consider convex function f. For any x dom f and random variable z with Ez = 0, we have 2 Ef(x + z) f(E[x + z]) = f(x), ≥ which means that randomization or dithering (adding a zero mean random vec- tor to the argument) only increases the value of convex function on average. 12 Outline • Basic Properties and Examples • Operations that Preserve Convexity • The Conjugate Function • Quasiconvex Functions • Log-concave and Log-convex Functions • Convexity with respect to Generalized Inequalities 13 A Calculus of Convex Functions Practical methods for establishing convexity of a function: - verify definition (often simplified by restricting to a line) - for twice di↵erentiable function, show its Hessian is PSD - show that f is obtained from simple convex functions by operations that preserve convexity – nonnegative weighted sum – composition with affine function – pointwise maximum and supremum – composition – minimization – perspective 14 Positive Weighted Sum and Composition with Affine Nonnegative weighted sum: If f ,...,f are convex then f = w f + +w f 1 m 1 1 ··· m m is also convex, where w1,...,wm are nonnegative Composition with affine function: f(Ax + b) is convex if f is convex - log barrier for linear inequalities: m f(x)= log(b aT x), dom f = x aT x<b,i [1 : m] − i − i { | i i 2 } i=1 X - any norm of affine function: f(x)= Ax + b k k 15 Pointwise Maximum If f ,...,f are convex then f(x) = max f (x),...,f (x) is also convex 1 m { 1 m } T - piecewise-linear function: f(x) = maxi [1:m](ai x + b) is convex 2 - sum of r largest components of x Rn: 2 f(x)=x[1] + x[2] + ...+ x[r] is convex, where x[i] is the ith largest component of x; this is because f(x) = max xi I [1:n], I =r ✓ | | i I X2 16 Pointwise Supremum If f(x, y) is convex in x for each y A then 2 g(x)=supf(x, y) y A 2 is also convex T - support function of a set C: SC (x)=supy C y x is convex 2 - distance to farthest point in a set C: f(x)=sup x y y C k − k 2 - maximum eigenvalue of symmetric matrix: for X Sn, 2 T λmax(X)= sup y Xy y =1 k k2 17 Composition with Scalar Functions Composition of h : R R with scalar function g : Rn R: ! ! f(x)=h(g(x)) f is convex if: - g convex, h convex, h˜ nondecreasing - g concave, h convex, h˜ nonincreasing Remark: - proof (for n = 1, di↵erentiable g, h) 2 f 00(x)=h00(g(x))g0(x) + h0(g(x))g00(x) - monotonicity must hold for extended-value extension h˜ Examples: -expg(x) is convex if g is convex -1/g(x) is convex if g is concave and positive 18 Composition with Vector Functions Composition of h : Rk R with scalar function g : Rn Rk: ! ! f(x)=h(g1(x),g2(x),...,gk(x)) f is convex if: - gi convex, h convex, h˜ nondecreasing in each argument - gi concave, h convex, h˜ nonincreasing in each argument proof (for n = 1, di↵erentiable g, h) T 2 T f 00(x)=g0(x) h(g(x))g0(x)+ h(g(x)) g00(x) r r Examples: m - i=1 log gi(x) is concave if gi are concave and positive m - log exp gi(x) is convex if g are convex P i=1 P 19 Minimization If f is convex in (x, y) and C is a convex nonempty set, then the function g(x)=infy C f(x, y) is also convex 2 E.g., distance to a set: d(x, S)=infy S x y is convex if S is convex [function x y is convex in (x, y)soifS is convex2 k − thenk d(x, S) is convex in x] k − k 20 Perspective The perspective of f : Rn R is the function g : Rn+1 R given by ! ! g(x, t)=tf(x/t) with domg = (x, t) x/t domf,t > 0 .
Recommended publications
  • CORE View Metadata, Citation and Similar Papers at Core.Ac.Uk
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Bulgarian Digital Mathematics Library at IMI-BAS Serdica Math. J. 27 (2001), 203-218 FIRST ORDER CHARACTERIZATIONS OF PSEUDOCONVEX FUNCTIONS Vsevolod Ivanov Ivanov Communicated by A. L. Dontchev Abstract. First order characterizations of pseudoconvex functions are investigated in terms of generalized directional derivatives. A connection with the invexity is analysed. Well-known first order characterizations of the solution sets of pseudolinear programs are generalized to the case of pseudoconvex programs. The concepts of pseudoconvexity and invexity do not depend on a single definition of the generalized directional derivative. 1. Introduction. Three characterizations of pseudoconvex functions are considered in this paper. The first is new. It is well-known that each pseudo- convex function is invex. Then the following question arises: what is the type of 2000 Mathematics Subject Classification: 26B25, 90C26, 26E15. Key words: Generalized convexity, nonsmooth function, generalized directional derivative, pseudoconvex function, quasiconvex function, invex function, nonsmooth optimization, solution sets, pseudomonotone generalized directional derivative. 204 Vsevolod Ivanov Ivanov the function η from the definition of invexity, when the invex function is pseudo- convex. This question is considered in Section 3, and a first order necessary and sufficient condition for pseudoconvexity of a function is given there. It is shown that the class of strongly pseudoconvex functions, considered by Weir [25], coin- cides with pseudoconvex ones. The main result of Section 3 is applied to characterize the solution set of a nonlinear programming problem in Section 4. The base results of Jeyakumar and Yang in the paper [13] are generalized there to the case, when the function is pseudoconvex.
    [Show full text]
  • Robustly Quasiconvex Function
    Robustly quasiconvex function Bui Thi Hoa Centre for Informatics and Applied Optimization, Federation University Australia May 21, 2018 Bui Thi Hoa (CIAO, FedUni) Robustly quasiconvex function May 21, 2018 1 / 15 Convex functions 1 All lower level sets are convex. 2 Each local minimum is a global minimum. 3 Each stationary point is a global minimizer. Bui Thi Hoa (CIAO, FedUni) Robustly quasiconvex function May 21, 2018 2 / 15 Definition f is called explicitly quasiconvex if it is quasiconvex and for all λ 2 (0; 1) f (λx + (1 − λ)y) < maxff (x); f (y)g; with f (x) 6= f (y): Example 1 f1 : R ! R; f1(x) = 0; x 6= 0; f1(0) = 1. 2 f2 : R ! R; f2(x) = 1; x 6= 0; f2(0) = 0. 3 Convex functions are quasiconvex, and explicitly quasiconvex. 4 f (x) = x3 are quasiconvex, and explicitly quasiconvex, but not convex. Generalised Convexity Definition A function f : X ! R, with a convex domf , is called quasiconvex if for all x; y 2 domf , and λ 2 [0; 1] we have f (λx + (1 − λ)y) ≤ maxff (x); f (y)g: Bui Thi Hoa (CIAO, FedUni) Robustly quasiconvex function May 21, 2018 3 / 15 Example 1 f1 : R ! R; f1(x) = 0; x 6= 0; f1(0) = 1. 2 f2 : R ! R; f2(x) = 1; x 6= 0; f2(0) = 0. 3 Convex functions are quasiconvex, and explicitly quasiconvex. 4 f (x) = x3 are quasiconvex, and explicitly quasiconvex, but not convex. Generalised Convexity Definition A function f : X ! R, with a convex domf , is called quasiconvex if for all x; y 2 domf , and λ 2 [0; 1] we have f (λx + (1 − λ)y) ≤ maxff (x); f (y)g: Definition f is called explicitly quasiconvex if it is quasiconvex and
    [Show full text]
  • Convexity I: Sets and Functions
    Convexity I: Sets and Functions Ryan Tibshirani Convex Optimization 10-725/36-725 See supplements for reviews of basic real analysis • basic multivariate calculus • basic linear algebra • Last time: why convexity? Why convexity? Simply put: because we can broadly understand and solve convex optimization problems Nonconvex problems are mostly treated on a case by case basis Reminder: a convex optimization problem is of ● the form ● ● min f(x) x2D ● ● subject to gi(x) 0; i = 1; : : : m ≤ hj(x) = 0; j = 1; : : : r ● ● where f and gi, i = 1; : : : m are all convex, and ● hj, j = 1; : : : r are affine. Special property: any ● local minimizer is a global minimizer ● 2 Outline Today: Convex sets • Examples • Key properties • Operations preserving convexity • Same for convex functions • 3 Convex sets n Convex set: C R such that ⊆ x; y C = tx + (1 t)y C for all 0 t 1 2 ) − 2 ≤ ≤ In words, line segment joining any two elements lies entirely in set 24 2 Convex sets Figure 2.2 Some simple convexn and nonconvex sets. Left. The hexagon, Convex combinationwhich includesof x1; its : :boundary : xk (shownR : darker), any linear is convex. combinationMiddle. The kidney shaped set is not convex, since2 the line segment between the twopointsin the set shown as dots is not contained in the set. Right. The square contains some boundaryθ1x points1 + but::: not+ others,θkxk and is not convex. k with θi 0, i = 1; : : : k, and θi = 1. Convex hull of a set C, ≥ i=1 conv(C), is all convex combinations of elements. Always convex P 4 Figure 2.3 The convex hulls of two sets in R2.
    [Show full text]
  • Local Maximum Points of Explicitly Quasiconvex Functions
    Local maximum points of explicitly quasiconvex functions Item Type Article Authors Bagdasar, Ovidiu; Popovici, Nicolae Citation Bagdasar, O. & Popovici, (2015) 'Local maximum points of explicitly quasiconvex functions' Optimization Letters, 9: 769. doi:10.1007/s11590-014-0781-3 DOI 10.1007/s11590-014-0781-3 Publisher Springer Journal Optimization Letters Rights Archived with thanks to Optimization Letters Download date 25/09/2021 20:26:30 Link to Item http://hdl.handle.net/10545/620886 Optimization Letters manuscript No. (will be inserted by the editor) Local maximum points of explicitly quasiconvex functions Ovidiu Bagdasar · Nicolae Popovici Received: date / Accepted: date Abstract This work concerns (generalized) convex real-valued functions defined on a nonempty convex subset of a real topological linear space. Its aim is twofold. The first concerns explicitly quasiconvex functions. As a counterpart of some known results, it is shown that any local maximum point of such a function is actually a global minimum point whenever it belongs to the intrinsic core of the function's domain. Secondly, we establish a new characterization of strictly convex normed spaces by applying this property for a particular class of convex functions. Keywords Local maximum point · Relative algebraic interior · Convex function · Explicitly quasiconvex function · Strictly convex space · Least squares problem 1 Introduction Optimization problems involving explicitly quasiconvex objective functions, i.e., real-valued functions which are both quasiconvex and semistrictly quasiconvex, have been intensively studied in the literature, beginning with the pioneering works by Martos [6] and Karamardian [5]. These functions are of special interest since they preserve several fundamental properties of convex functions.
    [Show full text]
  • A Class of Functions That Are Quasiconvex but Not Polyconvex
    University of Tennessee, Knoxville TRACE: Tennessee Research and Creative Exchange Masters Theses Graduate School 12-2003 A Class of Functions That Are Quasiconvex But Not Polyconvex Catherine S. Remus University of Tennessee - Knoxville Follow this and additional works at: https://trace.tennessee.edu/utk_gradthes Part of the Mathematics Commons Recommended Citation Remus, Catherine S., "A Class of Functions That Are Quasiconvex But Not Polyconvex. " Master's Thesis, University of Tennessee, 2003. https://trace.tennessee.edu/utk_gradthes/2219 This Thesis is brought to you for free and open access by the Graduate School at TRACE: Tennessee Research and Creative Exchange. It has been accepted for inclusion in Masters Theses by an authorized administrator of TRACE: Tennessee Research and Creative Exchange. For more information, please contact [email protected]. To the Graduate Council: I am submitting herewith a thesis written by Catherine S. Remus entitled "A Class of Functions That Are Quasiconvex But Not Polyconvex." I have examined the final electronic copy of this thesis for form and content and recommend that it be accepted in partial fulfillment of the requirements for the degree of Master of Science, with a major in Mathematics. Henry C. Simpson, Major Professor We have read this thesis and recommend its acceptance: Charles Collins, G. Samuel Jordan Accepted for the Council: Carolyn R. Hodges Vice Provost and Dean of the Graduate School (Original signatures are on file with official studentecor r ds.) To the Graduate Council: I am submitting herewith a thesis written by Catherine S. Remus entitled “A Class of Functions That Are Quasiconvex But Not Polyconvex”.
    [Show full text]
  • Convex Functions
    Convex Functions Prof. Daniel P. Palomar ELEC5470/IEDA6100A - Convex Optimization The Hong Kong University of Science and Technology (HKUST) Fall 2020-21 Outline of Lecture • Definition convex function • Examples on R, Rn, and Rn×n • Restriction of a convex function to a line • First- and second-order conditions • Operations that preserve convexity • Quasi-convexity, log-convexity, and convexity w.r.t. generalized inequalities (Acknowledgement to Stephen Boyd for material for this lecture.) Daniel P. Palomar 1 Definition of Convex Function • A function f : Rn −! R is said to be convex if the domain, dom f, is convex and for any x; y 2 dom f and 0 ≤ θ ≤ 1, f (θx + (1 − θ) y) ≤ θf (x) + (1 − θ) f (y) : • f is strictly convex if the inequality is strict for 0 < θ < 1. • f is concave if −f is convex. Daniel P. Palomar 2 Examples on R Convex functions: • affine: ax + b on R • powers of absolute value: jxjp on R, for p ≥ 1 (e.g., jxj) p 2 • powers: x on R++, for p ≥ 1 or p ≤ 0 (e.g., x ) • exponential: eax on R • negative entropy: x log x on R++ Concave functions: • affine: ax + b on R p • powers: x on R++, for 0 ≤ p ≤ 1 • logarithm: log x on R++ Daniel P. Palomar 3 Examples on Rn • Affine functions f (x) = aT x + b are convex and concave on Rn. n • Norms kxk are convex on R (e.g., kxk1, kxk1, kxk2). • Quadratic functions f (x) = xT P x + 2qT x + r are convex Rn if and only if P 0.
    [Show full text]
  • Characterisations of Quasiconvex Functions
    BULL. AUSTRAL. MATH. SOC. 26B25, 49J52 VOL. 48 (1993) [393-406] CHARACTERISATIONS OF QUASICONVEX FUNCTIONS DINH THE LUC In this paper we introduce the concept of quasimonotone maps and prove that a lower semicontinuous function on an infinite dimensional space is quasiconvex if and only if its generalised subdifferential or its directional derivative is quasimonotone. 1. INTRODUCTION As far as we know quasiconvex functions were first mentioned by de Finetti in his work "Sulle Straficazioni Convesse" in 1949, [6]. Since then much effort has been focused on the study of this class of functions for they have much in common with convex functions and they are used in several areas of science including mathematics, operations research, economics et cetera (see [15]). One of the most important properties of convex functions is that their level sets are convex. This property is also a fundamental geometric characterisation of quasiconvex functions which sometimes is treated as their definition. However, the most attractive characterisations of quasiconvex functions are those which involve gradients (a detailed account of the current state of research on the topic can be found in [l]). As to generalised derivatives of quasiconvex functions, very few results exist (see [1,7]). In [7], a study of quasiconvex functions is presented via Clarke's subdifferential, but the authors restrict themselves to the case of Lipschitz functions on a finite dimensional space only. The aim of our paper is to characterise lower semicontinuous quasiconvex functions in terms of generalised (Clarke-Rockafellar) subdifferentials and directional derivatives in infinite dimensional spaces. Namely, we shall first introduce a new concept of quasi- monotone maps; and then we prove the equivalence between the quasiconvexity of a function and the quasimonotonicity of its generalised subdifferential and its directional derivative.
    [Show full text]
  • Sum of Squares and Polynomial Convexity
    CONFIDENTIAL. Limited circulation. For review only. Sum of Squares and Polynomial Convexity Amir Ali Ahmadi and Pablo A. Parrilo Abstract— The notion of sos-convexity has recently been semidefiniteness of the Hessian matrix is replaced with proposed as a tractable sufficient condition for convexity of the existence of an appropriately defined sum of squares polynomials based on sum of squares decomposition. A multi- decomposition. As we will briefly review in this paper, by variate polynomial p(x) = p(x1; : : : ; xn) is said to be sos-convex if its Hessian H(x) can be factored as H(x) = M T (x) M (x) drawing some appealing connections between real algebra with a possibly nonsquare polynomial matrix M(x). It turns and numerical optimization, the latter problem can be re- out that one can reduce the problem of deciding sos-convexity duced to the feasibility of a semidefinite program. of a polynomial to the feasibility of a semidefinite program, Despite the relative recency of the concept of sos- which can be checked efficiently. Motivated by this computa- convexity, it has already appeared in a number of theo- tional tractability, it has been speculated whether every convex polynomial must necessarily be sos-convex. In this paper, we retical and practical settings. In [6], Helton and Nie use answer this question in the negative by presenting an explicit sos-convexity to give sufficient conditions for semidefinite example of a trivariate homogeneous polynomial of degree eight representability of semialgebraic sets. In [7], Lasserre uses that is convex but not sos-convex. sos-convexity to extend Jensen’s inequality in convex anal- ysis to linear functionals that are not necessarily probability I.
    [Show full text]
  • Subgradients
    Subgradients Ryan Tibshirani Convex Optimization 10-725/36-725 Last time: gradient descent Consider the problem min f(x) x n for f convex and differentiable, dom(f) = R . Gradient descent: (0) n choose initial x 2 R , repeat (k) (k−1) (k−1) x = x − tk · rf(x ); k = 1; 2; 3;::: Step sizes tk chosen to be fixed and small, or by backtracking line search If rf Lipschitz, gradient descent has convergence rate O(1/) Downsides: • Requires f differentiable next lecture • Can be slow to converge two lectures from now 2 Outline Today: crucial mathematical underpinnings! • Subgradients • Examples • Subgradient rules • Optimality characterizations 3 Subgradients Remember that for convex and differentiable f, f(y) ≥ f(x) + rf(x)T (y − x) for all x; y I.e., linear approximation always underestimates f n A subgradient of a convex function f at x is any g 2 R such that f(y) ≥ f(x) + gT (y − x) for all y • Always exists • If f differentiable at x, then g = rf(x) uniquely • Actually, same definition works for nonconvex f (however, subgradients need not exist) 4 Examples of subgradients Consider f : R ! R, f(x) = jxj 2.0 1.5 1.0 f(x) 0.5 0.0 −0.5 −2 −1 0 1 2 x • For x 6= 0, unique subgradient g = sign(x) • For x = 0, subgradient g is any element of [−1; 1] 5 n Consider f : R ! R, f(x) = kxk2 f(x) x2 x1 • For x 6= 0, unique subgradient g = x=kxk2 • For x = 0, subgradient g is any element of fz : kzk2 ≤ 1g 6 n Consider f : R ! R, f(x) = kxk1 f(x) x2 x1 • For xi 6= 0, unique ith component gi = sign(xi) • For xi = 0, ith component gi is any element of [−1; 1] 7 n
    [Show full text]
  • NP-Hardness of Deciding Convexity of Quartic Polynomials and Related Problems
    NP-hardness of Deciding Convexity of Quartic Polynomials and Related Problems Amir Ali Ahmadi, Alex Olshevsky, Pablo A. Parrilo, and John N. Tsitsiklis ∗y Abstract We show that unless P=NP, there exists no polynomial time (or even pseudo-polynomial time) algorithm that can decide whether a multivariate polynomial of degree four (or higher even degree) is globally convex. This solves a problem that has been open since 1992 when N. Z. Shor asked for the complexity of deciding convexity for quartic polynomials. We also prove that deciding strict convexity, strong convexity, quasiconvexity, and pseudoconvexity of polynomials of even degree four or higher is strongly NP-hard. By contrast, we show that quasiconvexity and pseudoconvexity of odd degree polynomials can be decided in polynomial time. 1 Introduction The role of convexity in modern day mathematical programming has proven to be remarkably fundamental, to the point that tractability of an optimization problem is nowadays assessed, more often than not, by whether or not the problem benefits from some sort of underlying convexity. In the famous words of Rockafellar [39]: \In fact the great watershed in optimization isn't between linearity and nonlinearity, but convexity and nonconvexity." But how easy is it to distinguish between convexity and nonconvexity? Can we decide in an efficient manner if a given optimization problem is convex? A class of optimization problems that allow for a rigorous study of this question from a com- putational complexity viewpoint is the class of polynomial optimization problems. These are op- timization problems where the objective is given by a polynomial function and the feasible set is described by polynomial inequalities.
    [Show full text]
  • Subdifferential Properties of Quasiconvex and Pseudoconvex Functions: Unified Approach1
    JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS: Vol. 97, No. I, pp. 29-45, APRIL 1998 Subdifferential Properties of Quasiconvex and Pseudoconvex Functions: Unified Approach1 D. AUSSEL2 Communicated by M. Avriel Abstract. In this paper, we are mainly concerned with the characteriza- tion of quasiconvex or pseudoconvex nondifferentiable functions and the relationship between those two concepts. In particular, we charac- terize the quasiconvexity and pseudoconvexity of a function by mixed properties combining properties of the function and properties of its subdifferential. We also prove that a lower semicontinuous and radially continuous function is pseudoconvex if it is quasiconvex and satisfies the following optimality condition: 0sdf(x) =f has a global minimum at x. The results are proved using the abstract subdifferential introduced in Ref. 1, a concept which allows one to recover almost all the subdiffer- entials used in nonsmooth analysis. Key Words. Nonsmooth analysis, abstract subdifferential, quasicon- vexity, pseudoconvexity, mixed property. 1. Preliminaries Throughout this paper, we use the concept of abstract subdifferential introduced in Aussel et al. (Ref. 1). This definition allows one to recover almost all classical notions of nonsmooth analysis. The aim of such an approach is to show that a lot of results concerning the subdifferential prop- erties of quasiconvex and pseudoconvex functions can be proved in a unified way, and hence for a large class of subdifferentials. We are interested here in two aspects of convex analysis: the charac- terization of quasiconvex and pseudoconvex lower semicontinuous functions and the relationship between these two concepts. 1The author is indebted to Prof. M. Lassonde for many helpful discussions leading to a signifi- cant improvement in the presentation of the results.
    [Show full text]
  • Chapter 5 Convex Optimization in Function Space 5.1 Foundations of Convex Analysis
    Chapter 5 Convex Optimization in Function Space 5.1 Foundations of Convex Analysis Let V be a vector space over lR and k ¢ k : V ! lR be a norm on V . We recall that (V; k ¢ k) is called a Banach space, if it is complete, i.e., if any Cauchy sequence fvkglN of elements vk 2 V; k 2 lN; converges to an element v 2 V (kvk ¡ vk ! 0 as k ! 1). Examples: Let ­ be a domain in lRd; d 2 lN. Then, the space C(­) of continuous functions on ­ is a Banach space with the norm kukC(­) := sup ju(x)j : x2­ The spaces Lp(­); 1 · p < 1; of (in the Lebesgue sense) p-integrable functions are Banach spaces with the norms Z ³ ´1=p p kukLp(­) := ju(x)j dx : ­ The space L1(­) of essentially bounded functions on ­ is a Banach space with the norm kukL1(­) := ess sup ju(x)j : x2­ The (topologically and algebraically) dual space V ¤ is the space of all bounded linear functionals ¹ : V ! lR. Given ¹ 2 V ¤, for ¹(v) we often write h¹; vi with h¢; ¢i denoting the dual product between V ¤ and V . We note that V ¤ is a Banach space equipped with the norm j h¹; vi j k¹k := sup : v2V nf0g kvk Examples: The dual of C(­) is the space M(­) of Radon measures ¹ with Z h¹; vi := v d¹ ; v 2 C(­) : ­ The dual of L1(­) is the space L1(­). The dual of Lp(­); 1 < p < 1; is the space Lq(­) with q being conjugate to p, i.e., 1=p + 1=q = 1.
    [Show full text]