Polyhedral approximation in mixed-integer convex optimization (Q1800994): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(18 intermediate revisions by 6 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: SCIP-SDP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MINOTAUR / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SCIP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Gurobi / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: KNITRO / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: FilMINT / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Convex.jl / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: extended-MIQCP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: DrAmpl / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: XPRESS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MINLPLib / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CVXPY / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: JuMP / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3100148269 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1607.03566 / rank
 
Normal rank
Property / cites work
 
Property / cites work: FilMINT: An Outer Approximation-Based Solver for Convex Mixed-Integer Nonlinear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: SCIP: solving constraint integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-hardness of deciding convexity of quartic polynomials and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed-integer nonlinear optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on Modern Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3151174 / 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: Algorithms and Software for Convex Mixed Integer Nonlinear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On branching rules for convex mixed-integer nonlinear optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5493572 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex programming for disjunctive convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: CVXPY: A Python-Embedded Modeling Language for Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: JuMP: A Modeling Language for Mathematical Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An outer-approximation algorithm for a class of mixed-integer nonlinear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: DrAmpl: A meta solver for optimization problem analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Implementations for Nonsmooth Convex Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5492525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perspective Reformulation and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch and Bound Experiments in Convex Nonlinear Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Different transformations for solving non-convex trim-loss problems by MINLP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Differential properties of Euclidean projection onto power cone / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint qualification failure in action / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3141900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 50 Years of Integer Programming 1958-2008 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of second-order cone programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended Formulations in Mixed-Integer Convex Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4265265 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polyhedral branch-and-cut approach to global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enhanced mixed integer programming techniques and routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended formulations in mixed integer conic quadratic programming / rank
 
Normal rank

Latest revision as of 03:16, 17 July 2024

scientific article
Language Label Description Also known as
English
Polyhedral approximation in mixed-integer convex optimization
scientific article

    Statements

    Polyhedral approximation in mixed-integer convex optimization (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    26 October 2018
    0 references
    0 references
    convex MINLP
    0 references
    outer approximation
    0 references
    disciplined convex programming
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references