A generalization of the classical \(\alpha \)BB convex underestimation via diagonal and nondiagonal quadratic terms (Q1937084): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Branching and bounds tighteningtechniques for non-convex MINLP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4331736 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A review of recent advances in global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selected papers presented at the conference on the state of the art in global optimization: computational methods and applications, Princeton, NJ, USA, April 28-30, 1995 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reformulation-linearization technique for solving discrete and continuous nonconvex problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational experience with a new class of convex underestimators: Box-constrained NLP problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new class of improved convex underestimators for twice continuously differentiable constrained NLPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A remark on the GOP algorithm for global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding all solutions of nonlinearly constrained systems of equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reformulations in mathematical programming: automatic symmetry detection and exploitation / 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: Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: McCormick-Based Relaxations of Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized McCormick relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence rate of McCormick relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of convex relaxations using automated code generation techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Liu-Floudas convexification of smooth programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of convexifiable functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Saddle-point optimality: a look beyond convexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On two simple decompositions of Lipschitz functions / 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: Rigorous convex underestimators for general twice-differentiable problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new global optimization method for univariate constrained twice-differentiable NLP problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global minimization using an augmented Lagrangian method with variable lower-level constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for bounded-error identification of nonlinear systems based on DC functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic global optimization in nonlinear optimal control problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic global optimization in isothermal reactor network synthesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Filled functions for unconstrained global optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ab initio tertiary structure prediction of proteins / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new class of hybrid global optimization algorithms for peptide structure prediction: integrated hybrids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition based and branch and bound global optimization approaches for the phase equilibrium problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxation-Based Bounds for Semi-Infinite Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A rigorous global optimization algorithm for problems with ordinary differential equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of convergence for a global optimization algorithm for problems with ordinary differential equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the functional form of convex underestimators for twice continuously differentiable functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5301184 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex underestimation of twice continuously differentiable functions by piecewise quadratic perturbation: spline \(\alpha\)BB underestimators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight convex underestimators for \({{\mathcal C}^2}\)-continuous problems. I: Univariate functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight convex underestimators for \({\mathcal{C}^2}\)-continuous problems. II: Multivariate functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval Methods for Systems of Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval mathematics, algebraic equations and optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint propagation on quadratic constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4479208 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a class of functions attaining their maximum at the vertices of a polyhedron / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existence and sum decomposition of vertex polyhedral convex envelopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of test problems in local and global optimization / rank
 
Normal rank

Latest revision as of 05:14, 6 July 2024

scientific article
Language Label Description Also known as
English
A generalization of the classical \(\alpha \)BB convex underestimation via diagonal and nondiagonal quadratic terms
scientific article

    Statements

    A generalization of the classical \(\alpha \)BB convex underestimation via diagonal and nondiagonal quadratic terms (English)
    0 references
    0 references
    0 references
    0 references
    11 February 2013
    0 references
    0 references
    global optimization
    0 references
    \(\alpha \)BB
    0 references
    convex relaxations
    0 references
    nonconvex optimization
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references