On numerical estimates of errors in solving convex optimization problems
From MaRDI portal
Recommendations
- The method of convex programming with a prescribed absolute-relative error
- The extragradient method for convex optimization in the presence of computational errors
- ERROR ESTIMATES IN THE APPROXIMATION OF OPTIMIZATION PROBLEMS GOVERNED BY NONLINEAR OPERATORS
- Approximation accuracy, gradient methods, and error bound for structured convex optimization
- Error estimation in nonlinear optimization
Cites work
- Accelerated meta-algorithm for convex optimization problems
- Convex optimization: algorithms and complexity
- Dual approaches to the minimization of strongly convex functionals with a simple structure under affine constraints
- Fast primal-dual gradient method for strongly convex minimization problems with linear constraints
- scientific article; zbMATH DE number 3790207 (Why is no real title available?)
- scientific article; zbMATH DE number 3793774 (Why is no real title available?)
- Lectures on convex optimization
Cited in
(6)- An Algorithm for Nonsmooth Convex Minimization With Errors
- Errors of gradient extrema of a strictly convex function of discrete argument
- Approximation accuracy, gradient methods, and error bound for structured convex optimization
- Error analysis of numerical methods for optimization problems
- On verified numerical computations in convex programming
- Error bounds for initial value problems by optimization
This page was built for publication: On numerical estimates of errors in solving convex optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5054154)