Pages that link to "Item:Q1817315"
From MaRDI portal
The following pages link to Rigorous convex underestimators for general twice-differentiable problems (Q1817315):
Displaying 14 items.
- Reverse propagation of McCormick relaxations (Q496587) (← links)
- Convergence analysis of multivariate McCormick relaxations (Q524904) (← links)
- Equivalent formulations of the gradient (Q548192) (← links)
- On the computation of convex robust control invariant sets for nonlinear systems (Q608444) (← links)
- Convergence rate of McCormick relaxations (Q656830) (← links)
- Robust semidefinite programming problems with general nonlinear parameter dependence: approaches using the DC-representations (Q694844) (← links)
- Proof of convergence for a global optimization algorithm for problems with ordinary differential equations (Q811878) (← links)
- Lago: a (heuristic) branch and cut algorithm for nonconvex minlps (Q940828) (← links)
- A new global optimization method for univariate constrained twice-differentiable NLP problems (Q946347) (← links)
- Tight convex underestimators for \({{\mathcal C}^2}\)-continuous problems. I: Univariate functions (Q1024827) (← links)
- Tight convex underestimators for \({\mathcal{C}^2}\)-continuous problems. II: Multivariate functions (Q1024828) (← links)
- Fast construction of constant bound functions for sparse polynomials (Q1029674) (← links)
- Lower bound functions for polynomials (Q1405189) (← links)
- A rigorous deterministic global optimization approach for the derivation of secondary information in digital maps (Q6173797) (← links)
