Bisection is Optimal
K. Sikorski (1982)
Numerische Mathematik
Similarity:
Displaying similar documents to “Optimal Solution of Nonlinear Equations Satisfying a Lipschitz Condition.”
Bisection is Optimal
Bisection is not Optimal on the Average.
S. Graf, E. Novak, A. Papageorgiou (1987)
Numerische Mathematik
Similarity:
Optimale Differentiations- und Integrationsformeln in C0 [a, b]. - Optimal Differentiation and Integration Formulas in C0 [a, b].
D. Pallaschke (1976)
Numerische Mathematik
Similarity:
The extent to which linear problems have linear optimal algorithms
Edward W. Packel (1988)
Banach Center Publications
Similarity:
Directional lipschitzian optimal solutions and directional derivative for the optimal value function in nonlinear mathematical programming
J. Gauvin, R. Janin (1989)
Annales de l'I.H.P. Analyse non linéaire
Similarity:
A conception of optimality for algorithms and its application to the optimal search for a minimum
A. Adamski, A. Korytowski, W. Mitkowski (1977)
Applicationes Mathematicae
Similarity:
The Optimal Recovery of Smooth Function.
C.A. Micchelli, T.J. Rivlin, S. Winograd (1976)
Numerische Mathematik
Similarity:
Development of the theory of optimal systems with delayed arguments in Georgia.
Kharatishvili, G., Tadumadze, T. (1997)
Memoirs on Differential Equations and Mathematical Physics
Similarity:
On the conjecture relating minimax and minimean complexity norms
Peter Růžička, Juraj Wiedermann (1979)
Aplikace matematiky
Similarity:
Using counterexample it has been shown that an algorithm which is minimax optimal and over all minimax optimal algorithms is minimean optimal and has a uniform behaviour need not to be minimean optimal.
Finding an ε-optimal regression subset
A. Bartkowiak (1991)
Applicationes Mathematicae
Similarity:
A new algorithm for optimal solution of fixed charge transportation problem
Nermin Kartli, Erkan Bostanci, Mehmet Serdar Guzel (2023)
Kybernetika
Similarity:
Fixed charge transportation problem (FCTP) is a supply chain problem. In this problem, in addition to the cost per unit for each transported product, a fixed cost is also required. The aim is to carry out the transportation process at the lowest possible cost. As with all supply chain problems, this problem may have one, two, or three stages. An algorithm that can find the optimal solution for the problem in polynomial time is not known, even if it is a single-stage problem. For this...