List questions from convex-optimization

Published on 26 Mar 2026 - 12:41

34

Views

Penalty-Approximated solution to quadratic program

Published on 28 Mar 2026 - 22:44

164

Views

Why is it sometimes possible to solve constrained optimization by directly taking the gradient and pretend as if the problem is unconstrained?

Published on 01 Apr 2026 - 7:51

747

Views

How is called a "method" converting a feasibility problem into a standard convex optimization form?

Published on 29 Aug 2019 - 12:51

193

Views

Why does this subgradient identity hold?

Published on 29 Aug 2019 - 14:03

4.7k

Views

Example of when the minimum of two convex functions is not convex

Published on 29 Mar 2026 - 23:25

1.5k

Views

Derivative of the Prox / Proximal Operator

Published on 25 Mar 2026 - 6:02

876

Views

Determine if a set of points in a n dimensional set that are closer to point v1 than to point v2 form a half-space

Published on 30 Aug 2019 - 14:09

6k

Views

Show the level set of a convex function is convex but that the converse is not necessarily true

Published on 31 Aug 2019 - 0:24

41

Views

What linear program characterizes non-infinitesimal perturbations of a linear program?

Published on 31 Aug 2019 - 12:19

321

Views

Can Bayesian Optimization be used in lieu of LP, QP, or MIP?

Published on 29 Mar 2026 - 6:44

157

Views

How to check if the given function/surface has multiple local max or min?

Published on 01 Apr 2026 - 6:04

95

Views

How to write the first order condition for a joint convex function $f(x,y)$, $x\in \mathbb{R}^{n}$ and $y\in \mathbb{R}^{n}$

Published on 01 Sep 2019 - 9:30

775

Views

Gradient Descent inequality lemma

Published on 27 Mar 2026 - 12:28

43

Views

How is it a single variable optimization problem?

Published on 04 Sep 2019 - 18:27

List Question

Given some data, is there a measure of convexity

Penalty-Approximated solution to quadratic program

Why is it sometimes possible to solve constrained optimization by directly taking the gradient and pretend as if the problem is unconstrained?

How is called a "method" converting a feasibility problem into a standard convex optimization form?

Why does this subgradient identity hold?

Example of when the minimum of two convex functions is not convex

Derivative of the Prox / Proximal Operator

Determine if a set of points in a n dimensional set that are closer to point v1 than to point v2 form a half-space

Show the level set of a convex function is convex but that the converse is not necessarily true

What linear program characterizes non-infinitesimal perturbations of a linear program?

Can Bayesian Optimization be used in lieu of LP, QP, or MIP?

How to check if the given function/surface has multiple local max or min?

How to write the first order condition for a joint convex function $f(x,y)$, $x\in \mathbb{R}^{n}$ and $y\in \mathbb{R}^{n}$

Gradient Descent inequality lemma

How is it a single variable optimization problem?

Trending Questions

Popular # Hahtags

Popular Questions