Active set methods with reoptimization for convex quadratic integer programming

DOI10.1007/978-3-319-09174-7_11MaRDI QIDQ3195322zbMATH OpenOpenAlexFDO

Authors Christoph Buchheim, Long Trieu

Publication date 16 October 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-09174-7_11

zbMATH Keywords

few linear constraints, enumeration of the branch-and-bound nodes

Mathematics Subject Classification ID

Quadratic programming (90C20) Convex programming (90C25) Integer programming (90C10)

Recommendations

• A feasible active set method with reoptimization for convex quadratic mixed-integer programming
• An effective branch-and-bound algorithm for convex quadratic integer programming
• An effective branch-and-bound algorithm for convex quadratic integer programming
• Convex quadratic mixed-integer problems with quadratic constraints
• Primal and dual active-set methods for convex quadratic programming

Cites work

• scientific article; zbMATH DE number 5060482 (Why is no real title available?)
• A numerically stable dual method for solving strictly convex quadratic programs
• An Algorithm for Convex Quadratic Programming That Requires O(n^3.5L) Arithmetic Operations
• An Infeasible Active Set Method for Quadratic Problems with Simple Bounds
• An O(n^ 3L) primal interior point algorithm for convex quadratic programming
• An algorithmic framework for convex mixed integer nonlinear programs
• An effective branch-and-bound algorithm for convex quadratic integer programming
• Models and methods of solution of quadratic integer programming problems
• Numerical Experience with Lower Bounds for MIQP Branch-And-Bound
• Optimization Methods in Finance
• SCIP: solving constraint integer programs
• The polynomial solvability of convex quadratic programming

Cited in

(7)

• Complexity and convergence certification of a block principal pivoting method for box-constrained quadratic programs
• A feasible active set method with reoptimization for convex quadratic mixed-integer programming
• Exact Complexity Certification of Active-Set Methods for Quadratic Programming
• A decision space algorithm for multiobjective convex quadratic integer optimization
• An Active-Set Method for Quadratic Programming Based On Sequential Hot-Starts
• An effective branch-and-bound algorithm for convex quadratic integer programming
• An effective branch-and-bound algorithm for convex quadratic integer programming

Describes a project that uses

Uses Software

• CPLEX
• SCIP

This page was built for publication: Active set methods with reoptimization for convex quadratic integer programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3195322)