What is the optimal point in the nullspace of A using Lagrange multipliers?

  • Context: Graduate 
  • Thread starter Thread starter hoffmann
  • Start date Start date
  • Tags Tags
    Matrix Nullspace
Click For Summary

Discussion Overview

The discussion revolves around finding the optimal point in the nullspace of a matrix A using Lagrange multipliers. Participants explore the significance of this point, its relationship to orthogonality, and methods for deriving it, including projections and geometric interpretations.

Discussion Character

  • Exploratory
  • Technical explanation
  • Mathematical reasoning
  • Debate/contested

Main Points Raised

  • Some participants suggest that the problem relates to the orthogonality of subspaces, comparing it to finding the shortest distance from a point to an axis.
  • Others clarify that the point x* in the nullspace satisfies Ax* = 0, indicating its role in linear systems and least squares solutions.
  • A participant proposes that the solution can be viewed as the projection of x onto the nullspace of A, providing a formula involving the transpose and inverse of A.
  • One participant discusses the geometric interpretation of the row space and nullspace, suggesting that the closest point in the nullspace may be the original point x if it lies in the row space.
  • Another participant emphasizes the need to set up an objective function and constraints for applying Lagrange multipliers, recommending a formulation that avoids square roots for differentiability.

Areas of Agreement / Disagreement

Participants express various viewpoints on the relationship between the point x and the nullspace, with some agreeing on the projection concept while others propose different interpretations. The discussion remains unresolved with multiple competing views on the optimal approach.

Contextual Notes

Participants mention limitations regarding the formulation of the objective function and the need for differentiability, as well as the geometric relationships between the row space and nullspace that may not be fully explored.

hoffmann
Messages
65
Reaction score
0
Does anyone know how to approach this problem?

Let A be an m×n matrix of rank m, where m<n. Pick a point x in R^n, and let x∗ be the point in the nullspace of A closest to x. Write a formula for x∗ in terms of x and A.

What exactly is the significance of the point x* in the nullspace of A?
 
Physics news on Phys.org
i think this question has something to do with the orthogonality of subspaces and is analogous to saying the shortest distance between a point and an axis is just a perpendicular line...
 
>> What exactly is the significance of the point x* in the nullspace of A?

So, Ax* = 0 which is basically what it means by x* being in the nullspace of A. x* is a vector which multiplies A to take it to 0.

I think it has something to do with the least square solution for linear systems.
 
I think you should think of the solution in terms of the projection of x onto the nullspace of A, which would be x*.

This is simply given by A*(A'A)-1*A'*x. Sorry, I am not fluent with latex.

A' = transpose of A.
-1 = inverse
* = multiplication

Refer to the Strang book on least square and projection of vectors onto the column space of a a matrix.
 
We know that the row space is in R^{n} and that it is orthogonal to the null space.

Imagine that we have a 2x3 matrix with rank 2. It's row space would be a plane in R^{3}, and it's null space a line perpendicular to that plane. If we pick a point x in that plane, wouldn't the point closest to the null space be that same point x?

I'm eagerly awaiting someone to help us out :)
 
^^ i think you're on the right track, dafe.

i think an analogy to this problem is, what is the shortest distance between a point in the xy plane and the x axis. it's just a line perpendicular to the x-axis.

so in the context of the problem i asked, it's like...the dot product between the point x and...the row space? something like that...
 
ok, some help:

1) set this up with a variable (btw, better to call the starting point x0 rather than x, since it is fixed), an objective function and a set of equality constraints. Write them down. You should replace the objective function by something nicer: for example no square roots, since to apply Lagrange you need a differentiable function.
2) show geometrically in terms of the level sets of the objective function and the tangent space of the constraints that the vector x0 - x* is perpendicular to the null space.
3) form the Lagrangian. solve.
 

Similar threads

  • · Replies 14 ·
Replies
14
Views
4K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 6 ·
Replies
6
Views
9K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 17 ·
Replies
17
Views
7K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 10 ·
Replies
10
Views
26K
Replies
4
Views
2K