List questions from convex-optimization

Published on 01 Nov 2015 - 18:23

443

Views

Minimum eigenvalue representation

Published on 14 Apr 2026 - 0:19

420

Views

show that a set is convex

Published on 02 Nov 2015 - 14:58

326

Views

Why does the dual problem of the SDP become a maximum eigenvalue problem?

Published on 28 Mar 2026 - 5:02

74

Views

Convex optimization where both the region and function are ugly

Published on 24 Apr 2026 - 3:33

62

Views

Show that $A^{*}\partial g(A\bar{x})\subseteq \partial(g \circ A)(\bar{x})$

Published on 03 Nov 2015 - 3:03

207

Views

The existence of minimizer.

Published on 03 Nov 2015 - 14:42

612

Views

Some True or False questions on Nonlinear Optimisation (Exam Preparation)

Published on 21 Apr 2026 - 15:59

25

Views

Determine $C^{\circ}$ explicity in terms of $A$ and $b$

Published on 03 Nov 2015 - 23:41

300

Views

min-max optimization problem

Published on 28 Mar 2026 - 11:35

507

Views

Compute the support function, $\sigma_{C}$, when $C$ is a subspace.

Published on 11 Apr 2026 - 10:50

86

Views

modeling a set S as a mixed integer linear programming problem

Published on 04 Nov 2015 - 21:39

866

Views

Gordan’s lemma equivalent statement

Published on 04 Nov 2015 - 22:14

74

Views

What does the above simplify into when $f_1$ and $f_2$ are indicator functions of convex subsets $C$ and $D$ of $X$, respectively?

Published on 05 Nov 2015 - 2:20

1k

Views

Derive the dual function $g(\lambda, \nu)$ for the least-norm problem

Published on 03 Apr 2026 - 19:52

List Question

Consider $(f\Box g) (z)=\inf_{x+y=z}(f(x)+f(y))$

Minimum eigenvalue representation

show that a set is convex

Why does the dual problem of the SDP become a maximum eigenvalue problem?

Convex optimization where both the region and function are ugly

Show that $A^{*}\partial g(A\bar{x})\subseteq \partial(g \circ A)(\bar{x})$

The existence of minimizer.

Some True or False questions on Nonlinear Optimisation (Exam Preparation)

Determine $C^{\circ}$ explicity in terms of $A$ and $b$

min-max optimization problem

Compute the support function, $\sigma_{C}$, when $C$ is a subspace.

modeling a set S as a mixed integer linear programming problem

Gordan’s lemma equivalent statement

What does the above simplify into when $f_1$ and $f_2$ are indicator functions of convex subsets $C$ and $D$ of $X$, respectively?

Derive the dual function $g(\lambda, \nu)$ for the least-norm problem

Trending Questions

Popular # Hahtags

Popular Questions