Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Help & Advice
University of Warwick

The Library

  • Login
  • Admin

Average-case complexity without the black swans

Tools
- Tools
+ Tools

Amelunxen, D. and Lotz, Martin (2017) Average-case complexity without the black swans. Journal of Complexity, 41 . pp. 82-101. doi:10.1016/j.jco.2016.12.002

[img]
Preview
PDF
WRAP-average-case-complexity-without-black-swans-Lotz-2017.pdf - Accepted Version - Requires a PDF viewer.
Available under License Creative Commons Attribution Non-commercial No Derivatives 4.0.

Download (976Kb) | Preview
Official URL: https://doi.org/10.1016/j.jco.2016.12.002

Request Changes to record.

Abstract

We introduce the concept of weak average-case analysis as an attempt to achieve theoretical complexity results that are closer to practical experience than those resulting from traditional approaches. The underlying paradigm is accepted in other areas such as non-asymptotic random matrix theory and compressive sensing, and has a particularly convincing interpretation in the most common situation encountered for condition numbers, where it amounts to replacing a null set of ill-posed inputs by a “numerical null set”. We illustrate the usefulness of these notions by considering three settings: (1) condition numbers that are inversely proportional to a distance of a homogeneous algebraic set of ill-posed inputs; (2) Renegar’s condition number for conic optimization; (3) the running time of power iteration for computing a leading eigenvector of a Hermitian matrix.

Item Type: Journal Article
Subjects: Q Science > QA Mathematics
Divisions: Faculty of Science, Engineering and Medicine > Science > Mathematics
Library of Congress Subject Headings (LCSH): Hermitian operators, Conic sections , Numerical analysis, Probabilities
Journal or Publication Title: Journal of Complexity
Publisher: Academic Press
ISSN: 0885-064X
Official Date: August 2017
Dates:
DateEvent
August 2017Published
29 December 2016Available
19 December 2016Accepted
Volume: 41
Page Range: pp. 82-101
DOI: 10.1016/j.jco.2016.12.002
Status: Peer Reviewed
Publication Status: Published
Access rights to Published version: Restricted or Subscription Access
Related URLs:
  • Other Repository

Request changes or add full text files to a record

Repository staff actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics

twitter

Email us: wrap@warwick.ac.uk
Contact Details
About Us