.png){kind=icon}
Return
Conditional subgradient optimization - Theory and applications
.png){kind=icon}
PRE
AI
DOI：10.1016/0377-2217(94)00200-2.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We generalize the subgradient optimization method for nondifferentiable convex programming to utilize conditional subgradients. Firstly, we derive the new method and establish its convergence by generalizing convergence results for traditional subgradient optimization. Secondly, we consider a particular choice of conditional subgradients, obtained by projections, which leads to an easily implementable modification of traditional subgradient optimization schemes. To evaluate the subgradient projection method we consider its use in three applications: uncapacitated facility location, two-person zero-sum matrix games, and multicommodity network flows. Computational experiments show that the subgradient projection method performs better than traditional subgradient optimization; in some cases the difference is considerable. These results suggest that our simple modification may improve subgradient optimization schemes significantly. This finding is important as such schemes are very popular, especially in the context of Lagrangean relaxation.
Keywords:
convex programming
nonsmooth optimization
subgradient methods
conditional subgradients
Lagrangean relaxation
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
No organization information available
Cited Papers
ShareSave
ShareSaveShareSavePolyak's subgradient method with simplified projection for nondifferentiable optimization with linear constraints.png)
Optimization
OptimizationIF0
PREAI
ShareSave
View more