Minimizing convex functions by continuous descent methods
From MaRDI portal
Recommendations
Cited in
(16)- Minimization of convex functions using an accelerated descent method. Application to optimal control in dynamic systems
- Potential Function-Based Framework for Minimizing Gradients in Convex and Min-Max Optimization
- A method for minimizing convex functions based on continuous approximations to the subdifferential
- scientific article; zbMATH DE number 7201315 (Why is no real title available?)
- scientific article; zbMATH DE number 1896924 (Why is no real title available?)
- Generalized descent method for minimization of functionals
- Stability of the asymptotic behavior for continuous descent methods with a convex objective function
- Stability of convergent continuous descent methods
- Convergence theorems for continuous descent methods
- Descent methods in the presence of computational errors in Banach spaces
- scientific article; zbMATH DE number 2100286 (Why is no real title available?)
- Steepest descent on a uniformly convex space
- Most continuous descent methods converge
- Generic convergence of descent methods in Banach spaces
- Continuous descent methods for the minimization of Lipschitz functions
- scientific article; zbMATH DE number 2064529 (Why is no real title available?)
This page was built for publication: Minimizing convex functions by continuous descent methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5187769)