A Feasible Active Set Method with Reoptimization for Convex Quadratic Mixed-Integer Programming
From MaRDI portal
Publication:2817838
DOI10.1137/140978971zbMath1346.90608arXiv1512.02369OpenAlexW2962794963MaRDI QIDQ2817838
Stefano Lucidi, Christoph Buchheim, Long Trieu, Francesco Rinaldi, Marianna De Santis
Publication date: 2 September 2016
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1512.02369
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Quadratic programming (90C20)
Related Items
A two-stage active-set algorithm for bound-constrained optimization, A decision space algorithm for multiobjective convex quadratic integer optimization, SDP-based branch-and-bound for non-convex quadratic integer optimization, A Frank-Wolfe based branch-and-bound algorithm for mean-risk optimization, A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization, Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods, A block active set algorithm with spectral choice line search for the symmetric eigenvalue complementarity problem, Dual approaches for a specific class of integer nonlinear programming problems, Branching with hyperplanes in the criterion space: the frontier partitioner algorithm for biobjective integer programming, An active set algorithm for robust combinatorial optimization based on separation oracles, ``Active-set complexity of proximal gradient: how long does it take to find the sparsity pattern?, An active-set algorithmic framework for non-convex optimization problems over the simplex
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- An effective branch-and-bound algorithm for convex quadratic integer programming
- SCIP: solving constraint integer programs
- An algorithmic framework for convex mixed integer nonlinear programs
- A truncated Newton method with non-monotone line search for unconstrained optimization
- Computational study of a family of mixed-integer quadratic programming problems
- Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
- Global optimization of a quadratic function subject to a bounded mixed integer constraint set
- Active Set Methods with Reoptimization for Convex Quadratic Integer Programming
- Optimization Methods in Finance
- Improved algorithm for mixed-integer quadratic programs and a computational study
- Mixed-integer quadratic programming
- Inexact Newton Methods
- On mixed integer quadratic programs
- Numerical Optimization
- Numerical Experience with Lower Bounds for MIQP Branch-And-Bound
- Projected Newton Methods for Optimization Problems with Simple Constraints
- Benchmarking optimization software with performance profiles.
