Skip to main content
added 23 characters in body
Source Link

The problem I want to solve has this form:the following optimization problem in variables $\theta_1, \theta_2, \dots, \theta_K$

\begin{equation} \begin{aligned} & \underset{\theta}{\text{minimize}} & & \sum_{k=1}^{K} \|g_k - \theta_k\|_2^2 \\ & \text{subject to} & & \| \theta_m - \theta_l \|_2^2 \leq \| x_m - x_l \|_2^2 , \quad 1 \leq m < l \leq K, \end{aligned} \end{equation}

($\theta_i$ are the variables to optimize over; where $x_i$ and $g_i$ are constants;constants and $\|.\|_2$ stands for$\| \cdot \|_2$ denotes the Euclidean norm).

Is there any closed-form for arbitrary $K$? Or an appropriate first-order iterative method which yields an approximate solution?

The problem I want to solve has this form:

\begin{equation} \begin{aligned} & \underset{\theta}{\text{minimize}} & & \sum_{k=1}^{K} \|g_k - \theta_k\|_2^2 \\ & \text{subject to} & & \| \theta_m - \theta_l \|_2^2 \leq \| x_m - x_l \|_2^2 , \quad 1 \leq m < l \leq K, \end{aligned} \end{equation}

($\theta_i$ are the variables to optimize over; $x_i$ and $g_i$ are constants; $\|.\|_2$ stands for the Euclidean norm)

Is there any closed-form for arbitrary $K$? Or an appropriate first-order iterative method which yields an approximate solution?

I want to solve the following optimization problem in variables $\theta_1, \theta_2, \dots, \theta_K$

\begin{equation} \begin{aligned} & \underset{\theta}{\text{minimize}} & & \sum_{k=1}^{K} \|g_k - \theta_k\|_2^2 \\ & \text{subject to} & & \| \theta_m - \theta_l \|_2^2 \leq \| x_m - x_l \|_2^2 , \quad 1 \leq m < l \leq K, \end{aligned} \end{equation}

where $x_i$ and $g_i$ are constants and $\| \cdot \|_2$ denotes the Euclidean norm.

Is there any closed-form for arbitrary $K$? Or an appropriate first-order iterative method which yields an approximate solution?

added 59 characters in body
Source Link

The problem I want to solve has this form:

\begin{equation} \begin{aligned} & \underset{\theta}{\text{minimize}} & & \sum_{k=1}^{K} \|g_k - \theta_k\|^2 \\ & \text{subject to} & & \| \theta_m - \theta_l \|^2 \leq \| x_m - x_l \|^2 , \quad 1 \leq m < l \leq K, \end{aligned} \end{equation}\begin{equation} \begin{aligned} & \underset{\theta}{\text{minimize}} & & \sum_{k=1}^{K} \|g_k - \theta_k\|_2^2 \\ & \text{subject to} & & \| \theta_m - \theta_l \|_2^2 \leq \| x_m - x_l \|_2^2 , \quad 1 \leq m < l \leq K, \end{aligned} \end{equation}

($\theta_i$ are the variables to optimize over; $x_i$ and $g_i$ are constantsconstants; $\|.\|_2$ stands for the Euclidean norm)

Is there any closed-form for arbitrary $K$? Or an appropriate first-order iterative method which yields an approximate solution?

The problem I want to solve has this form:

\begin{equation} \begin{aligned} & \underset{\theta}{\text{minimize}} & & \sum_{k=1}^{K} \|g_k - \theta_k\|^2 \\ & \text{subject to} & & \| \theta_m - \theta_l \|^2 \leq \| x_m - x_l \|^2 , \quad 1 \leq m < l \leq K, \end{aligned} \end{equation}

($\theta_i$ are the variables to optimize over; $x_i$ and $g_i$ are constants)

Is there any closed-form for arbitrary $K$? Or an appropriate iterative method which yields an approximate solution?

The problem I want to solve has this form:

\begin{equation} \begin{aligned} & \underset{\theta}{\text{minimize}} & & \sum_{k=1}^{K} \|g_k - \theta_k\|_2^2 \\ & \text{subject to} & & \| \theta_m - \theta_l \|_2^2 \leq \| x_m - x_l \|_2^2 , \quad 1 \leq m < l \leq K, \end{aligned} \end{equation}

($\theta_i$ are the variables to optimize over; $x_i$ and $g_i$ are constants; $\|.\|_2$ stands for the Euclidean norm)

Is there any closed-form for arbitrary $K$? Or an appropriate first-order iterative method which yields an approximate solution?

Source Link
Loading