On representations of the feasible set in convex optimization

Details On representations of the feasible set in convex optimization On representations of the feasible set in convex optimization

2009-11-06

arxiv.org/abs/0911.1182v1

Mathematics

Optimization and Control

to appear in Optimization Letters

Scientific paper

We consider the convex optimization problem $\min \{f(x) : g_j(x)\leq 0, j=1,...,m\}$ where $f$ is convex, the feasible set K is convex and Slater's condition holds, but the functions $g_j$ are not necessarily convex. We show that for any representation of K that satisfies a mild nondegeneracy assumption, every minimizer is a Karush-Kuhn-Tucker (KKT) point and conversely every KKT point is a minimizer. That is, the KKT optimality conditions are necessary and sufficient as in convex programming where one assumes that the $g_j$ are convex. So in convex optimization, and as far as one is concerned with KKT points, what really matters is the geometry of K and not so much its representation.

Affiliated with

Also associated with

No associations

Rating

On representations of the feasible set in convex optimization does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On representations of the feasible set in convex optimization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On representations of the feasible set in convex optimization will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-390730