The following pages link to Claire S. Adjiman (Q480822):
Displaying 17 items.
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development (Q480823) (← links)
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. Part II: Convergence analysis and numerical results (Q480824) (← links)
- Enclosure of all index-1 saddle points of general nonlinear functions (Q513158) (← links)
- Proof of convergence for a global optimization algorithm for problems with ordinary differential equations (Q811878) (← links)
- Handbook of test problems in local and global optimization (Q1304172) (← links)
- (Q1668798) (redirect page) (← links)
- Arbitrarily tight \(\alpha \mathrm{BB}\) underestimators of general non-linear functions over sub-optimal domains (Q1668799) (← links)
- Rigorous convex underestimators for general twice-differentiable problems (Q1817315) (← links)
- A rigorous global optimization algorithm for problems with ordinary differential equations (Q1862172) (← links)
- New bounding schemes and algorithmic options for the Branch-and-Sandwich algorithm (Q2176276) (← links)
- Tighter \(\alpha \mathrm{BB}\) relaxations through a refinement scheme for the scaled Gerschgorin theorem (Q2416572) (← links)
- (Q4247436) (← links)
- (Q4395340) (← links)
- (Q4464655) (← links)
- (Q4552723) (← links)
- An interval-matrix branch-and-bound algorithm for bounding eigenvalues (Q4594837) (← links)
- A deterministic optimization algorithm for nonconvex and combinatorial bi-objective programming (Q6749950) (← links)
