Rigorous convex underestimators for general twice-differentiable problems
From MaRDI portal
Publication:1817315
DOI10.1007/BF00121749zbMath0862.90114OpenAlexW1981367768MaRDI QIDQ1817315
Claire S. Adjiman, Christodoulos A. Floudas
Publication date: 25 May 1997
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00121749
nonconvex twice-differentiable optimizationunderestimation procedurevalid convex lower bounding problems
Related Items
Characterizing zero-derivative points, An edge-concave underestimator for the global optimization of twice-differentiable nonconvex problems, Convergence-order analysis of branch-and-bound algorithms for constrained problems, Optimal deterministic algorithm generation, On the computation of convex robust control invariant sets for nonlinear systems, Convex and concave relaxations of implicit functions, The cluster problem in constrained global optimization, A generalization of the classical \(\alpha \)BB convex underestimation via diagonal and nondiagonal quadratic terms, Lower bound functions for polynomials, A rigorous deterministic global optimization approach for the derivation of secondary information in digital maps, Convergence rate of McCormick relaxations, New quadratic lower bound for multivariate functions in global optimization, On the functional form of convex underestimators for twice continuously differentiable functions, Lago: a (heuristic) branch and cut algorithm for nonconvex minlps, Reverse propagation of McCormick relaxations, A new global optimization method for univariate constrained twice-differentiable NLP problems, A set-membership state estimation algorithm based on DC programming, Multivariate McCormick relaxations, Convergence analysis of multivariate McCormick relaxations, Robust semidefinite programming problems with general nonlinear parameter dependence: approaches using the DC-representations, Equivalent formulations of the gradient, Supporting Global Numerical Optimization of Rational Functions by Generic Symbolic Convexity Tests, Convergent upper bounds in global minimization with nonlinear equality constraints, Trigonometric convex underestimator for the base functions in Fourier space, On tightness and anchoring of McCormick and other relaxations, Performance of convex underestimators in a branch-and-bound framework, Preface, Integrated multi-site aggregate production-pricing planning in a two-echelon supply chain with multiple demand classes, Tight convex underestimators for \({{\mathcal C}^2}\)-continuous problems. I: Univariate functions, Tight convex underestimators for \({\mathcal{C}^2}\)-continuous problems. II: Multivariate functions, Fast construction of constant bound functions for sparse polynomials, Proof of convergence for a global optimization algorithm for problems with ordinary differential equations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A collection of test problems for constrained global optimization algorithms
- Global minimum potential energy conformations of small molecules
- Primal-relaxed dual global optimization approach
- Finding all solutions of nonlinearly constrained systems of equations
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
- Global optimization for molecular conformation problems
- Jointly Constrained Biconvex Programming
- Interval Methods for Systems of Equations
