On the choice of step size in subgradient optimization
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3282977 (Why is no real title available?)
- scientific article; zbMATH DE number 3365044 (Why is no real title available?)
- A Dynamic Programming Approach to Sequencing Problems
- Minimization of unsmooth functionals
- Solution of a Large-Scale Traveling-Salesman Problem
- The Traveling-Salesman Problem and Minimum Spanning Trees
- The traveling-salesman problem and minimum spanning trees: Part II
- Validation of subgradient optimization
Cited in
(36)- An inexact modified subgradient algorithm for nonconvex optimization
- A Lagrangean Relaxation Scheme for Structured Linear Programs With Application To Multicommodity Network Flows
- Capacity analysis in repetitive assemble-to-order manufacturing systems
- On a modified subgradient algorithm for dual problems via sharp augmented Lagrangian
- Mixed-integer bilinear programming problems
- Level bundle-like algorithms for convex optimization
- Dual formulations and subgradient optimization strategies for linear programming relaxations of mixed-integer programs
- A Deflected Subgradient Method Using a General Augmented Lagrangian Duality with Implications on Penalty Methods
- A modified subgradient algorithm for Lagrangean relaxation
- A surrogate heuristic for set covering problems
- Two-direction subgradient method for non-differentiable optimization problems
- Variable target value subgradient method
- Using DEA to obtain efficient solutions for multi-objective 0--1 linear programs
- Cross decomposition applied to the stochastic transportation problem
- An infeasible-point subgradient method using adaptive approximate projections
- Enhanced models and improved solution for competitive biofuel supply chain design under land use constraints
- Lagrangian heuristics for the two-echelon, single-source, capacitated facility location problem
- A Lagrangian relaxation approach to large-scale flow interception problems
- Convergence and computational analyses for some variable target value and subgradient deflection methods
- Modelling and planning public cultural schedules for efficient use of resources
- Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem
- A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems
- Lagrangean relaxation-based techniques for solving facility location problems
- A Langrangean heuristic for the \(p_ k\)-median dynamic location problem
- A comparison of two dual-based procedures for solving the p-median problem
- A branch-and-bound algorithm for the precedence-constrained minimum-cost arborescence problem
- A primal-dual subgradient method for time staged capacity expansion planning
- On some difficult linear programs coming from set partitioning
- Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem
- Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- Weak subgradient method for solving nonsmooth nonconvex optimization problems
- Designing a minimal spanning tree network subject to a budget constraint
- A variable target value method for nondifferentiable optimization
- A class of convergent primal-dual subgradient algorithms for decomposable convex programs
- Models and Lagrangian heuristics for a two-level lot-sizing problem with bounded inventory
This page was built for publication: On the choice of step size in subgradient optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1149883)
