Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

I am reading "Convex Optimization" by Stephen Boyd. He is using a curved greater than and curved less than equal to signs.

$f(x^*) \succcurlyeq \alpha$

or

$f(x*) \preccurlyeq \alpha$

Can someone explain or point me to their meaning.

share|improve this question
2  
as () is curved and {} are curly ( en.wikipedia.org/wiki/Bracket ), I think those symbols you mention are curved not curly –  barlop Feb 9 at 6:43
3  
@barlop If you look at $\LaTeX$ source of the formulas in question (right click->Show Math As->TeX commands), you'll see \succcurlyeq, which has curly word in it, not curved. –  Ruslan Feb 9 at 7:18
    
Thanks everyone for answers. As I understand $\succeq$ or $\preceq$ are more general than their more popular counterparts. I think Michael's answer make sense. If I understand correctly, $ X \succeq Y, \quad if \quad \| X \| \ge \| Y \| $ where $\| \cdot \|$ is the norm associated with the space $X$ and $Y$ belongs to. I think Chris's answer is correct but is more strict condition than Michael's answer. Please correct me if I'm wrong. –  Dinesh K. Feb 9 at 17:53
    
You should definitely take the tour. This is not a traditional forum! –  canaaerus Feb 9 at 18:03
    
Well I don't know what a traditional forum looks like. :-) –  Dinesh K. Feb 9 at 18:20
add comment

3 Answers

There's a list of notation in the back of the book. On page 698, $x\preceq y$ is defined as componentwise inequality between vectors $x$ and $y$. This means that $x_i\leq y_i$ for every index $i$.

Edit: The notation is introduced on page 32.

share|improve this answer
add comment

Both Chris Culter's and Code Guru's answers are good, and I've voted them both up. I hope that I'm not being inappropriate by combining and expanding upon them here.

It should be noted that the book does not use $\succeq$, $\preceq$, $\succ$, and $\prec$ with scalar inequalities; for these, good old-fashioned inequality symbols suffice. It is only when the quantities on the left- and right-hand sides are vectors, matrices, or other multi-dimensional objects that this notation is called for.

The book refers to these relations as generalized inequalities, but as Code-Guru rightly points out, they have been in use for some time to represent partial orderings. And indeed, that's exactly what they are, and the book does refer to them that way as well. But given that the text deals with convex optimization, it was apparently considered helpful to refer to them as inequalities.

Let $S$ be a vector space, and let $K\subset S$ be a closed, convex, and pointed cone with a non-empty interior. (By cone, we mean that $\alpha K\equiv K$ for all $\alpha>0$; and by pointed, we mean that $K\cap-K=\{0\}$.) Such a cone $K$ induces a partial ordering on the set $S$, and an associated set of generalized inequalities: $$ x \succeq_K y \quad\Longleftrightarrow\quad y \preceq_K x \quad\Longleftrightarrow\quad x - y \in K $$ $$ x \succ_K y \quad\Longleftrightarrow\quad y \prec_K x \quad\Longleftrightarrow\quad x - y \in \mathop{\textrm{Int}} K $$ This is a partial ordering because, for many pairs $x,y\in S$, $x \not\succeq_K y$ and $y \not\succeq_K x$. So that's the primary reason why he and others prefer to use the curly inequalities to denote these orderings, reserving $\geq$, $\leq$, etc. for total orderings. But it has many of the properties of a standard inequality, such as: $$x\succeq_K y \quad\Longrightarrow\quad \alpha x \succeq_K \alpha y \quad\forall \alpha>0$$ $$x\succeq_K y \quad\Longrightarrow\quad \alpha x \preceq_K \alpha y \quad\forall \alpha<0$$ $$x\succeq_K y, ~ x\preceq_K y \quad\Longrightarrow\quad x=y$$ $$x\succ_K y \quad\Longrightarrow\quad x\not\prec_K y$$

When the cone $K$ is understood from context, it is often dropped, leaving only the inequality symbol $\succeq$. There are two cases where this is almost always done. First, when $S=\mathbb{R}^n$ and the cone $K$ is non-negative orthant $\mathbb{R}^n_+$ the generalized inequality is simply an elementwise inequality: $$x \succeq_{\mathbb{R}^n_+} y \quad\Longleftrightarrow\quad x_i\geq y_i,~i=1,2,\dots,n$$ Second, when $S$ is the set of symmetric $n\times n$ matrices and $K$ is the cone of positive semidefinite matrices $\mathcal{S}^n_+=\{X\in S\,|\,\lambda_{\text{min}}(X)\geq 0\}$, the inequality is a linear matrix inequality (LMI): $$X \succeq_{\mathcal{S}^n_+} Y \quad\Longleftrightarrow\quad \lambda_{\text{min}}(X-Y)\geq 0$$ In both of these cases, the cone subscript is almost always dropped.

Many texts in convex optimization don't bother with this distinction, and use $\geq$ and $\leq$ even for LMIs and other partial orderings. I prefer to use it whenever I can, because I think it helps people realize that this is not a standard inequality with an underlying total order. That said, I don't feel that strongly about it for $\mathbb{R}^n_+$; I think most people rightly assume that $x\geq y$ is considered elementwise when $x,y$ are vectors.

share|improve this answer
    
Thanks a lot for the detailed answer, and for correcting the symbol as well :-). –  Dinesh K. Feb 9 at 16:35
add comment

Often these symbols represent partial order relations. The typical "less than" and "greater than" operations both define partial orders on the real numbers. However, there are many other examples of partial orders.

share|improve this answer
add comment

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.