Quasiconvex Programming

Details Quasiconvex Programming Quasiconvex Programming

2004-12-10

arxiv.org/abs/cs/0412046v1

Computer Science

Computational Geometry

33 pages, 14 figures

Scientific paper

We define quasiconvex programming, a form of generalized linear programming in which one seeks the point minimizing the pointwise maximum of a collection of quasiconvex functions. We survey algorithms for solving quasiconvex programs either numerically or via generalizations of the dual simplex method from linear programming, and describe varied applications of this geometric optimization technique in meshing, scientific computation, information visualization, automated algorithm analysis, and robust statistics.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-263528