MM Algorithms for Geometric and Signomial Programming

Details MM Algorithms for Geometric and Signomial Programming MM Algorithms for Geometric and Signomial Programming

2010-07-14

arxiv.org/abs/1007.2371v1

Mathematics

Numerical Analysis

16 pages, 1 figure

Scientific paper

This paper derives new algorithms for signomial programming, a generalization of geometric programming. The algorithms are based on a generic principle for optimization called the MM algorithm. In this setting, one can apply the geometric-arithmetic mean inequality and a supporting hyperplane inequality to create a surrogate function with parameters separated. Thus, unconstrained signomial programming reduces to a sequence of one-dimensional minimization problems. Simple examples demonstrate that the MM algorithm derived can converge to a boundary point or to one point of a continuum of minimum points. Conditions under which the minimum point is unique or occurs in the interior of parameter space are proved for geometric programming. Convergence to an interior point occurs at a linear rate. Finally, the MM framework easily accommodates equality and inequality constraints of signomial type. For the most important special case, constrained quadratic programming, the MM algorithm involves very simple updates.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-121126