Nonperturbative renormalization group approach to turbulence

We suggest a new, renormalization group (RG) based, nonperturbative method for treating the intermittency problem of fully developed turbulence which also includes the effects of a finite boundary of the turbulent flow. The key idea is not to try to construct an elimination procedure based on some assumed statistical distribution, but to make an ansatz for possible RG transformations and to pose constraints upon those, which guarantee the invariance of the nonlinear term in the Navier-Stokes equation, the invariance of the energy dissipation, and other basic properties of the velocity field. The role of length scales is taken to be inverse to that in the theory of critical phenomena; thus possible intermittency corrections are connected with the outer length scale. Depending on the specific type of flow, we find different sets of admissible transformations with distinct scaling behaviour: for the often considered infinite, isotropic, and homogeneous system K41 scaling is enforced, but for the more realistic plane Couette geometry no restrictions on intermittency exponents were obtained so far. Received: 28 December 1997 / Accepted: 6 August 1998     

Using regularization and second order information in outer approximation for convex MINLP

Mathematical Programming - In this paper, we present two new methods for solving convex mixed-integer nonlinear programming problems based on the outer approximation method. The first method is...     

Buchbesprechungen

Ohne Zusammenfassung

---

Book reviews

     

Comparison principles applied to obstacle problems with penalties

Penalty methods form a well known technique to embed elliptic variational inequality problems into a family of variational equations (cf. [6], [13], [17]). Using the specific inverse monotonicity properties of these problems L _∞-bounds for the convergence can be derived by means of comparison solutions. Lagrange duality is applied to estimate parameters involved.

For piecewise linear finite elements applied on weakly acute triangulations in combination with mass lumping the inverse monotonicity of the obstacle problems can be transferred to its discretization. This forms the base of similar error estimations in the maximum norm for the penalty method applied to the discrete problem.

The technique of comparison solutions combined with the uniform boundedness of the Lagrange multipliers leads to decoupled convergence estimations with respect to the discretization and penalization parameters.     

An algorithmic framework for convex mixed integer nonlinear programs

This paper is motivated by the fact that mixed integer nonlinear programming is an important and difficult area for which there is a need for developing new methods and software for solving large-scale problems. Moreover, both fundamental building blocks, namely mixed integer linear programming and nonlinear programming, have seen considerable and steady progress in recent years. Wishing to exploit expertise in these areas as well as on previous work in mixed integer nonlinear programming, this work represents the first step in an ongoing and ambitious project within an open-source environment. COIN-OR is our chosen environment for the development of the optimization software. A class of hybrid algorithms, of which branch-and-bound and polyhedral outer approximation are the two extreme cases, are proposed and implemented. Computational results that demonstrate the effectiveness of this framework are reported. Both the library of mixed integer nonlinear problems that exhibit convex continuous relaxations, on which the experiments are carried out, and a version of the software used are publicly available.     

Logic-Based Modeling and Solution of Nonlinear Discrete/Continuous Optimization Problems

This paper presents a review of advances in the mathematical programming approach to discrete/continuous optimization problems. We first present a brief review of MILP and MINLP for the case when these problems are modeled with algebraic equations and inequalities. Since algebraic representations have some limitations such as difficulty of formulation and numerical singularities for the nonlinear case, we consider logic-based modeling as an alternative approach, particularly Generalized Disjunctive Programming (GDP), which the authors have extensively investigated over the last few years. Solution strategies for GDP models are reviewed, including the continuous relaxation of the disjunctive constraints. Also, we briefly review a hybrid model that integrates disjunctive programming and mixed-integer programming. Finally, the global optimization of nonconvex GDP problems is discussed through a two-level branch and bound procedure.     

A Branch and Contract Algorithm for Problems with Concave Univariate, Bilinear and Linear Fractional Terms

A new deterministic branch and bound algorithm is presented in this paper for the global optimization of continuous problems that involve concave univariate, bilinear and linear fractional terms. The proposed algorithm, the branch and contract algorithm, relies on the use of a bounds-contraction subproblem that aims at reducing the size of the search region by eliminating portions of the domain in which the objective function takes only values above a known upper bound. The solution of contraction subproblems at selected branch and bound nodes is performed within a finite contraction operation that helps reducing the total number of nodes in the branch and bound solution tree. The use of the proposed algorithm is illustrated with several numerical examples.