A Feasible Active Set Method with Reoptimization for Convex Quadratic Mixed-Integer Programming (Q2817838): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1512.02369 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SCIP: solving constraint integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On mixed integer quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization of a quadratic function subject to a bounded mixed integer constraint set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Projected Newton Methods for Optimization Problems with Simple Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3151174 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational study of a family of mixed-integer quadratic programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithmic framework for convex mixed integer nonlinear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective branch-and-bound algorithm for convex quadratic integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Active Set Methods with Reoptimization for Convex Quadratic Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization Methods in Finance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inexact Newton Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical Experience with Lower Bounds for MIQP Branch-And-Bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: A truncated Newton method with non-monotone line search for unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed-integer quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved algorithm for mixed-integer quadratic programs and a computational study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4164734 / rank
 
Normal rank

Latest revision as of 12:00, 12 July 2024

scientific article
Language Label Description Also known as
English
A Feasible Active Set Method with Reoptimization for Convex Quadratic Mixed-Integer Programming
scientific article

    Statements

    A Feasible Active Set Method with Reoptimization for Convex Quadratic Mixed-Integer Programming (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    2 September 2016
    0 references
    integer programming
    0 references
    quadratic programming
    0 references
    global optimization
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references