A greedy algorithm for the optimal basis problem
From MaRDI portal
Publication:1371665
DOI10.1007/BF02510241zbMATH Open0886.65043OpenAlexW1999653997MaRDI QIDQ1371665FDOQ1371665
Authors: Oleg Burdakov 
Publication date: 13 November 1997
Published in: BIT (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02510241
Recommendations
greedy algorithmsystems of nonlinear equationsminimum spanning tree problemHadamard condition numbermultipoint interpolation methodsoptimal basis problem
Cites Work
- A note on two problems in connexion with graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Matrix multiplication via arithmetic progressions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Stable versions of the secants method for solving systems of equations
- A Simple Estimate of the Condition Number of a Linear System
- Network flow, transportation and scheduling. Theory and algorithms
- On Superlinear Convergence of Some Stable Variants of the Secant Method
- Title not available (Why is that?)
- Two Hadamard numbers for matrices
- Stable symmetric secant methods with restart
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (6)
- An active-set trust-region method for derivative-free nonlinear bound-constrained optimization
- Title not available (Why is that?)
- The thresholding greedy algorithm, greedy bases, and duality
- Greedy bases are best for \(m\)-term approximation
- Title not available (Why is that?)
- Multipoint secant and interpolation methods with nonmonotone line search for solving systems of nonlinear equations
Uses Software
This page was built for publication: A greedy algorithm for the optimal basis problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1371665)
