Fast Fourier optimization
From MaRDI portal
Publication:1762460
DOI10.1007/s12532-011-0034-8zbMath1257.90049arXiv1209.0617OpenAlexW2059485043MaRDI QIDQ1762460
Publication date: 27 November 2012
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1209.0617
Fourier transformfast Fourier transforminterior-point methodsCooley-Tukey algorithmhigh-contrast imaging
Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Numerical methods for discrete and fast Fourier transforms (65T50) Physical optics (78A10)
Related Items (5)
Revisiting compressed sensing: exploiting the efficiency of simplex and sparsification methods ⋮ An interior-point implementation developed and tuned for radiation therapy treatment planning ⋮ A sequential cutting plane algorithm for solving convex NLP problems ⋮ Outlier detection and quasi-periodicity optimization algorithm: frequency domain based outlier detection (FOD) ⋮ A linear programming-based optimization algorithm for solving nonlinear programming problems
Uses Software
Cites Work
This page was built for publication: Fast Fourier optimization