scientific article; zbMATH DE number 3634029
From MaRDI portal
Publication:4194749
Cited in
(20)- Optimization with nonsmooth data
- Subgradient methods for sharp weakly convex functions
- Lagrangean relaxation. (With comments and rejoinder).
- A discretization algorithm for nonsmooth convex semi-infinite programming problems based on bundle methods
- A derivative-free trust-region algorithm for composite nonsmooth optimization
- A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem
- A modified proximal point method for DC functions on Hadamard manifolds
- A simple nearly optimal restart scheme for speeding up first-order methods
- A hybrid algorithm of local search for the heterogeneous fixed fleet vehicle routing problem
- First order methods for optimization on Riemannian manifolds
- An infeasible-point subgradient method using adaptive approximate projections
- Iteration-complexity of the subgradient method on Riemannian manifolds with lower bounded curvature
- Proximal Gradient Methods for Machine Learning and Imaging
- A Projected Subgradient Method for the Computation of Adapted Metrics for Dynamical Systems
- Essentials of numerical nonsmooth optimization
- Essentials of numerical nonsmooth optimization
- Statistical performance of subgradient step-size update rules in Lagrangian relaxations of chance-constrained optimization models
- High probability bounds for stochastic subgradient schemes with heavy tailed noise]
- Accelerating level-value adjustment for the Polyak stepsize
- About Lagrangian methods in integer optimization
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 Q4194749)
