A modified subgradient algorithm for Lagrangean relaxation
From MaRDI portal
Recommendations
- An improved stepsize of the subgradient algorithm for solving the Lagrangian relaxation problem
- An inexact modified subgradient algorithm for nonconvex optimization
- Modified subgradient extragradient algorithms for variational inequality problems and fixed point problems
- Modified subgradient extragradient method for variational inequality problems
- An inexact modified subgradient algorithm for primal-dual problems via augmented Lagrangians
- Lagrangian Relaxation via Ballstep Subgradient Methods
- A modified subgradient extragradient method for solving the variational inequality problem
- A generalized subgradient method with relaxation step
- The modified subgradient algorithm based on feasible values
- scientific article; zbMATH DE number 2221956
Cites work
- scientific article; zbMATH DE number 3979878 (Why is no real title available?)
- scientific article; zbMATH DE number 4072712 (Why is no real title available?)
- scientific article; zbMATH DE number 3791939 (Why is no real title available?)
- scientific article; zbMATH DE number 3557512 (Why is no real title available?)
- scientific article; zbMATH DE number 477581 (Why is no real title available?)
- A Lagrangian Relaxation Technique for Optimizing Interconnection of Local Area Networks
- A Survey of Lagrangean Techniques for Discrete Optimization
- A computational evaluation of two subgradient search methods
- A generalization of Polyak's convergence result for subgradient optimization
- A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality
- Capacity analysis in repetitive assemble-to-order manufacturing systems
- Conditional subgradient optimization -- theory and applications
- Convergence of a generalized subgradient method for nondifferentiable convex optimization
- Convergence properties of the modified subgradient method of camerini et al
- Lagrangian decomposition and nonsmooth optimization: bundle algorithm, prox iteration, augmented Lagrangian
- Methods of descent for nondifferentiable optimization
- Minimization of unsmooth functionals
- On Poljak's improved subgradient method
- On convergence rates of subgradient optimization methods
- On the choice of step size in subgradient optimization
- Polyak's subgradient method with simplified projection for nondifferentiable optimization with linear constraints
- Solution of a Large-Scale Traveling-Salesman Problem
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- The Traveling-Salesman Problem and Minimum Spanning Trees
- Two-direction subgradient method for non-differentiable optimization problems
- Validation of subgradient optimization
- Variable target value subgradient method
Cited in
(14)- An inexact modified subgradient algorithm for nonconvex optimization
- Modified Active Subspaces Using the Average of Gradients
- On the computational efficiency of subgradient methods: a case study with Lagrangian bounds
- Embedding learning capability in Lagrangean relaxation: an application to the travelling salesman problem
- A Lagrangian relaxation approach to the mixed-product assembly line sequencing problem: a case study of a door-lock company in Taiwan
- A two-point heuristic to calculate the stepsize in subgradient method with application to a network design problem
- Spectral projected subgradient with a momentum term for the Lagrangean dual approach
- Accelerating the convergence of subgradient optimisation
- Convergence and computational analyses for some variable target value and subgradient deflection methods
- An improved stepsize of the subgradient algorithm for solving the Lagrangian relaxation problem
- On the surrogate gradient algorithm for Lagrangian relaxation
- Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers
- Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems
- A modified BFGS bundle algorithm based on approximate subgradients
This page was built for publication: A modified subgradient algorithm for Lagrangean relaxation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5926608)
