scientific article; zbMATH DE number 7201315
From MaRDI portal
Publication:5110195
Recommendations
- On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization
- scientific article; zbMATH DE number 2100286
- On the asymptotic behavior of the Douglas-Rachford and proximal-point algorithms for convex optimization
- Minimizing convex functions by continuous descent methods
- scientific article; zbMATH DE number 1896924
- Convergence theorems for continuous descent methods
- On the convergence of the coordinate descent method for convex differentiable minimization
- Continuous descent methods for the minimization of Lipschitz functions
- Descent methods for convex essentially smooth minimization
- A note on the optimal convergence rate of descent methods with fixed step sizes for smooth strongly convex functions
Cites work
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 5125723 (Why is no real title available?)
- scientific article; zbMATH DE number 1896924 (Why is no real title available?)
- A convergence analysis result for constrained convex minimization problem
- A generalized projection-based scheme for solving convex constrained optimization problems
- A method of projection onto an acute cone with level control in convex minimization
- A variational approach to stochastic minimization of convex functionals
- Convergence analysis of augmented Lagrangian-fast projected gradient method for convex quadratic problems
- Exterior distance function
- Generic convergence of descent methods in Banach spaces
- Genericity in nonlinear analysis
- On Convergence Properties of a Subgradient Method
- On convergence rates of linearized proximal algorithms for convex composite optimization with applications
- On duality gap in linear conic problems
- Optimization on metric and normed spaces
- Regular vector-fields in Banach spaces
- The method of steepest descent for non-linear minimization problems
- The set of divergent descent methods in a Banach space is \(\sigma\)-porous
- Vector duality for convex vector optimization problems by means of the quasi-interior of the ordering cone
Cited in
(6)- Stability of the asymptotic behavior for continuous descent methods with a convex objective function
- Continuous descent methods for the minimization of Lipschitz functions
- scientific article; zbMATH DE number 2064529 (Why is no real title available?)
- Asymptotic Behavior of Continuous Trajectories for Primal-Dual Potential-Reduction Methods
- Inexact descent methods for convex minimization problems in Banach spaces
- Inexact descent methods with convex objective functions in Banach spaces
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5110195)
