A generalization of Polyak's convergence result for subgradient optimization
From MaRDI portal
Recommendations
Cites work
- An Effective Subgradient Procedure for Minimal Cost Multicommodity Flow Problems
- Convex Analysis
- Foundations of optimization
- scientific article; zbMATH DE number 3628731 (Why is no real title available?)
- scientific article; zbMATH DE number 3797099 (Why is no real title available?)
- scientific article; zbMATH DE number 3894826 (Why is no real title available?)
- scientific article; zbMATH DE number 3282977 (Why is no real title available?)
- scientific article; zbMATH DE number 3189475 (Why is no real title available?)
- Minimization of unsmooth functionals
- On convergence rates of subgradient optimization methods
- On systems of inequalities with convex functions in the left sides
- The asymmetric m-travelling salesman problem: A duality based branch-and- bound algorithm
- The equal flow problem
- The Relaxation Method for Linear Inequalities
- The Relaxation Method for Linear Inequalities
- Validation of subgradient optimization
Cited in
(27)- Two ``well-known properties of subgradient optimization
- On Poljak's improved subgradient method
- The equal flow problem
- Variable target value subgradient method
- The \(K\)-coverage concentrator location problem
- Configuration of fully replicated distributed database system over wide area networks
- A constrained nonlinear 0-1 program for data allocation
- Inexact subgradient methods with applications in stochastic programming
- The singly constrained assignment problem: A Lagrangian relaxation heuristic algorithm
- A surrogate heuristic for set covering problems
- On some difficult linear programs coming from set partitioning
- Approximate Rolle's theorems for the proximal subgradient and the generalized gradient.
- Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems
- Planning capacity and safety stocks in a serial production-distribution system with multiple products
- Convergence of the surrogate Lagrangian relaxation method
- Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem
- Ergodic convergence in subgradient optimization with application to simplical decomposition of convex programs
- Continuous min-max programs with semi-infinite constraints
- An infeasible-point subgradient method using adaptive approximate projections
- Weak subgradient method for solving nonsmooth nonconvex optimization problems
- A subgradient algorithm with dynamic step sizes
- A modified subgradient algorithm for Lagrangean relaxation
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
- A new forced LMS-based adaptive algorithm utilizing the principle of potential energy
- About some works of Boris Polyak on convergence of gradient methods and their development
- Statistical performance of subgradient step-size update rules in Lagrangian relaxations of chance-constrained optimization models
- Approximate solutions to large scale capacitated facility location problems
This page was built for publication: A generalization of Polyak's convergence result for subgradient optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3768688)
