Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Extensions and Applications of Fast-Lipschitz Optimization
KTH, School of Electrical Engineering (EES), Automatic Control.
2014 (English)Licentiate thesis, monograph (Other academic)
Abstract [en]

Fast-Lipschitz optimization is a framework for optimization problems having a special structure in which the optimal solution is given by a set of equations, easily solvable through fixed point iterations. This solution method is simple to implement and particularly well suited for distributed optimization applications, such as those arising in wireless sensor networks.

This thesis provides several theoretical contributions to the Fast-Lipschitz framework. In particular, it further develops the qualifying conditions under which a problem is guaranteed to be Fast-Lipschitz.Known qualifying conditions are unified and extended by a new set of conditions. This is done through a newapproach to the analysis of existing conditions, based on the Karush--Kuhn--Tucker (KKT) conditions.The Fast-Lipschitz framework is further extended by examining problem structures that are not treatable by the existing framework, such as problems with more or fewer constraints than variables. Finally, this thesis provides a comparison between the convergence properties of Fast-Lipschitz optimization and those of a traditional method based on gradient descent.

The thesis then applies the theory of Fast-Lipschitz optimization to the area of radio power control over wireless networks.Conditions are given under which well known distributed power control algorithms,such as those involving standard types of interference functions, fall in the Fast-Lipschitz framework.This gives a direct connection between these algorithms and a family of optimization problems, and the fixed points thereby assume a meaning of optimality.

Finally, the thesis gives illustrative examples of the new theory and examples of applications such as in a general non-convex optimal control problem and a non-monotonic power control problem.

Place, publisher, year, edition, pages
Stockholm: KTH Royal Institute of Technology, 2014. , vii, 97 p.
Series
TRITA-EE, ISSN 1653-5146 ; 2014:033
National Category
Control Engineering
Identifiers
URN: urn:nbn:se:kth:diva-149349ISBN: 978-91-7595-225-3 (print)OAI: oai:DiVA.org:kth-149349DiVA: diva2:739310
Presentation
2014-09-05, Sal Q2, Osquldas väg 10, KTH, Stockholm, 10:15 (English)
Opponent
Supervisors
Note

QC 20140826

Available from: 2014-08-26 Created: 2014-08-20 Last updated: 2014-08-26Bibliographically approved

Open Access in DiVA

lic_electronic(3204 kB)278 downloads
File information
File name FULLTEXT01.pdfFile size 3204 kBChecksum SHA-512
14ee1a932d7e665c5c0b44874a72a0e185035468aa8416717714f203724d2080acbf5bae95e0346aa73e048771dc0e4c548e1883256e74b9ad18f08a6495411f
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Jakobsson, Martin
By organisation
Automatic Control
Control Engineering

Search outside of DiVA

GoogleGoogle Scholar
Total: 278 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

isbn
urn-nbn

Altmetric score

isbn
urn-nbn
Total: 301 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf