A variable target value method for nondifferentiable optimization

DOI10.1016/S0167-6377(99)00063-2zbMath0958.90091WikidataQ127975493 ScholiaQ127975493MaRDI QIDQ1970420

Gyunghyun Choi, Hanif D. Sherali, Cihan H. Tuncbilek

Publication date: 21 March 2000

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

nondifferentiable optimizationsubgradient algorithmconjugate subgradient methodsvariable target value methoddeflected subgradient directions

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56)

Related Items

On proximal subgradient splitting method for minimizing the sum of two nonsmooth convex functions, Service system design for managing interruption risks: a backup-service risk-mitigation strategy, Convergence and computational analyses for some variable target value and subgradient deflection methods, Incorporating location, inventory and price decisions into a supply chain distribution network design problem, A trust region target value method for optimizing nondifferentiable Lagrangian duals of linear programs, Rescheduling optimization of steelmaking-continuous casting process based on the Lagrangian heuristic algorithm, Stochastic programming approach to process flexibility design, Designing service system networks with interruption risks, Dynamic Lagrangian dual and reduced RLT constructs for solving \(0-1\) mixed-integer programs, The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches, On the computational efficiency of subgradient methods: a case study with Lagrangian bounds, An infeasible-point subgradient method using adaptive approximate projections, A Deflected Subgradient Method Using a General Augmented Lagrangian Duality with Implications on Penalty Methods, Globally tight bounds for almost differentiable functions over polytopes with application to tolerance analysis., Higher-level RLT or disjunctive cuts based on a partial enumeration strategy for 0-1 mixed-integer programs, On embedding the volume algorithm in a variable target value method., An inexact modified subgradient algorithm for nonconvex optimization, On a modified subgradient algorithm for dual problems via sharp augmented Lagrangian, Portfolio optimization by minimizing conditional value-at-risk via nondifferentiable optimization, New modeling approaches for the design of local access transport area networks, An efficient optimization procedure for designing a capacitated distribution network with price-sensitive demand

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Proximity control in bundle methods for convex nondifferentiable minimization
• A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems
• Test examples for nonlinear programming codes
• On the choice of step size in subgradient optimization
• Variable target value subgradient method
• Subgradient method with entropic projections for convex nondifferentiable minimization
• Methods of descent for nondifferentiable optimization
• Convex optimization with prescribed accuracy
• On convergence rates of subgradient optimization methods
• Validation of subgradient optimization
• The Efficiency of Subgradient Projection Methods for Convex Optimization, Part II: Implementations and Extensions
• The traveling-salesman problem and minimum spanning trees: Part II
• Limited memory space dilation and reduction algorithms