Question from Boyd's Optimization Book

  • Context: Graduate 
  • Thread starter Thread starter newphysist
  • Start date Start date
  • Tags Tags
    Book Optimization
Click For Summary
SUMMARY

The discussion centers on a mathematical expression from Stephen Boyd's "Convex Optimization," specifically on page 157, which states that the supremum of the expression sup{uTP^{T}_{i}x | ||u||2 ≤ 1} equals ||P^{T}_{i}x||2. This conclusion is derived directly from the Cauchy-Schwarz inequality, a fundamental principle in linear algebra. The participants confirm that understanding this relationship is crucial for grasping the optimization concepts presented in Boyd's work.

PREREQUISITES
  • Understanding of linear algebra concepts, particularly the Cauchy-Schwarz inequality.
  • Familiarity with convex optimization principles as outlined in Stephen Boyd's "Convex Optimization."
  • Basic knowledge of vector norms and their properties.
  • Ability to interpret mathematical notation used in optimization contexts.
NEXT STEPS
  • Study the Cauchy-Schwarz inequality in detail to understand its applications in optimization.
  • Review the relevant sections of "Convex Optimization" by Stephen Boyd for deeper insights.
  • Explore vector norms and their significance in optimization problems.
  • Practice solving optimization problems that utilize the supremum and properties of linear transformations.
USEFUL FOR

Students and professionals in mathematics, particularly those studying optimization, linear algebra, and anyone seeking to deepen their understanding of concepts in Stephen Boyd's "Convex Optimization."

newphysist
Messages
12
Reaction score
0
Hi,

I am reading Convex Optimization from Stephen Boyd's book on my own and I am stuck at math he mentions on Pg. 157 of his book which can be found here.

How does he write the following:

sup{uTP^{T}_{i}x | ||u||2 ≤ 1} = ||P^{T}_{i}x||2

Thanks guys
 
Mathematics news on Phys.org

Similar threads

  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 6 ·
Replies
6
Views
3K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 6 ·
Replies
6
Views
3K
  • · Replies 1 ·
Replies
1
Views
4K
  • · Replies 13 ·
Replies
13
Views
5K
Replies
17
Views
2K
  • · Replies 0 ·
Replies
0
Views
2K
  • · Replies 6 ·
Replies
6
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K