A simple effective heuristic for embedded mixed-integer quadratic programming
From MaRDI portal
Publication:5207801
DOI10.1080/00207179.2017.1316016zbMath1434.90117arXiv1509.08416OpenAlexW2606482332MaRDI QIDQ5207801
Nicholas Moehle, Reza Takapoui, Alberto Bemporad, Stephen P. Boyd
Publication date: 13 January 2020
Published in: International Journal of Control (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1509.08416
Mixed integer programming (90C11) Quadratic programming (90C20) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Training recurrent neural networks by sequential least squares and the alternating direction method of multipliers, A general system for heuristic minimization of convex functions over non-convex sets, Alternating direction method of multipliers for truss topology optimization with limited number of nodes: a cardinality-constrained second-order cone programming approach, Penalty alternating direction methods for mixed-integer optimal control with combinatorial constraints, The voice of optimization, Low-Complexity Method for Hybrid MPC with Local Guarantees, Exact Augmented Lagrangian Duality for Mixed Integer Quadratic Programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- CVXGEN: a code generator for embedded convex optimization
- qpOASES: a parametric active-set algorithm for~quadratic programming
- An alternating direction algorithm for matrix completion with nonnegative factors
- Dual coordinate step methods for linear network flow problems
- On cutting-plane proofs in combinatorial optimization
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Control of systems integrating logic, dynamics, and constraints
- Solving propositional satisfiability problems
- Computational study of a family of mixed-integer quadratic programming problems
- A branch-and-cut method for 0-1 mixed convex programming
- A feasibility pump heuristic for general mixed-integer problems
- Improving the feasibility pump
- Condition numbers and equilibration of matrices
- The feasibility pump
- Introduction to Nonlinear Optimization
- Optimal Parameter Selection for the Alternating Direction Method of Multipliers (ADMM): Quadratic Problems
- Outline of an algorithm for integer solutions to linear programs
- Global Convergence of Splitting Methods for Nonconvex Composite Optimization
- Approximation Algorithms for the Set Covering and Vertex Cover Problems
- Numerical Optimization
- Consensus in Ad Hoc WSNs With Noisy Links—Part I: Distributed Estimation of Deterministic Signals
- Nonconvex Splitting for Regularized Low-Rank + Sparse Decomposition
- On the Linear Convergence of the ADMM in Decentralized Consensus Optimization
- Parallel Algorithms for Constrained Tensor Factorization via Alternating Direction Method of Multipliers
- Consensus-ADMM for General Quadratically Constrained Quadratic Programming
- A universal lattice code decoder for fading channels
- Reducibility among Combinatorial Problems
- Alternating direction method of multipliers for real and complex polynomial optimization models
- On the facial structure of set packing polyhedra
- A Real-Time Iteration Scheme for Nonlinear Optimization in Optimal Feedback Control
- Online Object Tracking With Sparse Prototypes
- Receding Horizon Control
- Local Linear Convergence of the Alternating Direction Method of Multipliers on Quadratic or Linear Programs
- Branch-and-Bound Methods: A Survey
