Newbetuts

How to minimize $\sum_{i=1}^p (y_i-x_i)^2$ with constraints $\sum_{i=1}^p y_i - 1 =0$ and $\forall i=\overline{1,p}:-y_i \le 0$?

Linear Least Square Optimization with Linear Equality Constraints

Conjugates of norms

How to Project onto the Unit Simplex as Intersection of Two Sets (Optimizing a Convex Function)?

Examples of $f$ strictly convex, either with one minimizer or with no minimizer.

How to change $\min \|Ax-b\|_1 $, where $x$ is free, to standard form?

Difference between Gradient Descent method and Steepest Descent

How to convert the matrix completion problem to the standard SDP form?

Machine Learning: Is the softmax function Lipschitz with Lipschitz constant $1$?

maximize $\sum_{A\subseteq [q], A\neq \emptyset} \alpha_A \log(|A|)$ with nonlinear constraints

Subgradients of non-convex functions

Is a convex function always twice differentiable?

Help me organize these concepts -- KKT conditions and dual problem

A minimization problem in function fitting setup

Can every semidefinite program be solved in polynomial time?

Convexity, Hessian matrix, and positive semidefinite matrix

New posts in convex-optimization

Why does a positive definite matrix defines a convex cone?

Is the product of strictly quasiconcave functions quasiconcave?

Equality Constrained Non Negative Linear Least Squares (Unit Simplex Constraint)

Explicit solution of an QCLP

How to minimize $\sum_{i=1}^p (y_i-x_i)^2$ with constraints $\sum_{i=1}^p y_i - 1 =0$ and $\forall i=\overline{1,p}:-y_i \le 0$?

Linear Least Square Optimization with Linear Equality Constraints

Conjugates of norms

How to Project onto the Unit Simplex as Intersection of Two Sets (Optimizing a Convex Function)?

Examples of $f$ strictly convex, either with one minimizer or with no minimizer.

How to change $\min \|Ax-b\|_1 $, where $x$ is free, to standard form?

Difference between Gradient Descent method and Steepest Descent

How to convert the matrix completion problem to the standard SDP form?

Machine Learning: Is the softmax function Lipschitz with Lipschitz constant $1$?

maximize $\sum_{A\subseteq [q], A\neq \emptyset} \alpha_A \log(|A|)$ with nonlinear constraints

Subgradients of non-convex functions

Is a convex function always twice differentiable?

Help me organize these concepts -- KKT conditions and dual problem

A minimization problem in function fitting setup

Can every semidefinite program be solved in polynomial time?

Convexity, Hessian matrix, and positive semidefinite matrix