A feasibility-ensured Lagrangian heuristic for general decomposable problems

DOI10.1007/s43069-021-00094-9zbMath1478.90078OpenAlexW3209612278MaRDI QIDQ2068837

Kouhei Harada

Publication date: 20 January 2022

Published in: SN Operations Research Forum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s43069-021-00094-9

zbMATH Keywords

Lagrangian relaxationextreme pointconvexificationLagrangian heuristicdecomposable problemprimal feasibility

Mathematics Subject Classification ID

Semidefinite programming (90C22) Convex programming (90C25)

Uses Software

• PLCP
• SQPlab

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A decomposition method for large scale MILPs, with performance guarantees and a power system application
• Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies
• Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines
• A Lagrangian heuristic for satellite range scheduling with resource constraints
• Applications of second-order cone programming
• A Lagrangian-based heuristic for large-scale set covering problems
• Lagrangean heuristics for location problems
• Approximations in proximal bundle methods and decomposition of convex programs
• Ergodic, primal convergence in dual subgradient schemes for convex programming
• Nonlinear integer programming
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• Approximate Primal Solutions and Rate Analysis for Dual Subgradient Methods
• A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Estimates of the Duality Gap in Nonconvex Optimization
• A Lagrangean Relaxation Scheme for Structured Linear Programs With Application To Multicommodity Network Flows
• A globally convergent primal-dual interior point method for constrained optimization
• The Traveling-Salesman Problem and Minimum Spanning Trees
• Numerical optimization. Theoretical and practical aspects. Transl. from the French