The problem of optimizing a biconvex function over a given (bi)convex or compact set frequently occurs in theory as well as in industrial applications, for example, in the field of multifacility location or medical image registration. Thereby, a function <InlineEquation ID="IEq1"> <EquationSource Format="TEX">$$f:X\times Y\to{\mathbb{R}}$$</EquationSource> </InlineEquation> is...</equationsource></inlineequation>

The problem of optimizing a biconvex function over a given (bi)convex or compact set frequently occurs in theory as well as in industrial applications, for example, in the field of multifacility location or medical image registration. Thereby, a function $$f:X\times Y\to{\mathbb{R}}$$ is called...

Multi-objective optimization problems are often solved by a sequence of parametric single-objective problems, so-called scalarizations. If the set of nondominated points is finite, the entire nondominated set can be generated in this way. In the bicriteria case it is well known that this can be...

We consider a generalized class of location-allocation problems, in which N new facilities are to be located in the plane with respect to M objects. Each object is associated with a convex cost function, specifying the expenses for serving the object from any location in the plane. For the...

Algorithms generating piecewise linear approximations of the nondominated set for general, convex and nonconvex, multicriteria programs are developed. Polyhedral distance functions are used to construct the approximation and evaluate its quality. The functions automatically adapt to the problem...