Hierarchical distributed optimization of constraint-coupled convex and mixed-integer programs using approximations of the dual function
From MaRDI portal
Publication:6491323
DOI10.1016/J.EJCO.2023.100058MaRDI QIDQ6491323
Achim Wagner, Sebastian Engell, Simon Wenzel, Unnamed Author, Vassilios Yfantis
Publication date: 24 April 2024
Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)
ADMMnonsmooth optimizationsubgradient methodquadratic approximationquasi-Newtonbundle methoddual decompositiondistributed optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- A decomposition method for large scale MILPs, with performance guarantees and a power system application
- Constrained distributed optimization: a population dynamics approach
- An augmented Lagrangian method for distributed optimization
- Interior-point Lagrangian decomposition method for separable convex optimization
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Convergence analysis of some methods for minimizing a nonsmooth convex function
- Introductory lectures on convex optimization. A basic course.
- Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities
- Privacy preserving distributed optimization using homomorphic encryption
- Optimization problems for machine learning: a survey
- Convergence of the surrogate Lagrangian relaxation method
- Fairness measures for decision-making and conflict resolution
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Incremental Subgradient Methods for Nondifferentiable Optimization
- An Augmented Lagrangian Based Algorithm for Distributed NonConvex Optimization
- Introduction to Nonsmooth Optimization
- Benchmarking large-scale distributed convex quadratic programming algorithms
- Julia: A Fresh Approach to Numerical Computing
- Differentially Private Distributed Constrained Optimization
- Accelerated Dual Descent for Network Flow Optimization
- Distributed Optimization and Games: A Tutorial Overview
- A Market-Based Optimization Algorithm for Distributed Systems
- Introduction to Derivative-Free Optimization
- Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
- On the Convergence of a Distributed Augmented Lagrangian Method for Nonconvex Optimization
- Distributed optimization with arbitrary local solvers
- Decentralized Quasi-Newton Methods
- Survey of Bundle Methods for Nonsmooth Optimization
- Constraint-Coupled Distributed Optimization: A Relaxation and Duality Approach
- Distributed Primal Decomposition for Large-Scale MILPs
- Fast Alternating Direction Optimization Methods
- JuMP: A Modeling Language for Mathematical Optimization
- Decomposition method with a variable parameter for a class of monotone variational inequality problems
- A distributed Douglas-Rachford splitting method for multi-block convex minimization problems
This page was built for publication: Hierarchical distributed optimization of constraint-coupled convex and mixed-integer programs using approximations of the dual function