Related papers: On Bi-Objective convex-quadratic problems
In this Letter we suggest a method of convex rigid frames in the studies of the multipartite quNit pure-states. We illustrate what are the convex rigid frames and what is the method of convex rigid frames. As the applications we use this…
The aim of this paper is to study properties of sections of convex bodies with respect to different types of measures. We present a formula connecting the Minkowski functional of a convex symmetric body K with the measure of its sections.…
We study the topology of the set X of the solutions of a system of two quadratic inequalities in the real projective space RP^n (e.g. X is the intersection of two real quadrics). We give explicit formulae for its Betti numbers and for those…
In one of our earlier works, we proposed to approximate Pareto fronts to multiobjective optimization problems by two-sided approximations, one from inside and another from outside of the feasible objective set, called, respectively, lower…
Multi-objective probabilistic model checking provides a way to verify several, possibly conflicting, quantitative properties of a stochastic system. It has useful applications in controller synthesis and compositional probabilistic…
In this paper we propose a linear scalarization proximal point algorithm for solving arbitrary lower semicontinuous quasiconvex multiobjective minimization problems. Under some natural assumptions and using the condition that the proximal…
The 2-sets convex feasibility problem aims at finding a point in the intersection of two closed convex sets $A$ and $B$ in a normed space $X$. More generally, we can consider the problem of finding (if possible) two points in $A$ and $B$,…
Optimizing nonlinear systems involving expensive computer experiments with regard to conflicting objectives is a common challenge. When the number of experiments is severely restricted and/or when the number of objectives increases,…
There are different solution concepts for convex vector optimization problems (CVOPs) and a recent one, which is motivated from a set optimization point of view, consists of finitely many efficient solutions that generate polyhedral inner…
Quite a few studies on real-world applications of multi-objective optimization reported that their Pareto sets and Pareto fronts form a topological simplex. Such a class of problems was recently named the simple problems, and their Pareto…
We introduce complex intersection bodies and show that their properties and applications are similar to those of their real counterparts. In particular, we generalize Busemann's theorem to the complex case by proving that complex…
Optimization of three-dimensional road alignments is a nonlinear non-convex optimization problem. The development of models that fully optimize a three-dimensional road alignment problem is challenging due to numerous factors involved and…
This is a survey on algorithmic questions about combinatorial and geometric properties of convex polytopes. We give a list of 35 problems; for each the current state of knowledege on its theoretical complexity status is reported. The…
We discuss a general approach to handling "multiple hypotheses" testing in the case when a particular hypothesis states that the vector of parameters identifying the distribution of observations belongs to a convex compact set associated…
In multi-objective optimization, computing the entire non-dominated set (also known as the Pareto front or the Pareto frontier) is often intractable. However, for any multiplicative factor greater than one, an approximation set can be…
We study convexity of image of a general multidimensional quadratic map. We split the full image into two parts by an appropriate hyperplane such that one part is compact, and formulate a sufficient condition for convexity of the compact…
We suggest a novel approach for the efficient and reliable approximation of the Pareto front of sufficiently smooth unconstrained bi-criteria optimization problems. Optimality conditions formulated for weighted sum scalarizations of the…
In multi-objective optimization, a single decision vector must balance the trade-offs between many objectives. Solutions achieving an optimal trade-off are said to be Pareto optimal: these are decision vectors for which improving any one…
We consider the problem of testing, for a given set of planar regions $\cal R$ and an integer $k$, whether there exists a convex shape whose boundary intersects at least $k$ regions of $\cal R$. We provide a polynomial time algorithm for…
In this paper we extend test set based augmentation methods for integer linear programs to programs with more general convex objective functions. We show existence and computability of finite test sets for these wider problem classes by…