Separable convex optimization problems with linear ascending constraints

Details Separable convex optimization problems with linear ascending constraints Separable convex optimization problems with linear ascending constraints

2007-07-16

arxiv.org/abs/0707.2265v1

SIAM J. on Optim., vol. 20, no. 3, pp. 1185-1204, online version 19 August 2009

Computer Science

Information Theory

15 pages, Submitted to SIAM J. on Opt

Scientific paper

10.1137/07069729X

Separable convex optimization problems with linear ascending inequality and equality constraints are addressed in this paper. Under an ordering condition on the slopes of the functions at the origin, an algorithm that determines the optimum point in a finite number of steps is described. The optimum value is shown to be monotone with respect to a partial order on the constraint parameters. Moreover, the optimum value is convex with respect to these parameters. Examples motivated by optimizations for communication systems are used to illustrate the algorithm.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-194904