Accelerating level-value adjustment for the Polyak stepsize
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3634029 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- A Warm-Start Strategy in Interior Point Methods for Shrinking Horizon Model Predictive Control With Variable Discretization Step
- A genetic algorithm with tabu search procedure for flexible job shop scheduling with transportation constraints and bounded processing times
- A simple metaheuristic approach to the simultaneous scheduling of machines and automated guided vehicles
- A survey of algorithms for the generalized assignment problem
- Conditional subgradient optimization -- theory and applications
- Consistency of multidimensional convex regression
- Convergence of a simple subgradient level method
- Convergence of the surrogate Lagrangian relaxation method
- Distributed Subgradient Methods for Convex Optimization Over Random Networks
- Incremental stochastic subgradient algorithms for convex optimization
- Incremental subgradient methods for nondifferentiable optimization
- Lectures on convex optimization
- Minimization of unsmooth functionals
- On convergence rates of subgradient optimization methods
- On the surrogate gradient algorithm for Lagrangian relaxation
- Scheduling. Theory, algorithms, and systems
- Surrogate gradient algorithm for Lagrangian relaxation
This page was built for publication: Accelerating level-value adjustment for the Polyak stepsize
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6952215)
