# Quasi-convex function must be "partially monotonic"?

Operations Research Asked by High GPA on December 13, 2020

$$f(x)$$ is quasi-convex,

$$x^*inargmin_{xin C}f(x).$$

How to prove that, for any $$ain C$$, $$f(x)$$ is weakly monotonic in the direction of $$(x^*-a)$$?

Is this simple result a part of an ancient theorem?

By the definition of quasiconvex: $$f(x)$$ with compact support $$C$$ is quasiconvex if for two points in the domain $$x_1,x_2$$ and $$win[0,1]$$ $$f(wx_1+(1-w)x_2)geq max{f(x_1),f(x_2)}$$.

Let $$x^* = argmin_{xin C}f(x)$$ where $$C$$ is the compact support of $$f$$. Then consider $$x_1,x_2in [x^*,infty)$$.

Choose $$x_2>x_1$$. By the definition of quasiconvexity, the secant segment from $$(x_1,f(x_1))$$ to $$(x_2,f(x_2))$$ lies below or at the maximum of the segment endpoints $${f(x_1),f(x_2)}$$. Since $$x^*$$ is a global minimizer, we can choose $$x_1=x^*$$ which implies the right limit inequality:

$$lim_{x_2downarrow x_1} f(wx_1+(1-w)x_2)-f(x_1)geq max{0,f(x_2)-f(x_1)}~forall win[0,1].$$ Thus the right derivative is non-negative. This then holds for all $$x_1geq x^*$$. Thus $$f$$ is weakly monotone increasing on $$[x^*,infty)$$.

We can do likewise for $$x_1,x_2in(-infty,x^*]$$ using left limits and show that $$f$$ is weakly monotone decreasing on $$(-infty,x^*]$$.

Correct answer by kurtosis on December 13, 2020

## Related Questions

### Conditions required for strong duality to hold for SDPs

1  Asked on August 19, 2021

### Relationship between extreme points and optimal solutions of SDPs

1  Asked on August 19, 2021

### How to parallelize metaheuristics algorithms (Island Model)?

1  Asked on August 19, 2021 by antarctica

### Can we get closed form solution for such a problem?

1  Asked on August 19, 2021

### Can we use reinforcement learning and convex optimization to solve an optimization problem?

2  Asked on August 19, 2021 by qinqinxiaoguai

### Nonlinear integer (0/1) programming solver

6  Asked on March 1, 2021 by rajya

### How can I find the shortest path for all nodes in a graph from a source $s$?

1  Asked on March 1, 2021 by windbreeze

### Free solver for MINP problems

1  Asked on February 18, 2021 by dspinfinity

### Where I can study some job shop scheduling by course (video )?

0  Asked on February 18, 2021 by yue-chao

### Linear objective function with power term in constraint

1  Asked on February 15, 2021 by user152503

### Formulating these logical constraint in an ILP

1  Asked on January 18, 2021

### Modeling the multiplication of two binary decision variables in undirected graph in python

0  Asked on January 18, 2021 by amedeo

### Flexible Job Shop with Preemption

0  Asked on January 15, 2021 by robert-hildebrand

### How to handle an equality constraint in metaheuristic algorithms (like GA, PSO)?

3  Asked on January 11, 2021 by stevgates

### What is the difference between min- cut formulation and (bi) partitioning formulation?

1  Asked on January 8, 2021 by fathese

### Logical constraint in ILP

1  Asked on December 22, 2020 by che

### Quasi-convex function must be “partially monotonic”?

1  Asked on December 13, 2020 by high-gpa

### Constraint programming resources

3  Asked on November 28, 2020 by joffrey-l

### Pyomo variable creation dilemma

1  Asked on October 31, 2020 by ethan-deakins

### Convexity of the variance of a mixture distribution

1  Asked on September 25, 2020 by independentvariable