Generic identifiability and second-order sufficiency in tame convex optimization

Details Generic identifiability and second-order sufficiency in tame convex optimization Generic identifiability and second-order sufficiency in tame convex optimization

2009-01-20

arxiv.org/abs/0901.3117v1

Mathematics

Optimization and Control

Scientific paper

We consider linear optimization over a fixed compact convex feasible region that is semi-algebraic (or, more generally, "tame"). Generically, we prove that the optimal solution is unique and lies on a unique manifold, around which the feasible region is "partly smooth", ensuring finite identification of the manifold by many optimization algorithms. Furthermore, second-order optimality conditions hold, guaranteeing smooth behavior of the optimal solution under small perturbations to the objective.

Affiliated with

Also associated with

No associations

Rating

Generic identifiability and second-order sufficiency in tame 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 Generic identifiability and second-order sufficiency in tame convex optimization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Generic identifiability and second-order sufficiency in tame convex optimization will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-435445