Computation of sparse low degree interpolating polynomials and their application to derivative-free optimization
type: Item
instance of: scholarly article
title: Computation of sparse low degree interpolating polynomials and their application to derivative-free optimization
zbMATH Open document ID: 1254.65072
author: Michael Martin A. S. Bandeira
author: Katya Scheinberg
author: L. N. Vicente
published in: Mathematical Programming. Series A. Series B
publication date: 2012-11-02T00:00:00Z
full work available at URL: https://arxiv.org/abs/1306.5729
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C51
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C56
zbMATH DE Number: 6101840
zbMATH Keywords: derivative-free optimization
zbMATH Keywords: interpolation-based trust-region methods
zbMATH Keywords: random sampling
zbMATH Keywords: sparse recovery
zbMATH Keywords: compressed sensing
zbMATH Keywords: \(\ell _{1}\)-minimization
zbMATH Keywords: numerical examples
zbMATH Keywords: algorithm
zbMATH Keywords: sparse quadratic polynomial interpolation models
Wikidata QID: Q58040551
describes a project that uses: NEWUOA
describes a project that uses: SifDec
describes a project that uses: LIPSOL
describes a project that uses: COBYLA2
describes a project that uses: CUTEr
describes a project that uses: DFO-TRNS
describes a project that uses: DFO
describes a project that uses: GQTPAR
MaRDI profile type: Publication
OpenAlex ID: W2106120648
arXiv ID: 1306.5729
cites work: Second-order cone programming
cites work: The road to deterministic matrices with the restricted isometry property
cites work: A simple proof of the restricted isometry property for random matrices
cites work: Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
cites work: The restricted isometry property and its implications for compressed sensing
cites work: Optimizing partially separable functions without derivatives
cites work: Trust Region Methods
cites work: Global Convergence of General Derivative-Free Trust-Region Algorithms to First- and Second-Order Critical Points
cites work: Introduction to Derivative-Free Optimization
cites work: Benchmarking optimization software with performance profiles.
cites work: Optimality Measures for Performance Profiles
cites work: On the geometry phase in model-based algorithms for derivative-free optimization
cites work: CUTEr and SifDec
cites work: An active-set trust-region method for derivative-free nonlinear bound-constrained optimization
cites work: A short note on compressed sensing with partially known signal support
cites work: Computing a Trust Region Step
cites work: Q5491447
cites work: On trust region methods for unconstrained minimization without derivatives
cites work: Least Frobenius norm updating of quadratic models that satisfy interpolation conditions
cites work: Q5493584
cites work: Q3078293
cites work: Sparse Legendre expansions via \(\ell_1\)-minimization
cites work: Self-Correcting Geometry in Model-Based Algorithms for Derivative-Free Unconstrained Optimization
cites work: Modified-CS: Modifying Compressive Sensing for Problems With Partially Known Support
cites work: Stability and instance optimality for Gaussian measurements in compressed sensing
cites work: Solving large-scale linear programs by interior-point methods under the Matlab∗Environment†
DBLP publication ID: journals/mp/BandeiraSV12
DOI: 10.1007/S10107-012-0578-Z
description: scientific article