A dynamic convexized method for nonconvex mixed integer nonlinear programming (Q547132): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.cor.2011.02.014 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2011.02.014 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2055342238 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational comparison of some non-linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching and bounds tighteningtechniques for non-convex MINLP / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved branch and bound algorithm for mixed integer nonlinear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: MINLPLib—A Collection of Test Models for Mixed-Integer Nonlinear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coupling genetic algorithm with a grid search method to solve mixed integer nonlinear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A real coded genetic algorithm for solving integer and mixed integer optimization problems / 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: A trust region SQP algorithm for mixed-integer nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving mixed integer nonlinear programs by outer approximation / 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: Generalized Benders decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Review of nonlinear mixed-integer and disjunctive programming techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear equations and optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Test example for nonlinear programming codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective genetic algorithm approach to large scale mixed integer programming problems / 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: Outer approximation algorithms for separable nonconvex mixed-integer nonlinear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrating SQP and branch-and-bound for mixed integer nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm Model for Mixed Variable Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A mixed-integer optimization strategy for oil supply in distribution complexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Checking local optimality in constrained quadratic programming is NP- hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: BARON: A general purpose global optimization software package / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended ant colony optimization for non-convex mixed integer nonlinear programming / 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: Q5692623 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulated annealing with asymptotic convergence for nonlinear constrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving pseudo-convex mixed integer optimization problems by cutting plane techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 778: L-BFGS-B / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete dynamic convexized method for nonlinearly constrained nonlinear integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving nonlinearly constrained global optimization problem via an auxiliary function method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A discrete dynamic convexized method for nonlinear integer programming / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.COR.2011.02.014 / rank
 
Normal rank

Latest revision as of 21:06, 9 December 2024

scientific article
Language Label Description Also known as
English
A dynamic convexized method for nonconvex mixed integer nonlinear programming
scientific article

    Statements

    A dynamic convexized method for nonconvex mixed integer nonlinear programming (English)
    0 references
    0 references
    0 references
    30 June 2011
    0 references
    nonconvex mixed-integer nonlinear programming
    0 references
    local search
    0 references
    auxiliary function
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers