Convergence and computational analyses for some variable target value and subgradient deflection methods
type: Item
instance of: scholarly article
title: Convergence and computational analyses for some variable target value and subgradient deflection methods
zbMATH Open document ID: 1153.90574
author: Churlzu Lim
author: Hanif D. Sherali
published in: Computational Optimization and Applications
publication date: 2006-11-17T00:00:00Z
Mathematics Subject Classification ID: 90C56
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 5073603
zbMATH Keywords: nondifferentiable optimization
zbMATH Keywords: Lagrangian relaxation
zbMATH Keywords: variable target value method (VTVM)
zbMATH Keywords: level algorithm
describes a project that uses: CPLEX
describes a project that uses: OR-Library
MaRDI profile type: Publication
full work available at URL: s10589-005-3914-x
OpenAlex ID: W2020202653
cites work: The volume algorithm: Producing primal solutions with a subgradient method
cites work: On the choice of step size in subgradient optimization
cites work: Q3134873
cites work: Q4133397
cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems
cites work: A modified subgradient algorithm for Lagrangean relaxation
cites work: Convergence of a simple subgradient level method
cites work: Validation of subgradient optimization
cites work: Variable target value subgradient method
cites work: Methods of descent for nondifferentiable optimization
cites work: Proximity control in bundle methods for convex nondifferentiable minimization
cites work: Survey of Bundle Methods for Nonsmooth Optimization
cites work: An Algorithm for Constrained Optimization with Semismooth Functions
cites work: Q5566712
cites work: Minimization of unsmooth functionals
cites work: Limited memory space dilation and reduction algorithms
cites work: A variable target value method for nondifferentiable optimization
cites work: On embedding the volume algorithm in a variable target value method.
cites work: Dual formulations and subgradient optimization strategies for linear programming relaxations of mixed-integer programs
cites work: A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems
cites work: Q5655195
cites work: Q5187067
DOI: 10.1007/S10589-005-3914-X
description: scientific article; zbMATH DE number 5073603