Question

Is there a closed form for $\sup_{f,0\le x\le 1}(1-x)f(x)/\int_0^1f(t)\,\mathrm{d}t$?

score 83 · Answer 1 · 2026-04-15 03:22:53

83

Views

Is there a closed form for $\sup_{f,0\le x\le 1}(1-x)f(x)/\int_0^1f(t)\,\mathrm{d}t$?

Published on 15 Apr 2026 - 3:22

score 100 · Answer 2 · 2026-04-14 21:51:19

100

Views

Is there a closed form for $\inf_{f\in\mathcal{F}}\sup_{0\le x\le 1}(1-x)f(x)/\int_0^1f(t)\,\mathrm{d}t$?

Published on 14 Apr 2026 - 21:51

score 69 · Answer 3 · 2026-03-25 04:35:44

69

Views

Compute component probabilities in EM-algorithm with log densities?

Published on 25 Mar 2026 - 4:35

score 75 · Answer 4 · 2026-04-16 23:32:54

75

Views

Find the minimum of $\space\frac{1}{x}+\frac{1}{y}+c\cdot xy\space$ subject to $\space x+y-c=0$

Published on 16 Apr 2026 - 23:32

score 1k · Answer 5 · 2026-04-10 19:41:52

1k

Views

Corresponding LP problems to zero sum games

Published on 10 Apr 2026 - 19:41

score 262 · Answer 6 · 2026-04-14 05:40:26

262

Views

Relation between sorted weights of spanning tree and minimal spanning tree

Published on 14 Apr 2026 - 5:40

score 1.5k · Answer 7 · 2026-04-09 12:48:26

1.5k

Views

How to prove convexity of an optimization problem?

Published on 09 Apr 2026 - 12:48

score 390 · Answer 8 · 2026-04-12 10:49:53

390

Views

Calculus 1 Courses's Optimization of Pipeline Route Problem, Produces Strangely Complicated Value.

Published on 12 Apr 2026 - 10:49

score 80 · Answer 9 · 2026-04-12 06:12:07

80

Views

Limit and minimization

Published on 12 Apr 2026 - 6:12

score 58 · Answer 10 · 2026-03-26 07:37:37

58

Views

Optimization over a binary (or discrete) variable

Published on 26 Mar 2026 - 7:37

score 100 · Answer 11 · 2026-04-15 14:49:01

100

Views

Boyd & Vandenberghe, exercise 4.4(d)

Published on 15 Apr 2026 - 14:49

score 327 · Answer 12 · 2026-03-25 04:34:57

327

Views

Strict inequality logical implication in optimization problems

Published on 25 Mar 2026 - 4:34

score 129 · Answer 13 · 2026-04-16 12:46:01

129

Views

Dual of the barrier transformed linear program $\min_{x \in \mathbb{R}^n} \left\{ c^T x - \mu \sum_{j=1}^n \log(x_j) : Ax = b; x \geq 0 \right\}$

Published on 16 Apr 2026 - 12:46

score 30 · Answer 14 · 2026-03-25 06:41:01

30

Views

greatest value of function depends on parameter $k$

Published on 25 Mar 2026 - 6:41

score 38 · Answer 15 · 2026-04-12 20:10:32

38

Views

Calculus of Variations Problem with a differential equation : $X'(t)=-aX(t)E(t)$

Published on 12 Apr 2026 - 20:10

List Question

Is there a closed form for $\sup_{f,0\le x\le 1}(1-x)f(x)/\int_0^1f(t)\,\mathrm{d}t$?

Is there a closed form for $\inf_{f\in\mathcal{F}}\sup_{0\le x\le 1}(1-x)f(x)/\int_0^1f(t)\,\mathrm{d}t$?

Compute component probabilities in EM-algorithm with log densities?

Find the minimum of $\space\frac{1}{x}+\frac{1}{y}+c\cdot xy\space$ subject to $\space x+y-c=0$

Corresponding LP problems to zero sum games

Relation between sorted weights of spanning tree and minimal spanning tree

How to prove convexity of an optimization problem?

Calculus 1 Courses's Optimization of Pipeline Route Problem, Produces Strangely Complicated Value.

Limit and minimization

Optimization over a binary (or discrete) variable

Boyd & Vandenberghe, exercise 4.4(d)

Strict inequality logical implication in optimization problems

Dual of the barrier transformed linear program $\min_{x \in \mathbb{R}^n} \left\{ c^T x - \mu \sum_{j=1}^n \log(x_j) : Ax = b; x \geq 0 \right\}$

greatest value of function depends on parameter $k$

Calculus of Variations Problem with a differential equation : $X'(t)=-aX(t)E(t)$

Trending Questions

Popular # Hahtags

Popular Questions