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

DOI10.1007/S10479-015-1795-7zbMATH Open1318.90059OpenAlexW1987400080MaRDI QIDQ492827FDOQ492827

Authors: 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

Recommendations

• Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems
• Solving the fixed charge problem with Lagrangian relaxation and cost allocation heuristics
• Inexact smoothing method for large scale minimax optimization
• scientific article; zbMATH DE number 409561
• An enhanced dynamic slope scaling procedure with tabu scheme for fixed charge network flow problems

zbMATH Keywords

mixed integer linear programmingsmoothing techniquesfixed cost optimization

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Portfolio optimization with linear and fixed transaction costs
• Capacitated facility location/network design problems.
• The hub location and network design problem with fixed and variable arc costs: formulation and dual-based solution heuristic
• Title not available (Why is that?)
• Selecting portfolios with fixed costs and minimum transaction lots
• A model and methodologies for the location problem with logistical components
• Enumeration and search procedures for a hub location problem with economies of scale
• Supply chain design considering economies of scale and transport frequencies
• Strategic design of distribution systems with economies of scale in transportation
• Global optimization versus integer programming in portfolio optimization under nonconvex transaction costs
• Title not available (Why is that?)
• 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
• A least-squares-based method for a class of nonsmooth minimization problems with applications in plasticity

Cited In (1)

• A sequential smoothing algorithm with linear computational cost

Uses Software

• CPLEX

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q492827)