Utility Maximization in Nonconvex Wireless Systems

  • Johannes Brehmer
Part of the Foundations in Signal Processing, Communications and Networking book series (SIGNAL, volume 5)

Table of contents

  1. Front Matter
    Pages i-vii
  2. Johannes Brehmer
    Pages 1-5
  3. Johannes Brehmer
    Pages 7-33
  4. Johannes Brehmer
    Pages 35-98
  5. Johannes Brehmer
    Pages 99-121
  6. Johannes Brehmer
    Pages 123-127
  7. Johannes Brehmer
    Pages 129-153
  8. Back Matter
    Pages 177-182

About this book

Introduction

This monograph formulates a framework for modeling and solving utility maximization problems in nonconvex wireless systems. First, a model for utility optimization in wireless systems is defined. The model is general enough to encompass a wide array of system configurations and performance objectives. Based on the general model, a set of methods for solving utility maximization problems is developed. The development is based on a careful examination of the properties that are required for the application of each method. The focus is on problems whose initial formulation does not allow for a solution by standard convex methods. Solution approaches that take into account the nonconvexities inherent to wireless systems are discussed in detail. The monograph concludes with two case studies that demonstrate the application of the proposed framework to utility maximization in multi-antenna broadcast channels.

Keywords

Dirty paper coding Lagrange duality Monotonic optimization Multi-antenna techniques Multi-user techniques Pareto Manifold Resource allocation

Authors and affiliations

  • Johannes Brehmer
    • 1
  1. 1., Methoden der SignalverarbeitungTechnische Universität MünchenMunichGermany

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-17438-4
  • Copyright Information Springer-Verlag Berlin Heidelberg 2012
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Engineering
  • Print ISBN 978-3-642-17437-7
  • Online ISBN 978-3-642-17438-4
  • Series Print ISSN 1863-8538
  • Series Online ISSN 1863-8546