Der vorliegende Beitrag zeigt die Formulierung, Implementierung und Auswertung eines mathematischen Optimierungsmodells anhand eines Falls aus der Beratungspraxis, der die schrittweise Weiterentwicklung einer patentbasierten Technologie durch eine neu zu gründende Gesellschaft zum Gegenstand...

In this paper, a parametric algorithm is introduced for computing all eigenvalues for two Eigenvalue Complementarity Problems discussed in the literature. The algorithm searches a finite number of nested intervals <InlineEquation ID="IEq1"> <EquationSource Format="TEX">$$[\bar{l}, \bar{u}]$$</EquationSource> <EquationSource Format="MATHML"> <math xmlns:xlink="http://www.w3.org/1999/xlink"> <mrow> <mo stretchy="false">[</mo> <mover accent="true"> <mrow> <mi>l</mi> </mrow> <mrow> <mo stretchy="false">¯</mo> </mrow> </mover> <mo>,</mo> <mover accent="true"> <mrow> <mi>u</mi> </mrow> <mrow> <mo stretchy="false">¯</mo> </mrow> </mover> <mo stretchy="false">]</mo> </mrow> </math> </EquationSource> </InlineEquation> in such a way that, in...</equationsource></equationsource></inlineequation>

In a recent paper, Birgin, Floudas and Martínez introduced an augmented Lagrangian method for global optimization. In their approach, augmented Lagrangian subproblems are solved using the <InlineEquation ID="IEq1"> <EquationSource Format="TEX">$$\alpha $$</EquationSource> </InlineEquation> <Emphasis Type="SmallCaps">BB method and convergence to global minimizers was obtained assuming feasibility of the...</emphasis></equationsource></inlineequation>

In the field of global optimization many efforts have been devoted to solve unconstrained global optimization problems. The aim of this paper is to show that unconstrained global optimization methods can be used also for solving constrained optimization problems, by resorting to an exact penalty...

The nonlinear convex programming problem of finding the minimum covering weighted ball of a given finite set of points in <InlineEquation ID="IEq2"> <EquationSource Format="TEX">$${\mathbb{R}^n}$$</EquationSource> </InlineEquation> is solved by generating a finite sequence of subsets of the points and by finding the minimum covering weighted ball of each subset in the sequence until...</equationsource></inlineequation>

Techniques for estimating the condition number of a nonsingular matrix are developed. It is shown that Hager’s 1-norm condition number estimator is equivalent to the conditional gradient algorithm applied to the problem of maximizing the 1-norm of a matrix-vector product over the unit sphere...