List questions from convex-optimization

Published on 14 Apr 2026 - 14:16

1.1k

Views

Subgradients of non-convex functions

Published on 22 Apr 2016 - 18:38

349

Views

Coordinate descent with equality and inequality constraints

Published on 07 Apr 2026 - 17:47

107

Views

Convexify $x\le a+by^2$

Published on 29 Mar 2026 - 16:56

547

Views

How to deal with an $xy\le 1$ constraint?

Published on 29 Mar 2026 - 16:49

506

Views

Converting generic linear problems into their dual

Published on 12 Apr 2026 - 2:23

315

Views

On Boyd et al.'s convergence analysis of ADMM: Why do we need the convexity assumption?

Published on 15 Apr 2026 - 9:05

192

Views

Optimization of approximate functions using varying objective function

Published on 10 Apr 2026 - 13:16

605

Views

Why is the Barycenter operation in Hadamard spaces Lipschitz continuous?

Published on 25 Mar 2026 - 19:04

116

Views

Can a linear program be optimal if its basis is infeasible?

Published on 10 Apr 2026 - 20:36

90

Views

linear Regression Simplification

Published on 11 Apr 2026 - 3:17

28

Views

$\max\{c^Tx:Ax\le b,x\ge 0\}=+\infty$ iif it exists $j\in\{1,...,n\}$ such that $\max \{x_j:Ax\le b, x\ge 0\}=+\infty$

Published on 16 Apr 2026 - 6:40

142

Views

Maximum concyclic points

Published on 14 Apr 2026 - 4:06

579

Views

Variational inequality and saddle point problem

Published on 14 Apr 2026 - 7:57

26

Views

Why this problem is unbounded, even though it's dual is feasible?

Published on 13 Apr 2026 - 16:26

List Question

Solving a linear program thanks to complementary slackness theorem

Subgradients of non-convex functions

Coordinate descent with equality and inequality constraints

Convexify $x\le a+by^2$

How to deal with an $xy\le 1$ constraint?

Converting generic linear problems into their dual

On Boyd et al.'s convergence analysis of ADMM: Why do we need the convexity assumption?

Optimization of approximate functions using varying objective function

Why is the Barycenter operation in Hadamard spaces Lipschitz continuous?

Can a linear program be optimal if its basis is infeasible?

linear Regression Simplification

$\max\{c^Tx:Ax\le b,x\ge 0\}=+\infty$ iif it exists $j\in\{1,...,n\}$ such that $\max \{x_j:Ax\le b, x\ge 0\}=+\infty$

Maximum concyclic points

Variational inequality and saddle point problem

Why this problem is unbounded, even though it's dual is feasible?

Trending Questions

Popular # Hahtags

Popular Questions