Exact augmented Lagrangian duality for mixed integer linear programming
From MaRDI portal
Publication:507329
DOI10.1007/s10107-016-1012-8zbMath1364.90226MaRDI QIDQ507329
Shabbir Ahmed, Mohammad Javad Feizollahi, Andy Sun
Publication date: 3 February 2017
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-016-1012-8
90C11: Mixed integer programming
90C46: Optimality conditions and duality in mathematical programming
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
Related Items
On Subadditive Duality for Conic Mixed-integer Programs, Exact Augmented Lagrangian Duality for Mixed Integer Quadratic Programming, Joint tank container demurrage policy and flow optimisation using a progressive hedging algorithm with expanded time-space network, First-order methods for convex optimization, Two-stage robust mixed integer programming problem with objective uncertainty, A progressive hedging based branch-and-bound algorithm for mixed-integer stochastic programs, A parallelized variable fixing process for solving multistage stochastic programs with progressive hedging, Special issue: Global solution of integer, stochastic and nonconvex optimization problems, Revisiting augmented Lagrangian duals, Stochastic dual dynamic programming for multistage stochastic mixed-integer nonlinear optimization, Non-convex nested Benders decomposition, Stochastic Lipschitz dynamic programming, An augmented Lagrangian proximal alternating method for sparse discrete optimization problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Duality and exact penalization for general augmented Lagrangians
- The value function of a mixed integer program: I
- The value function of a mixed integer program. II
- Lagrange-type functions in constrained non-convex optimization.
- On the absence of duality gap for Lagrange-type functions
- Integer and mixed-integer programming models: General properties
- On the augmented Lagrangian dual for integer programming
- A geometric framework for nonconvex optimization duality using augmented Lagrangian functions
- A Nonlinear Lagrangian Approach to Constrained Optimization Problems
- Separation of Nonconvex Sets with General Augmenting Functions
- Calmness and Exact Penalization
- Abstract Convexity and Augmented Lagrangians
- The value function of an integer program
- An Exact Penalization Viewpoint of Constrained Optimization
- On the existence of optimal solutions to integer and mixed-integer programming problems
- A New Approach to Lagrange Multipliers
- Penalty/Barrier Multiplier Methods for Convex Programming Problems
- Variational Analysis
- Penalty functions with a small penalty parameter
- Decreasing Functions with Applications to Penalization
- Nonlinear Augmented Lagrangian and Duality Theory
- The exact penalty map for nonsmooth and nonconvex optimization
- Augmented Lagrange Multiplier Functions and Duality in Nonconvex Programming
- The Zero Duality Gap Property and Lower Semicontinuity of the Perturbation Function
- A Unified Augmented Lagrangian Approach to Duality and Exact Penalization
- Mathematical Programs with Equilibrium Constraints
