Generic nondegeneracy in convex optimization

Details Generic nondegeneracy in convex optimization Generic nondegeneracy in convex optimization

2010-05-06

arxiv.org/abs/1005.1082v1

Proc. Amer. Math. Soc. 139 (2011), 2519-2527

Mathematics

Optimization and Control

13 pages

Scientific paper

We show that minimizers of convex functions subject to almost all linear
perturbations are nondegenerate. An analogous result holds more generally, for
lower-C^2 functions.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-221765