Question

Show that at least half of all graphs on n vertices are connected.

score 111 · Answer 1 · 2026-04-14 18:41:26

111

Views

Show that at least half of all graphs on n vertices are connected.

Published on 14 Apr 2026 - 18:41

score 384 · Answer 2 · 2026-04-08 18:54:48

384

Views

Optimizing linear combination of logarithmic functions

Published on 08 Apr 2026 - 18:54

score 938 · Answer 3 · 2026-04-12 01:44:47

938

Views

What does it mean to call a constraint concave?

Published on 12 Apr 2026 - 1:44

score 73 · Answer 4 · 2026-04-17 04:01:36

73

Views

Solving $\min_{\Phi} \sum_i \| zero\_diag (\Phi^T A_i \Phi) \|_F^2 s.t. \Phi^T \Phi = I$

Published on 17 Apr 2026 - 4:01

score 63 · Answer 5 · 2026-04-13 02:06:12

63

Views

How to solve a simple non-linear optimisation problem in order to find the minimum point in a hyperbola?

Published on 13 Apr 2026 - 2:06

score 73 · Answer 6 · 2026-04-10 01:25:42

73

Views

Unifying Optimal Control Problems through Constraint Optimization Problems.

Published on 10 Apr 2026 - 1:25

score 168 · Answer 7 · 2026-03-25 07:47:34

168

Views

LMI-based versus standard form semidefinite programs

Published on 25 Mar 2026 - 7:47

score 268 · Answer 8 · 2026-03-26 02:46:55

268

Views

KKT conditions for min-cost flow QP

Published on 26 Mar 2026 - 2:46

score 62 · Answer 9 · 2026-03-26 12:41:02

62

Views

Optimal approximation of nonlinear probability density function by piecewise constant density

Published on 26 Mar 2026 - 12:41

score 61 · Answer 10 · 2026-04-15 22:19:58

61

Views

$f(\lambda) = max\left \{ (c + D\lambda)^{t}x : x \in P \right \}$. is convex.

Published on 15 Apr 2026 - 22:19

score 235 · Answer 11 · 2026-03-26 03:00:23

235

Views

Unobserved values in SVD and matrix factorization problems

Published on 26 Mar 2026 - 3:00

score 180 · Answer 12 · 2026-04-15 20:16:48

180

Views

If $y = cx^2$ for $c>0$ and $0 \leq x \leq 1$, what is the largest possible area of the rectangle?

Published on 15 Apr 2026 - 20:16

score 279 · Answer 13 · 2026-04-14 02:54:25

279

Views

Maximizing sum of polynomials of degree 3

Published on 14 Apr 2026 - 2:54

score 1k · Answer 14 · 2026-04-12 00:34:24

1k

Views

Using Kuhn-Tucker to determine if constraint is binding

Published on 12 Apr 2026 - 0:34

score 133 · Answer 15 · 2026-04-11 03:30:28

133

Views

how do we rewrite the sum of two function to multiplication of them,and write the quadratic equation formula without seeing the quadratic equation

Published on 11 Apr 2026 - 3:30

List Question

Show that at least half of all graphs on n vertices are connected.

Optimizing linear combination of logarithmic functions

What does it mean to call a constraint concave?

Solving $\min_{\Phi} \sum_i \| zero\_diag (\Phi^T A_i \Phi) \|_F^2 s.t. \Phi^T \Phi = I$

How to solve a simple non-linear optimisation problem in order to find the minimum point in a hyperbola?

Unifying Optimal Control Problems through Constraint Optimization Problems.

LMI-based versus standard form semidefinite programs

KKT conditions for min-cost flow QP

Optimal approximation of nonlinear probability density function by piecewise constant density

$f(\lambda) = max\left \{ (c + D\lambda)^{t}x : x \in P \right \}$. is convex.

Unobserved values in SVD and matrix factorization problems

If $y = cx^2$ for $c>0$ and $0 \leq x \leq 1$, what is the largest possible area of the rectangle?

Maximizing sum of polynomials of degree 3

Using Kuhn-Tucker to determine if constraint is binding

how do we rewrite the sum of two function to multiplication of them,and write the quadratic equation formula without seeing the quadratic equation

Trending Questions

Popular # Hahtags

Popular Questions