4.5 Article

Convergence rate of McCormick relaxations

相关参考文献

注意:仅列出部分参考文献,下载原文获取全部文献信息。
Article Operations Research & Management Science

The theoretical and empirical rate of convergence for geometric branch-and-bound methods

Anita Schoebel et al.

JOURNAL OF GLOBAL OPTIMIZATION (2010)

Article Computer Science, Software Engineering

Branching and bounds tightening techniques for non-convex MINLP

Pietro Belotti et al.

OPTIMIZATION METHODS & SOFTWARE (2009)

Article Mathematics, Applied

MCCORMICK-BASED RELAXATIONS OF ALGORITHMS

Alexander Mitsos et al.

SIAM JOURNAL ON OPTIMIZATION (2009)

Article Operations Research & Management Science

Tight convex underestimators for C2-continuous problems:: II.: multivariate functions

Chrysanthos E. Gounaris et al.

JOURNAL OF GLOBAL OPTIMIZATION (2008)

Article Operations Research & Management Science

Tight convex underestimators for C2-continuous problems:: I.: univariate functions

Chrysanthos E. Gounaris et al.

JOURNAL OF GLOBAL OPTIMIZATION (2008)

Article Mathematics, Applied

Relaxation-based bounds for semi-infinite programs

Alexander Mitsos et al.

SIAM JOURNAL ON OPTIMIZATION (2008)

Article Operations Research & Management Science

On the Liu-Floudas convexification of smooth programs

S Zlobec

JOURNAL OF GLOBAL OPTIMIZATION (2005)

Article Computer Science, Software Engineering

A polyhedral branch-and-cut approach to global optimization

M Tawarmalani et al.

MATHEMATICAL PROGRAMMING (2005)

Article Computer Science, Software Engineering

Global solution of semi-infinite programs

B Bhattacharjee et al.

MATHEMATICAL PROGRAMMING (2005)

Article Operations Research & Management Science

Interval methods for semi-infinite programs

B Bhattacharjee et al.

COMPUTATIONAL OPTIMIZATION AND APPLICATIONS (2005)

Article Computer Science, Software Engineering

Global optimization of mixed-integer nonlinear programs: A theoretical and computational study

M Tawarmalani et al.

MATHEMATICAL PROGRAMMING (2004)

Article Operations Research & Management Science

A new class of improved convex underestimators for twice continuously differentiable constrained NLPs

IG Akrotirianakis et al.

JOURNAL OF GLOBAL OPTIMIZATION (2004)

Article Operations Research & Management Science

Computational experience with a new class of convex underestimators: Box-constrained NLP problems

IG Akrotirianakis et al.

JOURNAL OF GLOBAL OPTIMIZATION (2004)

Article Engineering, Multidisciplinary

Construction of Convex Relaxations Using Automated Code Generation Techniques

Edward P. Gatzke et al.

OPTIMIZATION AND ENGINEERING (2002)

Article Operations Research & Management Science

Analysis of bounds for multilinear functions

HS Ryoo et al.

JOURNAL OF GLOBAL OPTIMIZATION (2001)

Review Mathematics, Applied

Interval analysis: theory and applications

G Alefeld et al.

JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS (2000)