Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints (Q2355020): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: BARON / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11750-015-0387-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W615245433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\alpha BB\): A global optimization method for general constrained nonconvex problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal centered forms / 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: Undercover: a primal MINLP heuristic exploring a largest sub-MIP / 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: On convex relaxations of quadrilinear terms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A storm of feasibility pumps for nonconvex MINLP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rigorous verification of feasibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual bounding procedures lead to convergent branch-and-bound algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of problems where dual bounds beat underestimation bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic global optimization. Theory, methods and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using Piecewise Linear Functions for Solving MINLPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Test examples for nonlinear programming codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4889854 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critical sets in parametric optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On proving existence of feasible points in equality constrained optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On rigorous upper bounds to a global optimum / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Cutting-Plane Method for Solving Convex Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: PROFIL/BIAS - A fast interval library / rank
 
Normal rank
Property / cites work
 
Property / cites work: Die zentrische Form in der Intervallarithmetik, ihre quadratische Konvergenz und ihre Inklusionsisotonie / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex envelopes of monomials of odd degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3677502 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Piecewise-linear approximations of multidimensional functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: GLOMIQO: global mixed-integer quadratic optimizer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval Methods for Systems of Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A metaheuristic methodology based on the limitation of the memory of interval branch and bound algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch- and bound algorithms for solving global optimization problems with Lipschitzian structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplicial Global Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variational Analysis / 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: Global optimization of mixed-integer nonlinear programs: a theoretical and computational study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5462195 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \({{\mathcal {D}(\mathcal {C})}}\)-optimization and robust global optimization / rank
 
Normal rank

Latest revision as of 13:19, 10 July 2024

scientific article
Language Label Description Also known as
English
Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints
scientific article

    Statements

    Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    27 July 2015
    0 references
    branch-and-bound
    0 references
    convergence
    0 references
    consistency
    0 references
    mangasarian-fromovitz constraint qualification
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers