A generalization of the classical \(\alpha \)BB convex underestimation via diagonal and nondiagonal quadratic terms
From MaRDI portal
Publication:1937084
DOI10.1007/s10957-012-0033-6zbMath1256.90038OpenAlexW1994143266WikidataQ62015642 ScholiaQ62015642MaRDI QIDQ1937084
Ruth Misener, Tapio Westerlund, Anders Skjäl, Christodoulos A. Floudas
Publication date: 11 February 2013
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-012-0033-6
Related Items
A modification of the \(\alpha \mathrm{BB}\) method for box-constrained optimization and an application to inverse kinematics, Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, An edge-concave underestimator for the global optimization of twice-differentiable nonconvex problems, Arbitrarily tight \(\alpha \mathrm{BB}\) underestimators of general non-linear functions over sub-optimal domains, Dynamic optimization of nonlinear systems with guaranteed feasibility of inequality-path-constraints, Tighter \(\alpha \mathrm{BB}\) relaxations through a refinement scheme for the scaled Gerschgorin theorem, A rigorous deterministic global optimization approach for the derivation of secondary information in digital maps, On the efficient Gerschgorin inclusion usage in the global optimization \(\alpha\)BB method, DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs, Performance of convex underestimators in a branch-and-bound framework, An extension of the \(\alpha\mathrm{BB}\)-type underestimation to linear parametric Hessian matrices, New methods for calculating \(\alpha\)BB-type underestimators, Relaxing Nonconvex Quadratic Functions by Multiple Adaptive Diagonal Perturbations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Deterministic global optimization in isothermal reactor network synthesis
- Constraint propagation on quadratic constraints
- Convergence rate of McCormick relaxations
- Generalized McCormick relaxations
- Reformulations in mathematical programming: automatic symmetry detection and exploitation
- A new class of hybrid global optimization algorithms for peptide structure prediction: integrated hybrids
- Proof of convergence for a global optimization algorithm for problems with ordinary differential equations
- A review of recent advances in global optimization
- Existence and sum decomposition of vertex polyhedral convex envelopes
- A new global optimization method for univariate constrained twice-differentiable NLP problems
- Tight convex underestimators for \({{\mathcal C}^2}\)-continuous problems. I: Univariate functions
- Tight convex underestimators for \({\mathcal{C}^2}\)-continuous problems. II: Multivariate functions
- On a class of functions attaining their maximum at the vertices of a polyhedron
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- Handbook of test problems in local and global optimization
- A remark on the GOP algorithm for global optimization
- Decomposition based and branch and bound global optimization approaches for the phase equilibrium problem
- Interval mathematics, algebraic equations and optimization
- Computational experience with a new class of convex underestimators: Box-constrained NLP problems
- A polyhedral branch-and-cut approach to global optimization
- Ab initio tertiary structure prediction of proteins
- Rigorous convex underestimators for general twice-differentiable problems
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- A rigorous global optimization algorithm for problems with ordinary differential equations
- Construction of convex relaxations using automated code generation techniques
- Saddle-point optimality: a look beyond convexity
- Finding all solutions of nonlinearly constrained systems of equations
- 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
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
- Global minimization using an augmented Lagrangian method with variable lower-level constraints
- An algorithm for bounded-error identification of nonlinear systems based on DC functions
- On the functional form of convex underestimators for twice continuously differentiable functions
- On the Liu-Floudas convexification of smooth programs
- A new class of improved convex underestimators for twice continuously differentiable constrained NLPs
- Convex underestimation of twice continuously differentiable functions by piecewise quadratic perturbation: spline \(\alpha\)BB underestimators
- Branching and bounds tighteningtechniques for non-convex MINLP
- Characterization of convexifiable functions
- On two simple decompositions of Lipschitz functions
- The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
- Algorithm 852
- McCormick-Based Relaxations of Algorithms
- Relaxation-Based Bounds for Semi-Infinite Programs
- Interval Methods for Systems of Equations
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Deterministic global optimization in nonlinear optimal control problems
- Filled functions for unconstrained global optimization.
