60 likes | 65 Views
CSE 203B: Convex Optimization Week 7 Discuss Session. Xinyuan Wang 02/20/2019. Unconstrained Minimization Problems. Assume that the objective function is strongly convex on , there exists an such that ( 1) for all . Upper bound on , there exist a constant such that (2)
E N D
CSE203B:ConvexOptimizationWeek7DiscussSession Xinyuan Wang 02/20/2019
Unconstrained Minimization Problems • Assume that the objective function is strongly convex on , there exists an such that (1) for all . • Upper bound on , there exist a constant such that (2) for all . In class we are given two inequality condition for the optimal How to prove?
Unconstrained Minimization Problems • Taylor expansion with any . for on the line segment between and . • Consider the strong convexity for any • It holds for any , let be the optimal
Unconstrained Minimization Problems • Taylor expansion with any . for on the line segment between and . • Consider the upper bound for any try to minimize the rhs, the minimum is achieved at • Let be the optimal
Unconstrained Minimization Problems • Taylor expansion with any . for on the line segment between and . • Consider the strong convexity for any , we have Cauchy-Schwarz inequality • Sincefor all
Unconstrained Minimization Problems • Taylor expansion with any . for on the line segment between and . • Consider the first-order condition for any and is optimal Cauchy-Schwarz inequality • We already prove that