Question

Is it possible to check polytope containment by only checking the feasibility of an LP?

score 850 · Answer 1 · 2026-04-08 22:28:54

850

Views

Is it possible to check polytope containment by only checking the feasibility of an LP?

Published on 08 Apr 2026 - 22:28

score 191 · Answer 2 · 2026-03-27 00:09:42

191

Views

Prove duallity of sparse convex optimization problem

Published on 27 Mar 2026 - 0:09

score 183 · Answer 3 · 2026-04-04 01:55:34

183

Views

What is the dual function of the $f(x) = \sum_i x_i \ln(x_i)$?

Published on 04 Apr 2026 - 1:55

score 234 · Answer 4 · 2026-04-01 00:09:42

234

Views

Taking FOC in the derivation of the LASSO estimator

Published on 01 Apr 2026 - 0:09

score 98 · Answer 5 · 2026-03-27 22:59:39

98

Views

Can this be changed to a convex problem?

Published on 27 Mar 2026 - 22:59

score 315 · Answer 6 · 2017-01-16 03:37:27

315

Views

What is the minimum of a sum of functions, each of which is the Max of a quadratic and zero?

Published on 16 Jan 2017 - 3:37

score 519 · Answer 7 · 2017-01-16 05:13:41

519

Views

Why are $\nabla f(x^)+A^T\nu^=0$ called the "dual feasibility equations"?

Published on 16 Jan 2017 - 5:13

score 535 · Answer 8 · 2026-03-26 02:52:12

535

Views

Solving an optimization with Bisection algorithm

Published on 26 Mar 2026 - 2:52

score 89 · Answer 9 · 2026-03-31 10:12:45

89

Views

Set Containment

Published on 31 Mar 2026 - 10:12

score 257 · Answer 10 · 2017-01-17 17:29:43

257

Views

Usefulness of dual variables in ADMM

Published on 17 Jan 2017 - 17:29

score 1.1k · Answer 11 · 2026-03-25 18:24:42

1.1k

Views

How to convert the L1 optimization problem to interior method using primal and dual (path following algorithm)?

Published on 25 Mar 2026 - 18:24

score 523 · Answer 12 · 2017-01-19 08:05:16

523

Views

Equivalence of Block Coordinate Descent (BCD) and Block Coordinate Gradient Descent (BCGD) for the Quadratic Case

Published on 19 Jan 2017 - 8:05

score 1.4k · Answer 13 · 2026-03-25 11:26:00

1.4k

Views

Minimize trace($MX$) with $M$ rank-deficient and $X$ positive semidefinite

Published on 25 Mar 2026 - 11:26

score 238 · Answer 14 · 2026-03-29 00:06:28

238

Views

Convex function with rapidly changing Hessian, or non-continuous Hessian

Published on 29 Mar 2026 - 0:06

score 26 · Answer 15 · 2017-01-20 15:28:37

26

Views

State uniqueness of a max of an integral function.

Published on 20 Jan 2017 - 15:28

List Question

Is it possible to check polytope containment by only checking the feasibility of an LP?

Prove duallity of sparse convex optimization problem

What is the dual function of the $f(x) = \sum_i x_i \ln(x_i)$?

Taking FOC in the derivation of the LASSO estimator

Can this be changed to a convex problem?

What is the minimum of a sum of functions, each of which is the Max of a quadratic and zero?

Why are $\nabla f(x^)+A^T\nu^=0$ called the "dual feasibility equations"?

Solving an optimization with Bisection algorithm

Set Containment

Usefulness of dual variables in ADMM

How to convert the L1 optimization problem to interior method using primal and dual (path following algorithm)?

Equivalence of Block Coordinate Descent (BCD) and Block Coordinate Gradient Descent (BCGD) for the Quadratic Case

Minimize trace($MX$) with $M$ rank-deficient and $X$ positive semidefinite

Convex function with rapidly changing Hessian, or non-continuous Hessian

State uniqueness of a max of an integral function.

Trending Questions

Popular # Hahtags

Popular Questions