- #1
Master1022
- 611
- 117
- Homework Statement
- Find the dual problem of the L1 norm minimization problem with an equality constraint
- Relevant Equations
- Epigraphic reformulation
Hi,
I was reading through some notes on standard problems and their corresponding dual problems. I came across the L2 norm minimization for an equality constraint, and then I thought how one might formulate the dual problem if we had an L1-norm instead.
Question:
Consider the following optimization problem:
## \text{minimize}_{x}## ## || x ||_{1} ##
subject to: ## Ax = b ##.
where ## x \in \mathbb{R}^{n} ##, ## b \in \mathbb{R}^{n} ##, and ## A \in \mathbb{R}^{n \times n} ##
Attempt at finding the dual:
This is the attempt I have made, but I don't know how to proceed much further
1. Make an epigraphic reformulation of the objective function
We get:
## \text{minimize}_{t, x}## ## \sum_{j = 1}^{n} t_{j} ##
subject to: ## Ax = b ##
## -x_{j} \leq t_{j} ## and ## x_{j} \leq t_{j} ## for ## j = 1, ..., n ##
2. Write the Lagrangian
I realized that I don't fully understand what to do here when there are two separate optimization variables.
Would the Lagrangian look like?
[tex] L(x, t, \lambda, \nu) = \vec{1}^{T} \vec{t} + \vec{\nu}^{T} \left( A \vec{x} - \vec{b} \right) + \vec{\lambda}^{T} \left( \vec{x} - \vec{t} \right) + \vec{\lambda}^{T} \left( -\vec{x} - \vec{t} \right) [/tex]
I included vector symbols just to (try to) be clear.
Thanks in advance
I was reading through some notes on standard problems and their corresponding dual problems. I came across the L2 norm minimization for an equality constraint, and then I thought how one might formulate the dual problem if we had an L1-norm instead.
Question:
Consider the following optimization problem:
## \text{minimize}_{x}## ## || x ||_{1} ##
subject to: ## Ax = b ##.
where ## x \in \mathbb{R}^{n} ##, ## b \in \mathbb{R}^{n} ##, and ## A \in \mathbb{R}^{n \times n} ##
Attempt at finding the dual:
This is the attempt I have made, but I don't know how to proceed much further
1. Make an epigraphic reformulation of the objective function
We get:
## \text{minimize}_{t, x}## ## \sum_{j = 1}^{n} t_{j} ##
subject to: ## Ax = b ##
## -x_{j} \leq t_{j} ## and ## x_{j} \leq t_{j} ## for ## j = 1, ..., n ##
2. Write the Lagrangian
I realized that I don't fully understand what to do here when there are two separate optimization variables.
Would the Lagrangian look like?
[tex] L(x, t, \lambda, \nu) = \vec{1}^{T} \vec{t} + \vec{\nu}^{T} \left( A \vec{x} - \vec{b} \right) + \vec{\lambda}^{T} \left( \vec{x} - \vec{t} \right) + \vec{\lambda}^{T} \left( -\vec{x} - \vec{t} \right) [/tex]
I included vector symbols just to (try to) be clear.
Thanks in advance