EN.550.665: Convex Optimization Instructor: Daniel P. Robinson Homework Assignment #4 Any starred exercises require the use of Matlab. Exercise 4.1: Let f : Rn → R be a proper convex function. Prove that a linear minorant with slope s ∈ Rn exists if and only if f ∗ (s) < ∞, where f ∗ is the conjugate function of f . Exercise 4.2: Let f : Rn → R be a proper convex function. Prove that ∂f (x) ⊆ dom(f ∗ ), where f ∗ is the conjugate function of f . Exercise 4.3∗ : Implement the following three algorithms: 1. The SubGradient Descent (SGD) method (Algorithm 1 in Lecture04) with diminishing step size. 2. The Averaged SubGradient Descent (ASGD) method (Algorithm 2 in Lecture04). 3. The Simple Dual Averaging (SDA) Method (Algorithm 3 in Lecture04). To test your implementations, you should first download the file 665 logistic.zip from the course website. Once the file is downloaded, you need to unzip the file, which will produce two directories and two files. You should start with the file ReadMe and then proceed to understand the file demo.m. Specifically, you should solve the following optimization problem: minimize f (θ) := L(θ) + λkθk1 n θ∈R

(1)

for some choice of weighting parameter λ > 0. The function L and its gradient ∇L can be evaluated as shown in the file demo.m. Using this information and the fact that we have already shown how to compute the subdifferential for λkθk1 , allows us to compute the subdifferential for f . To successfully complete this homework exercise, you should do the following: (i) Solve problem (1) using the three algorithms SGD, ASGD, and SDA for the three different data sets breast cancer.mat, ijcnn1.mat, and rcv1.mat; these data sets will be formed once you unzip the file 665 logistic.zip described above. Try this for various values of λ > 0 and report your experience. (ii) What happens to the solution to problem (1) as the weighting parameter λ → ∞? Show that your claim is true via numerical examples. (iii) Choose a value for λ > 0 for which the solution to problem breast cancer.mat has approximately 50% of its entries equal to zero. What is the value of λ > 0 that makes this the case? For that value of λ, perform the following tests for problem breast cancer.mat. (a) Examine how sensitive SGD is to the choice of the parameter c > 0 used in the diminishing step length choice αk = c/k. Exhibit this via numerical experiments. (b) Examine how sensitive ASGD √ is to the choice of the parameter c > 0 used in the diminishing step length choice αk = c/ k. Exhibit this via numerical experiments. (c) Compare the performance of SDA to both SGD and ASGD.

1

EN.550.665: Convex Optimization - MOBILPASAR.COM

You should start with the file ReadMe and then proceed to understand the file demo.m. Specifically, you should solve the following optimization problem: minimize θ∈Rn f(θ) := L(θ) + λθ1. (1) for some choice of weighting parameter λ > 0. The function L and its gradient ∇L can be evaluated as shown in the file demo.m.

118KB Sizes 0 Downloads 301 Views

Recommend Documents

Convex Optimization
Mar 15, 1999 - 5.1 Unconstrained minimization and extensions . ..... It is (as the name implies) a convex cone. Example. ..... and lies in the domain of f (i.e., c. T.

Convex Optimization Overview - Stanford Engineering Everywhere
Oct 19, 2007 - Definition 2.1 A set C is convex if, for any x, y ∈ C and θ ∈ R with 0 ≤ θ .... these concepts are very different; in particular, X ≽ 0 does not imply ...

Guaranteed Non-convex Optimization: Submodular ...
Submodular continuous functions naturally find applications in various real-world settings, including influence and revenue maximization with continuous assign- ments, sensor energy management, multi-resolution data summarization, facility location,

boyd convex optimization pdf
Download. Connect more apps... Try one of the apps below to open or edit this item. boyd convex optimization pdf. boyd convex optimization pdf. Open. Extract.

Guaranteed Non-convex Optimization: Submodular ...
Department of Computer Science, ETH Zurich. 1ybian, baharanm .... α 2 (0, 1] is the mulplicative error level, δ 2 [0, ¯δ] is the additive error level. 4 find stepsize k, e.g. .... In Approximation and Online Algorithms, pages 133–144. Springer,

Guaranteed Non-convex Optimization: Submodular ...
Submodular continuous functions are defined on product of compact sub- ..... free assignment, it can be some non-negative, non-decreasing submodular function; φ(xi(t)) ...... Association for Computational Linguistics, pages 912–920, 2010.

Non-convex Optimization for Linear System with ...
Jul 15, 2010 - probabilities than subgaussian and gaussian random variables. Geometrically, perpendicular in l2 needs to be generalized in lp. The analogue ...

Non-convex Optimization with Frank-Wolfe Algorithm ...
since lims→∞. ∑s l=st l−α(Cg · l−η + (L¯ρ2/2) · l−α) < ∞, which is due to η + α > 1 and 2α > 1. This leads to a contradiction since F(θ) is bounded over C. We conclude that condition A2 holds for the FW algorithm. The remaini

Distributed Dual Averaging for Convex Optimization ...
The issue is not however essential and we prove that a simple correction term ...... Illustration of the effect of fixed edge delays on distributed dual averaging.

A Study on Convex Optimization Approaches to Image ...
ful applications include image denoising [22,8,30], image decomposition [2,17] ..... + ui/c)}) . (30). Interestingly, our experiments show that just one single step of ... experiments are computed by a Ubuntu desktop with AMD Athalon 64 X2 5600.

pdf-1862\introductory-lectures-on-convex-optimization-a-basic ...
Sign in. Loading… Whoops! There was a problem loading more pages. Retrying... Whoops! There was a problem previewing this document. Retrying.

An Efficient Convex Optimization Approach to 3D ...
evolution, which allows a large time step-size to accelerate the speed of .... (8) is dual to the convex relaxation problem (7), by means of similar analytical .... the high anisotropy of the sampled 3D prostate MRI data does interfere achieving.

An Introduction to Convex Optimization for ...
Z.-Q. Luo was supported in part by the National Science Foundation under ... W. Yu is with The Edward S. Rogers Sr. Department Electrical and Computer ... convex optimization (e.g., interior-point method [1] and conic .... years. There are now (freel

Adaptive Bound Optimization for Online Convex ... - Research at Google
realistic classes of loss functions they are much better than existing bounds. ... Existing algorithms for online convex optimization are worst-case optimal in terms of ...... The extra degrees of freedom offered by these generalized learning rates .

Convex Optimization Strategies for Coordinating Large ...
and (perhaps most significantly) pervasive wireless communi- cation. However ... While the optimization construct has many advantages, its po- tential for use in ...

LNCS 7510 - A Fast Convex Optimization Approach to ...
scar tissue solely from 3D cardiac delayed-enhancement MR images (DE-. MRI). ..... Foundation for Innovation (CFI) grant #20994, Canadian Institutes of Health.

Non-convex Optimization for Linear System with ...
Non-convex Optimization for Linear System with. Pregaussian Matrices and Recovery from Multiple. Measurements. Louis Yang Liu (Advisor: Prof. Ming-Jun Lai).