Question

Does ADMM promise to converge if there are binary variables in each agent's constraints?

score 267 · Answer 1 · 2022-04-18 13:21:18

267

Views

Does ADMM promise to converge if there are binary variables in each agent's constraints?

Published on 18 Apr 2022 - 13:21

score 40 · Answer 2 · 2022-04-21 06:16:32

40

Views

Lagrangian formulation of an optimization problem

Published on 21 Apr 2022 - 6:16

score 87 · Answer 3 · 2026-03-26 12:34:55

87

Views

Large number of absolute value expressions in constrained, non-convex optimization problem

Published on 26 Mar 2026 - 12:34

score 679 · Answer 4 · 2022-04-25 18:25:35

679

Views

how to show that the quadratic function strongly convex iff A positive definite and parameter min eigenvalue?

Published on 25 Apr 2022 - 18:25

score 123 · Answer 5 · 2026-02-23 02:33:26

123

Views

Algorithms/Solvers for Hard Constrained Non-Linear Optimization Problems - Model Predictive Control Example

Published on 23 Feb 2026 - 2:33

score 376 · Answer 6 · 2026-03-25 21:46:24

376

Views

Proximal operator for an $L$-smooth but nonconvex function

Published on 25 Mar 2026 - 21:46

score 61 · Answer 7 · 2022-05-19 20:24:40

61

Views

Non-convex optimization problem

Published on 19 May 2022 - 20:24

score 37 · Answer 8 · 2026-03-26 07:57:14

37

Views

Parametrically enlarge one ellipsoid to fit another one

Published on 26 Mar 2026 - 7:57

score 62 · Answer 9 · 2022-05-23 23:20:15

62

Views

Example of local convergence to a global optimum for nonconvex gradient descent

Published on 23 May 2022 - 23:20

score 75 · Answer 10 · 2022-05-26 13:49:40

75

Views

Why reformulate composite optimization using equality constraints?

Published on 26 May 2022 - 13:49

score 330 · Answer 11 · 2026-03-25 14:23:39

330

Views

why gradient descent does not always land at the global minimum closest to the starting point?

Published on 25 Mar 2026 - 14:23

score 80 · Answer 12 · 2022-05-28 08:36:19

80

Views

Minimize $Q(t,s) = \mathbf{w}^\top \begin{pmatrix} r(t, t) & -r(t, s) \\ -r(t,s) & r(s, s) \end{pmatrix}^{-1} \mathbf{w}$ in $(t, s)$

Published on 28 May 2022 - 8:36

score 244 · Answer 13 · 2026-03-25 06:07:19

244

Views

Subgradient method for nonconvex nonsmooth function

Published on 25 Mar 2026 - 6:07

score 79 · Answer 14 · 2026-02-23 10:43:38

79

Views

How to transform two non-convex problems to convex problems?

Published on 23 Feb 2026 - 10:43

score 36 · Answer 15 · 2022-06-01 15:20:49

36

Views

Simple non convex optimization

Published on 01 Jun 2022 - 15:20

List Question

Does ADMM promise to converge if there are binary variables in each agent's constraints?

Lagrangian formulation of an optimization problem

Large number of absolute value expressions in constrained, non-convex optimization problem

how to show that the quadratic function strongly convex iff A positive definite and parameter min eigenvalue?

Algorithms/Solvers for Hard Constrained Non-Linear Optimization Problems - Model Predictive Control Example

Proximal operator for an $L$-smooth but nonconvex function

Non-convex optimization problem

Parametrically enlarge one ellipsoid to fit another one

Example of local convergence to a global optimum for nonconvex gradient descent

Why reformulate composite optimization using equality constraints?

why gradient descent does not always land at the global minimum closest to the starting point?

Minimize $Q(t,s) = \mathbf{w}^\top \begin{pmatrix} r(t, t) & -r(t, s) \\ -r(t,s) & r(s, s) \end{pmatrix}^{-1} \mathbf{w}$ in $(t, s)$

Subgradient method for nonconvex nonsmooth function

How to transform two non-convex problems to convex problems?

Simple non convex optimization

Trending Questions

Popular # Hahtags

Popular Questions