Spectral projected subgradient with a momentum term for the Lagrangean dual approach
From MaRDI portal
Publication:878598
DOI10.1016/j.cor.2005.11.024zbMath1137.90016OpenAlexW2024804345MaRDI QIDQ878598
Milagros C. Loreto, Alejandro Crema, Marcos Raydan
Publication date: 26 April 2007
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2005.11.024
subgradient optimizationspectral projected gradientset covering problemsgeneralized assignment problems
Related Items
Modified spectral projected subgradient method: convergence analysis and momentum parameter heuristics, Nonsmooth spectral gradient methods for unconstrained optimization, On the computational efficiency of subgradient methods: a case study with Lagrangian bounds, A numerical study of applying spectral-step subgradient method for solving nonsmooth unconstrained optimization problems, A fast gradient and function sampling method for finite-max functions, An online gradient method with momentum for two-layer feedforward neural networks, On parameter acceleration methods for saddle point problems, Convergence analysis for the modified spectral projected subgradient method
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Error stability properties of generalized gradient-type algorithms
- On the projected subgradient method for nonsmooth convex optimization in a Hilbert space
- A genetic algorithm for the generalised assignment problem
- An algorithm for set covering problem
- R-linear convergence of the Barzilai and Borwein gradient method
- Incremental Subgradient Methods for Nondifferentiable Optimization
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- Two-Point Step Size Gradient Methods
- On the Goldstein-Levitin-Polyak gradient projection method
- On convergence rates of subgradient optimization methods
- Modeling Facility Location Problems as Generalized Assignment Problems
- An Incremental Gradient(-Projection) Method with Momentum Term and Adaptive Stepsize Rule
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- A Nonmonotone Line Search Technique for Newton’s Method
- Validation of subgradient optimization
- A Heuristic Method for the Set Covering Problem
- On the Barzilai and Borwein choice of steplength for the gradient method
- Algorithm 813
- Convex programming in Hilbert space
- Integer Programming Algorithms: A Framework and State-of-the-Art Survey
