The maximal solution of a restricted subadditive inequality in numerical analysis
From MaRDI portal
Publication:1093821
DOI10.1007/BF01836161zbMath0629.39001OpenAlexW4251083215MaRDI QIDQ1093821
Publication date: 1987
Published in: Aequationes Mathematicae (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/137211
Numerical mathematical programming methods (65K05) Additive difference equations (39A10) Inequalities in real analysis (26D99) Convergence and divergence of infinite limiting processes (40A99)
Related Items (2)
Optimal solutions of restricted subadditive inequalities ⋮ A family of restricted subadditive recursions
Cites Work
- Unnamed Item
- Unnamed Item
- Recurrence relations based on minimization
- A class of Fibonacci-type sequences
- Random search for zeroes
- Optimum Sequential Search and Approximation Methods Under Minimum Regularity Assumptions
- Some Maximal Solutions of the Generalized Subadditive Inequality
- Some Recurrence Relations of Recursive Minimization
- On the Optimality of Huffman Trees
- An Odd Order Search Problem
- Location of Zeros of Derivatives
- Location of Zeros of Derivatives. II
- Sequences defined as minima of two Fibonacci-type relations
- Sequential Minimax Search for a Maximum
This page was built for publication: The maximal solution of a restricted subadditive inequality in numerical analysis