A class of algorithms for computing the minimal value of a convex functionfover[0 1]kwithin accuracy ∊, when the evaluations offare made within accuracy ∊
From MaRDI portal
Publication:3727747
Recommendations
- Algorithms for approximate calculation of the minimum of a convex function from its values
- Approximation of convex functions by projections of polyhedra
- Line search by curve fitting in minimization algorithms
- Finding a minimax with specified accuracy
- An Algorithm for Nonsmooth Convex Minimization With Errors
Cites work
Cited in
(10)- Efficient optimization of certain functionals in a hypercube
- Algorithms for approximate calculation of the minimum of a convex function from its values
- Line search by curve fitting in minimization algorithms
- \(\varepsilon\)-approximation minimization of convex functions in fixed dimension
- A method for approximating univariate convex functions using only function value evaluations
- scientific article; zbMATH DE number 431467 (Why is no real title available?)
- scientific article; zbMATH DE number 4176837 (Why is no real title available?)
- On volumes of bounded convex sets
- scientific article; zbMATH DE number 3978830 (Why is no real title available?)
- scientific article; zbMATH DE number 3984995 (Why is no real title available?)
This page was built for publication: A class of algorithms for computing the minimal value of a convex functionfover[0 1]kwithin accuracy ∊, when the evaluations offare made within accuracy ∊
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3727747)