Convergence and computational analyses for some variable target value and subgradient deflection methods

DOI10.1007/s10589-005-3914-xzbMath1153.90574OpenAlexW2020202653MaRDI QIDQ853561

Hanif D. Sherali, Churlzu Lim

Publication date: 17 November 2006

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-005-3914-x

zbMATH Keywords

Lagrangian relaxationnondifferentiable optimizationlevel algorithmvariable target value method (VTVM)

Mathematics Subject Classification ID

Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56)

Related Items

Integrated production and logistics planning: contract manufacturing and choice of air/surface transportation, Dynamic Lagrangian dual and reduced RLT constructs for solving \(0-1\) mixed-integer programs, An unpaired pickup and delivery problem with time dependent assignment costs: application in air cargo transportation, An infeasible-point subgradient method using adaptive approximate projections, RLT: A unified approach for discrete and continuous nonconvex optimization, Portfolio optimization by minimizing conditional value-at-risk via nondifferentiable optimization, Solving Basis Pursuit

Uses Software

• CPLEX
• OR-Library

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On embedding the volume algorithm in a variable target value method.
• Proximity control in bundle methods for convex nondifferentiable minimization
• 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
• On the choice of step size in subgradient optimization
• Variable target value subgradient method
• Convergence of a simple subgradient level method
• The volume algorithm: Producing primal solutions with a subgradient method
• A variable target value method for nondifferentiable optimization
• Methods of descent for nondifferentiable optimization
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• An Algorithm for Constrained Optimization with Semismooth Functions
• Validation of subgradient optimization
• Survey of Bundle Methods for Nonsmooth Optimization
• Minimization of unsmooth functionals
• A modified subgradient algorithm for Lagrangean relaxation
• Limited memory space dilation and reduction algorithms