Partially distributed outer approximation

DOI10.1007/s10898-021-01015-0zbMath1473.90094arXiv1911.08296OpenAlexW3153922631MaRDI QIDQ2046262

Alexander Murray, Veit Hagenmeyer, Timm Faulwasser, Mario E. Villanueva, Boris Houska

Publication date: 17 August 2021

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1911.08296

zbMATH Keywords

global optimizationouter approximationmixed integer programmingdistributed optimization

Mathematics Subject Classification ID

Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26)

Related Items

Distributed primal outer approximation algorithm for sparse convex programming with separable structures

Uses Software

• CPLEX
• Gurobi
• Bonmin
• CasADi
• extended-MIQCP
• Decogo

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• extended-MIQCP
• Reformulations for utilizing separability when solving convex MINLP problems
• An algorithmic framework for convex mixed integer nonlinear programs
• Augmented lagrangians in semi-infinite programming
• Partitioning procedures for solving mixed-variables programming problems
• On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
• A dual algorithm for the solution of nonlinear variational problems via finite element approximation
• An improved branch and bound algorithm for mixed integer nonlinear programs
• Solving mixed integer nonlinear programs by outer approximation
• Extended formulations in mixed integer conic quadratic programming
• Lift-and-project cuts for convex mixed integer nonlinear programs
• CasADi: a software framework for nonlinear optimization and optimal control
• Decomposition-based inner- and outer-refinement algorithms for global optimization
• A polyhedral branch-and-cut approach to global optimization
• Polyhedral approximation in mixed-integer convex optimization
• Outer approximation algorithms for separable nonconvex mixed-integer nonlinear programs
• The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming
• Using regularization and second order information in outer approximation for convex MINLP
• Coordinate descent algorithms
• Generalized Benders decomposition
• An Augmented Lagrangian Based Algorithm for Distributed NonConvex Optimization
• Algorithms and Software for Convex Mixed Integer Nonlinear Programs
• An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs
• Decomposition Principle for Linear Programs
• Multi-Tree Decomposition Methods for Large-Scale Mixed Integer Nonlinear Optimization
• On Augmented Lagrangian Methods with General Lower-Level Constraints
• Polyhedral Approaches to Mixed Integer Linear Programming
• Branch and Bound Experiments in Convex Nonlinear Integer Programming
• An outer-approximation algorithm for a class of mixed-integer nonlinear programs
• Some NP-complete problems in quadratic and nonlinear programming
• Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
• Application of a Smoothing Technique to Decomposition in Convex Optimization
• On the generalization of ECP and OA methods to nonsmooth convex MINLP problems
• Convex Analysis
• Some Properties of the Augmented Lagrangian in Cone Constrained Optimization
• Integrating SQP and branch-and-bound for mixed integer nonlinear programming
• Convergence of a block coordinate descent method for nondifferentiable minimization