A trust region target value method for optimizing nondifferentiable Lagrangian duals of linear programs
From MaRDI portal
Publication:857822
DOI10.1007/s00186-006-0071-7zbMath1131.90028OpenAlexW2079788985MaRDI QIDQ857822
Publication date: 5 January 2007
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00186-006-0071-7
Related Items
Dynamic Lagrangian dual and reduced RLT constructs for solving \(0-1\) mixed-integer programs, RLT: A unified approach for discrete and continuous nonconvex optimization, Portfolio optimization by minimizing conditional value-at-risk via nondifferentiable optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Mixed-integer bilinear programming problems
- On embedding the volume algorithm in a variable target value method.
- 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
- Convergence of a simple subgradient level method
- The volume algorithm: Producing primal solutions with a subgradient method
- Ergodic, primal convergence in dual subgradient schemes for convex programming
- A variable target value method for nondifferentiable optimization
- Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- The B<scp>oxstep</scp> Method for Large-Scale Optimization
- An Algorithm for Constrained Optimization with Semismooth Functions
- Validation of subgradient optimization
- Survey of Bundle Methods for Nonsmooth Optimization
- Convex Analysis
- Minimization of unsmooth functionals
- Limited memory space dilation and reduction algorithms
