On the choice of step size in subgradient optimization
From MaRDI portal
Publication:1149883
DOI10.1016/0377-2217(81)90096-5zbMath0454.90056OpenAlexW2064986600MaRDI QIDQ1149883
Hanif D. Sherali, Mokhtar S. Bazaraa
Publication date: 1981
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(81)90096-5
Related Items (36)
Capacity analysis in repetitive assemble-to-order manufacturing systems ⋮ A surrogate heuristic for set covering problems ⋮ On some difficult linear programs coming from set partitioning ⋮ Enhanced models and improved solution for competitive biofuel supply chain design under land use constraints ⋮ A class of convergent primal-dual subgradient algorithms for decomposable convex programs ⋮ Convergence and computational analyses for some variable target value and subgradient deflection methods ⋮ Modelling and planning public cultural schedules for efficient use of resources ⋮ Dual formulations and subgradient optimization strategies for linear programming relaxations of mixed-integer programs ⋮ A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems ⋮ A branch-and-bound algorithm for the precedence-constrained minimum-cost arborescence problem ⋮ Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem ⋮ A Lagrangean Relaxation Scheme for Structured Linear Programs With Application To Multicommodity Network Flows ⋮ An infeasible-point subgradient method using adaptive approximate projections ⋮ Designing a minimal spanning tree network subject to a budget constraint ⋮ Variable target value subgradient method ⋮ A variable target value method for nondifferentiable optimization ⋮ A Deflected Subgradient Method Using a General Augmented Lagrangian Duality with Implications on Penalty Methods ⋮ A Langrangean heuristic for the \(p_ k\)-median dynamic location problem ⋮ Mixed-integer bilinear programming problems ⋮ A modified subgradient algorithm for Lagrangean relaxation ⋮ An inexact modified subgradient algorithm for nonconvex optimization ⋮ On a modified subgradient algorithm for dual problems via sharp augmented Lagrangian ⋮ Two-direction subgradient method for non-differentiable optimization problems ⋮ Level bundle-like algorithms for convex optimization ⋮ Models and Lagrangian heuristics for a two-level lot-sizing problem with bounded inventory ⋮ A Lagrangian relaxation approach to large-scale flow interception problems ⋮ A primal-dual subgradient method for time staged capacity expansion planning ⋮ Lagrangian heuristics for the two-echelon, single-source, capacitated facility location problem ⋮ Using DEA to obtain efficient solutions for multi-objective 0--1 linear programs ⋮ An effective implementation of the Lin-Kernighan traveling salesman heuristic ⋮ Lagrangean Relaxation-Based Techniques for Solving Facility Location Problems ⋮ Weak subgradient method for solving nonsmooth nonconvex optimization problems ⋮ A comparison of two dual-based procedures for solving the p-median problem ⋮ Cross decomposition applied to the stochastic transportation problem ⋮ Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems ⋮ Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem
Cites Work
- Unnamed Item
- Unnamed Item
- A Dynamic Programming Approach to Sequencing Problems
- Validation of subgradient optimization
- Solution of a Large-Scale Traveling-Salesman Problem
- The Traveling-Salesman Problem and Minimum Spanning Trees
- Minimization of unsmooth functionals
- The traveling-salesman problem and minimum spanning trees: Part II
This page was built for publication: On the choice of step size in subgradient optimization
