Newbetuts

Convex function is proper when it has at least one finite value in the relative interior of its effective domain

A (mathematically) sound investment strategy

mathematical optimization library for Java --- free or open source recommendations? [closed]

convexity of matrix "soft-max" (log trace of matrix exponential)

On the convexity of element-wise norm 1 of the inverse

Proof of the Moreau Decomposition Property of Proximal Operators

the dual of the dual is the primal?

Strong convexity and Lipschitz

Why is $\text{maximize} \frac{1}{\lVert x \rVert}$ equivalent to $\text{minimize}\ \lVert x \rVert^2$?

Geometric interpretation of duality and Slater's condition

Show that if a convex $C$ has a supporting hyperplane at every point of its boundary, then it's convex

Convert Semidefinite program forms

sufficient condition for KKT problems

Proving $x^4$ is strictly convex

Quasi-newton methods: Understanding DFP updating formula

Minimize a Quadratic Cost Function on the Unit Simplex

Minimize area of n-gon circumscribed around unit circle

New posts in convex-optimization

Newton's method vs. gradient descent with exact line search

Maximum number of Q-orthogonal vectors

What Numerical Methods Are Known to Solve $ {L}_{1} $ Regularized Quadratic Programming Problems?

Convex function is proper when it has at least one finite value in the relative interior of its effective domain

A (mathematically) sound investment strategy

mathematical optimization library for Java --- free or open source recommendations? [closed]

convexity of matrix "soft-max" (log trace of matrix exponential)

On the convexity of element-wise norm 1 of the inverse

Proof of the Moreau Decomposition Property of Proximal Operators

the dual of the dual is the primal?

Strong convexity and Lipschitz

Why is $\text{maximize} \frac{1}{\lVert x \rVert}$ equivalent to $\text{minimize}\ \lVert x \rVert^2$?

Geometric interpretation of duality and Slater's condition

Show that if a convex $C$ has a supporting hyperplane at every point of its boundary, then it's convex

Convert Semidefinite program forms

sufficient condition for KKT problems

Proving $x^4$ is strictly convex

Quasi-newton methods: Understanding DFP updating formula

Minimize a Quadratic Cost Function on the Unit Simplex

Minimize area of n-gon circumscribed around unit circle