A feasible active set method with reoptimization for convex quadratic mixed-integer programming
From MaRDI portal
Abstract: We propose a feasible active set method for convex quadratic programming problems with non-negativity constraints. This method is specifically designed to be embedded into a branch-and-bound algorithm for convex quadratic mixed integer programming problems. The branch-and-bound algorithm generalizes the approach for unconstrained convex quadratic integer programming proposed by Buchheim, Caprara and Lodi to the presence of linear constraints. The main feature of the latter approach consists in a sophisticated preprocessing phase, leading to a fast enumeration of the branch-and-bound nodes. Moreover, the feasible active set method takes advantage of this preprocessing phase and is well suited for reoptimization. Experimental results for randomly generated instances show that the new approach significantly outperforms the MIQP solver of CPLEX 12.6 for instances with a small number of constraints.
Recommendations
- Active set methods with reoptimization for convex quadratic integer programming
- Convex quadratic mixed-integer problems with quadratic constraints
- An effective branch-and-bound algorithm for convex quadratic integer programming
- An effective branch-and-bound algorithm for convex quadratic integer programming
- A branch and bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation
Cites work
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 3597791 (Why is no real title available?)
- A truncated Newton method with non-monotone line search for unconstrained optimization
- Active set methods with reoptimization for convex quadratic integer programming
- An algorithmic framework for convex mixed integer nonlinear programs
- An effective branch-and-bound algorithm for convex quadratic integer programming
- Benchmarking optimization software with performance profiles.
- Computational study of a family of mixed-integer quadratic programming problems
- Global optimization of a quadratic function subject to a bounded mixed integer constraint set
- Improved algorithm for mixed-integer quadratic programs and a computational study
- Inexact Newton Methods
- Mixed-integer quadratic programming
- Numerical Experience with Lower Bounds for MIQP Branch-And-Bound
- Numerical Optimization
- On mixed integer quadratic programs
- Optimization Methods in Finance
- Projected Newton Methods for Optimization Problems with Simple Constraints
- Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
- SCIP: solving constraint integer programs
Cited in
(15)- A two-stage active-set algorithm for bound-constrained optimization
- A Frank-Wolfe based branch-and-bound algorithm for mean-risk optimization
- Using dual relaxations in multiobjective mixed-integer convex quadratic programming
- Active set methods with reoptimization for convex quadratic integer programming
- Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods
- An active-set algorithmic framework for non-convex optimization problems over the simplex
- Branching with hyperplanes in the criterion space: the frontier partitioner algorithm for biobjective integer programming
- ``Active-set complexity of proximal gradient: how long does it take to find the sparsity pattern?
- A decision space algorithm for multiobjective convex quadratic integer optimization
- Convex mixed-integer optimization with Frank-Wolfe methods
- Active-constraint variable ordering for faster feasibility of mixed integer linear programs
- A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization
- Dual approaches for a specific class of integer nonlinear programming problems
- SDP-based branch-and-bound for non-convex quadratic integer optimization
- A block active set algorithm with spectral choice line search for the symmetric eigenvalue complementarity problem
This page was built for publication: A feasible active set method with reoptimization for convex quadratic mixed-integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2817838)
