This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: 6.253: Convex Analysis and Optimization Homework 5 Prof. Dimitri P. Bertsekas Spring 2010, M.I.T. Problem 1 Consider the convex programming problem minimize f ( x ) x subject to x ∈ X, g ( x ) ≤ , of Section 5.3, and assume that the set X is described by equality and inequality constraints as X = { x  m, g j ( x ) ≤ , j r } . l i ( x ) = 0 , i = 1 ,..., ¯ = r + 1 ,..., ¯ Then the problem can alternatively be described without an abstract set constraint, in terms of all of the constraint functions l i ( x ) = 0 , i = 1 ,..., ¯ g j ( x ) ≤ , r. m, j = 1 ,..., ¯ We call this the extended representation of (P). Show if there is no duality gap and there exists a dual optimal solution for the extended representation, the same is true for the original problem. Problem 2 Consider the class of problems minimize f ( x ) x subject to x ∈ X, g j ( x ) ≤ u j , j = 1 , . . . , r, where u = ( u 1 ,...,u r ) is a vector parameterizing the righthand side of the constraints. Given two distinct...
View
Full
Document
This note was uploaded on 10/16/2011 for the course ELECTRICAL EE251202 taught by Professor Rejaei during the Spring '10 term at Sharif University of Technology.
 Spring '10
 Rejaei
 Electromagnet

Click to edit the document details