A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs (Q2010085): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: GDXMRW / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CPLEX / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: ANTIGONE / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963548325 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1802.07342 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4331736 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization of mixed-integer nonlinear programs: a theoretical and computational study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonconvex generalized Benders decomposition for stochastic separable mixed-integer nonlinear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of test problems in local and global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving an Electricity Generating Capacity Expansion Planning Problem by Generalized Benders' Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Separable Nonconvex Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Separable Nonconvex Programming Problems II: Nonconvex Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-Price: Column Generation for Solving Huge Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangean decomposition: A model yielding stronger lagrangean bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Validation of subgradient optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cross decomposition for mixed integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new cross decomposition method for stochastic mixed-integer linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-reduce approach to global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A framework for globally optimizing mixed-integer signomial programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Stochastic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>L</i>-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal design of mixed AC-DC distribution systems for commercial buildings: a nonconvex generalized Benders decomposition approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning procedures for solving mixed-variables programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Benders decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-bound method for discretely-constrained mathematical programs with equilibrium constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Cross Decomposition Algorithm for Capacitated Facility Location / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence of cross decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mean value cross decomposition applied to integer programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cross-decomposition scheme with integrated primal-dual multi-cuts for two-stage stochastic programming investment planning problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual decomposition in stochastic integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5630824 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multicut algorithm for two-stage stochastic linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: SCIP: solving constraint integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: CONOPT—A Large-Scale GRG Code / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Proximal‐Projection Bundle Method for Lagrangian Relaxation, Including Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of convex relaxations using automated code generation techniques / rank
 
Normal rank

Latest revision as of 03:52, 21 July 2024

scientific article
Language Label Description Also known as
English
A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs
scientific article

    Statements

    A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs (English)
    0 references
    0 references
    0 references
    3 December 2019
    0 references
    generalized Benders decomposition
    0 references
    Dantzig-Wolfe decomposition
    0 references
    Lagrangian decomposition
    0 references
    joint decomposition
    0 references
    mixed integer nonlinear programming
    0 references
    global optimization
    0 references
    stochastic programming
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers