# Questions tagged [convexity]

For questions related to convex functions and convex sets, especially as they relate to optimization problems.

59 questions
Filter by
Sorted by
Tagged with
98 views

### Convexity of p power of the q norm (0<p<1, q>1)

I encountered a minimization problem involving the following function: $f(\mathbf{x})=\|\mathbf{x}\|_q^p$ Here, $q>1$ and $0<p<1$. Naturally, each entry of $\mathbf{x}$ is greater than $0$. I ...
127 views

598 views

### Is upper incomplete gamma function convex?

Considering the definition of upper incomplete gamma function: $\Gamma(a, x) =$ $\int_{x}^{\infty}t^{a-1}e^{-t} dt$ Given that $a$ is fixed and $0 < x < a$, can we prove the function is convex ...
90 views

### On a clarification on usage of inequalities in convex programming

The inequality $x^3\leq y$ is not convex. But $0<x$ added to the above provides a convex region. My question is whether in convex programming it is allowed to use both inequalities together and use ...
110 views

### Convex not strictly convex!

Update: Linear programming problems (LP) have a convex space, precisely vector space, such as a convex feasible region as pointed out by @prubin. Also, they may have either unique or multiple ...
63 views

### FOC point vs Stationary point in local optimization

In this SIAM Review paper the authors are giving the following necessary condition for a point being a local maximum of a convex function: Let $F: \mathbb{R}^n \mapsto \mathbb{R}$ be convex. If $x$ ...
88 views

1 vote
113 views

### Find a dual problem with one dual decision variable to the problem of finding the orthogonal projection of a given vector

Given the set $T_{\alpha}=\{x\in\mathbb{R}^n:\sum x_i=1,0\leq x_i\leq \alpha\}$ For which $\alpha$ the set is non-empty? Find a dual problem with one dual decision variable to the problem of finding ...
130 views

232 views

330 views

### Solving convex programs defined by separation oracles?

General question: What software can solve convex programs defined by a separation oracle? The objective function is concave, and the feasible set is a polytope. By a separation oracle I mean that I ...
1k views

### Is This Constraint Convex?

I have a constraint that I believe to be convex and not affine which I think means that I can implement a relaxation. I will first define the full constraint, and then build up my (informal) reasoning ...
503 views

### Convexity of a QP

In quadratic programming (QP), you encounter an objective of the following form: $$x^TQx + c^Tx$$ and often it's desirable to know if the QP is convex. One method to check for convexity is by ...
734 views

### Examples of problems with non-convex constraint functions but convex feasible region

I'm looking for examples of (classes of) problems with a non-convex, non-linear formulation, but convex feasible region. That is, a problem of the sort:  \begin{array}{lll} \text{minimize} & ...
596 views

### Dedicated solver for convex problems

Are you aware of a fast solver (open source or commercial) for convex NLPs that is faster than IPOPT? I'm interested in problems in the 50K+ variable range, both dense and sparse. Ideally, it would be ...
6k views

### Can an integer optimization problem be convex?

I'm trying to wrap my head around an apparent paradox that I've come across while trying to learn more about optimization algorithms: On one hand several sources state that convex optimization is ...
$X$ is a discrete random variable taking value $x_n$ with probability $1/N$ for $n=1, \ldots,N$. I would like to set the $x_n$ values in an optimization problem. My objective is to minimize the ...