Algorithms for Sparsity-Constrained Optimization [Bahmani 2013-10-18].pdf

(3087 KB) Pobierz
Springer Theses
Recognizing Outstanding Ph.D. Research
Sohail Bahmani
Algorithms
for Sparsity-
Constrained
Optimization
Springer Theses
Recognizing Outstanding Ph.D. Research
For further volumes:
http://www.springer.com/series/8790
Aims and Scope
The series “Springer Theses” brings together a selection of the very best Ph.D.
theses from around the world and across the physical sciences. Nominated and
endorsed by two recognized specialists, each published volume has been selected
for its scientific excellence and the high impact of its contents for the pertinent
field of research. For greater accessibility to non-specialists, the published versions
include an extended introduction, as well as a foreword by the student’s supervisor
explaining the special relevance of the work for the field. As a whole, the series will
provide a valuable resource both for newcomers to the research fields described, and
for other scientists seeking detailed background information on special questions.
Finally, it provides an accredited documentation of the valuable contributions made
by today’s younger generation of scientists.
Theses are accepted into the series by invited nomination only and
must fulfill all of the following criteria
• They must be written in good English.
• The topic should fall within the confines of Chemistry, Physics, Earth Sciences
and related interdisciplinary fields such as Materials, Nanoscience, Chemical
Engineering, Complex Systems and Biophysics.
• The work reported in the thesis must represent a significant scientific advance.
• If the thesis includes previously published material, permission to reproduce this
must be gained from the respective copyright holder.
• They must have been examined and passed during the 12 months prior to
nomination.
• Each thesis should include a foreword by the supervisor outlining the significance
of its content.
• The theses should have a clearly defined structure including an introduction
accessible to scientists not expert in that particular field.
Sohail Bahmani
Algorithms for
Sparsity-Constrained
Optimization
123
Sohail Bahmani
Carnegie Mellon University
Pittsburgh, Pennsylvania, USA
ISSN 2190-5053
ISSN 2190-5061 (electronic)
ISBN 978-3-319-01880-5
ISBN 978-3-319-01881-2 (eBook)
DOI 10.1007/978-3-319-01881-2
Springer Cham Heidelberg New York Dordrecht London
Library of Congress Control Number: 2013949675
© Springer International Publishing Switzerland 2014
This work is subject to copyright. All rights are reserved by the Publisher, whether the whole or part of
the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation,
broadcasting, reproduction on microfilms or in any other physical way, and transmission or information
storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology
now known or hereafter developed. Exempted from this legal reservation are brief excerpts in connection
with reviews or scholarly analysis or material supplied specifically for the purpose of being entered
and executed on a computer system, for exclusive use by the purchaser of the work. Duplication of
this publication or parts thereof is permitted only under the provisions of the Copyright Law of the
Publisher’s location, in its current version, and permission for use must always be obtained from Springer.
Permissions for use may be obtained through RightsLink at the Copyright Clearance Center. Violations
are liable to prosecution under the respective Copyright Law.
The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication
does not imply, even in the absence of a specific statement, that such names are exempt from the relevant
protective laws and regulations and therefore free for general use.
While the advice and information in this book are believed to be true and accurate at the date of
publication, neither the authors nor the editors nor the publisher can accept any legal responsibility for
any errors or omissions that may be made. The publisher makes no warranty, express or implied, with
respect to the material contained herein.
Printed on acid-free paper
Springer is part of Springer Science+Business Media (www.springer.com)
Zgłoś jeśli naruszono regulamin