Successive smoothing algorithm for solving large-scale optimization models with fixed cost

DOI10.1007/s10479-015-1795-7zbMath1318.90059OpenAlexW1987400080MaRDI QIDQ492827

Mashor Housh, Ximing Cai

Publication date: 21 August 2015

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-015-1795-7

zbMATH Keywords

smoothing techniquesmixed integer linear programmingfixed cost optimization

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26)

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Supply chain design considering economies of scale and transport frequencies
• A least-squares-based method for a class of nonsmooth minimization problems with applications in plasticity
• Strategic design of distribution systems with economies of scale in transportation
• A model and methodologies for the location problem with logistical components
• Enumeration and search procedures for a hub location problem with economies of scale
• Portfolio optimization with linear and fixed transaction costs
• Global optimization versus integer programming in portfolio optimization under nonconvex transaction costs
• The hub location and network design problem with fixed and variable arc costs: formulation and dual-based solution heuristic
• A Conical Algorithm for Globally Minimizing a Concave Function Over a Closed Convex Set
• An Algorithm for $l_1 $-Norm Minimization with Application to Nonlinear $l_1 $-Approximation
• Capacitated facility location/network design problems.
• Selecting portfolios with fixed costs and minimum transaction lots

This page was built for publication: Successive smoothing algorithm for solving large-scale optimization models with fixed cost