Question

Is $C=\left\{ \left(x,y,z\right)^{T}\mid xyz\geq1,\sqrt{xy}\geq z,x>0,y>0,z>0\right\} $ is a convex set?

score 322 · Answer 1 · 2020-04-29 13:44:53

322

Views

Is $C=\left\{ \left(x,y,z\right)^{T}\mid xyz\geq1,\sqrt{xy}\geq z,x>0,y>0,z>0\right\} $ is a convex set?

Published on 29 Apr 2020 - 13:44

score 421 · Answer 2 · 2020-04-28 18:56:52

421

Views

Solving Quadratic Matrix Programming (Trace of a Vector Multiplication) with Boundary Constraints

Published on 28 Apr 2020 - 18:56

score 37 · Answer 3 · 2026-03-27 02:34:16

37

Views

Geometric interpretation of how function lower bounds aid gradient descent

Published on 27 Mar 2026 - 2:34

score 73 · Answer 4 · 2026-04-03 03:24:16

73

Views

max decomposition

Published on 03 Apr 2026 - 3:24

score 366 · Answer 5 · 2026-04-03 03:27:20

366

Views

Is the difference of a convex function and a strictly convex function convex?

Published on 03 Apr 2026 - 3:27

score 48 · Answer 6 · 2026-03-27 05:37:56

48

Views

"Batchwise" least squares with smoothness in row direction as extra objective

Published on 27 Mar 2026 - 5:37

score 53 · Answer 7 · 2026-03-26 00:49:20

53

Views

Let $f(x,y)=\left(\frac{1}{2}x^{T}Qx\right)\left(\frac{1}{2}y^{T}Ry\right)$.given $g(x)=f(x,x)$ not convex.does $f$ convex?

Published on 26 Mar 2026 - 0:49

score 526 · Answer 8 · 2026-04-03 00:59:01

526

Views

Can Shortest Path Problems Solved Faster as Network Flow LP Than Dijkstra

Published on 03 Apr 2026 - 0:59

score 72 · Answer 9 · 2026-03-25 20:39:47

72

Views

Corner Solution To A Recursive, Strictly Concave Function?

Published on 25 Mar 2026 - 20:39

score 887 · Answer 10 · 2026-04-06 03:32:48

887

Views

What did Nemirovski and Yudin actually do in their 1978 article problem complexity and method efficiency in optimization?

Published on 06 Apr 2026 - 3:32

score 63 · Answer 11 · 2026-02-23 05:19:16

63

Views

Geometric program with reciprocal objective function

Published on 23 Feb 2026 - 5:19

score 50 · Answer 12 · 2026-03-27 05:04:45

50

Views

Which calculation is easier for a computer?

Published on 27 Mar 2026 - 5:04

score 273 · Answer 13 · 2026-03-25 13:54:41

273

Views

subgradient and subdifferential at the boundary of a closed set for discontinuous function.

Published on 25 Mar 2026 - 13:54

score 27 · Answer 14 · 2020-05-06 06:57:23

27

Views

Find a finite set $S$ that a point in $S$ can be represented as convex combination of $n+1$ points in $S$

Published on 06 May 2020 - 6:57

score 49 · Answer 15 · 2020-05-06 08:11:37

49

Views

Dual of a function $f$

Published on 06 May 2020 - 8:11

List Question

Is $C=\left\{ \left(x,y,z\right)^{T}\mid xyz\geq1,\sqrt{xy}\geq z,x>0,y>0,z>0\right\} $ is a convex set?

Solving Quadratic Matrix Programming (Trace of a Vector Multiplication) with Boundary Constraints

Geometric interpretation of how function lower bounds aid gradient descent

max decomposition

Is the difference of a convex function and a strictly convex function convex?

"Batchwise" least squares with smoothness in row direction as extra objective

Let $f(x,y)=\left(\frac{1}{2}x^{T}Qx\right)\left(\frac{1}{2}y^{T}Ry\right)$.given $g(x)=f(x,x)$ not convex.does $f$ convex?

Can Shortest Path Problems Solved Faster as Network Flow LP Than Dijkstra

Corner Solution To A Recursive, Strictly Concave Function?

What did Nemirovski and Yudin actually do in their 1978 article problem complexity and method efficiency in optimization?

Geometric program with reciprocal objective function

Which calculation is easier for a computer?

subgradient and subdifferential at the boundary of a closed set for discontinuous function.

Find a finite set $S$ that a point in $S$ can be represented as convex combination of $n+1$ points in $S$

Dual of a function $f$

Trending Questions

Popular # Hahtags

Popular Questions