(adsbygoogle = window.adsbygoogle || []).push({}); 1. The problem statement, all variables and given/known data

Consider the half space defined by H = {x ∈ IRn | aT x +alpha ≥ 0} where a ∈ IRn

and alpha ∈ IR are given. Formulate and solve the optimization problem for finding the point

x in H that has the smallest Euclidean norm.

2. Relevant equations

3. The attempt at a solution

I need help in this problem. I think the problem can be written as

min ||x|| sunbjected to a(transpose) x + a >= 0

am I right

**Physics Forums - The Fusion of Science and Community**

# Numerical Optimization ( norm minim)

Know someone interested in this topic? Share a link to this question via email,
Google+,
Twitter, or
Facebook

Have something to add?

- Similar discussions for: Numerical Optimization ( norm minim)

Loading...

**Physics Forums - The Fusion of Science and Community**