A generalization of Polyak's convergence result for subgradient optimization

DOI10.1007/BF02591740zbMath0631.90060MaRDI QIDQ3768688

Bala Shetty, Richard V. Helgason, Ellen P. Allen, Jeffrey L. Kennington

Publication date: 1987

Published in: Mathematical Programming (Search for Journal in Brave)

zbMATH Keywords

subgradient optimizationpractical convergence result

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Related Items (20)

A surrogate heuristic for set covering problems ⋮ On some difficult linear programs coming from set partitioning ⋮ The equal flow problem ⋮ Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem ⋮ Unnamed Item ⋮ Approximate solutions to large scale capacitated facility location problems ⋮ An infeasible-point subgradient method using adaptive approximate projections ⋮ Variable target value subgradient method ⋮ The \(K\)-coverage concentrator location problem ⋮ Configuration of fully replicated distributed database system over wide area networks ⋮ A modified subgradient algorithm for Lagrangean relaxation ⋮ Convergence of the surrogate Lagrangian relaxation method ⋮ Bundle-based relaxation methods for multicommodity capacitated fixed charge network design ⋮ A new forced LMS-based adaptive algorithm utilizing the principle of potential energy ⋮ Planning capacity and safety stocks in a serial production-distribution system with multiple products ⋮ A constrained nonlinear 0-1 program for data allocation ⋮ Weak subgradient method for solving nonsmooth nonconvex optimization problems ⋮ Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems ⋮ Inexact subgradient methods with applications in stochastic programming ⋮ The singly constrained assignment problem: A Lagrangian relaxation heuristic algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The asymmetric m-travelling salesman problem: A duality based branch-and- bound algorithm
• The equal flow problem
• Foundations of optimization
• An Effective Subgradient Procedure for Minimal Cost Multicommodity Flow Problems
• On convergence rates of subgradient optimization methods
• Validation of subgradient optimization
• Convex Analysis
• On systems of inequalities with convex functions in the left sides
• Minimization of unsmooth functionals
• The Relaxation Method for Linear Inequalities
• The Relaxation Method for Linear Inequalities

This page was built for publication: A generalization of Polyak's convergence result for subgradient optimization