The authors provide a model for dynamical scalarization, beyond the adiabatic approximation, using effective field theory techniques, demonstrating that inclusion of post-adiabatic corrections is crucial. agnostic, i.e., independent specific gravity and can therefore be used even alternative theories.

In this paper we introduce some contractive conditions of Meir–Keeler type for two mappings, called f -MK -pair mappings and f -CJM-pair (from Ciric, Jachymski, and Matkowski) mappings, in the framework of regular cone metric spaces and we prove theorems which guarantee the existence and uniqueness of common fixed points. We give also a fixed point result for a multivalued mapping that satisfie...

In the presentwork, usingMinkowski functionals in topological vector spaces, we establish the equivalence between some fixed point results in metric and in (topological vector space) cone metric spaces. Thus, a lot of results in the cone metric setting can be directly obtained from their metric counterparts. In particular, a common fixed point theorem for f -quasicontractions is obtained. Our a...

In vector optimization with a variable ordering structure the partial ordering defined by a convex cone is replaced by a whole family of convex cones, one associated with each element of the space. In recent publications it was started to develop a comprehensive theory for these vector optimization problems. Thereby also notions of proper efficiency were generalized to variable ordering structu...

Given a closed convex cone P with nonempty interior in a locally convex vector space, and a set A ⊂ Y , we provide various equivalences to the implication A ∩ (−int P ) = ∅ =⇒ co(A) ∩ (−int P ) = ∅, among them, to the pointedness of cone(A + int P ). This allows us to establish an optimal alternative theorem, suitable for vector optimization problems. In addition, we characterize the two-dimens...

This work is devoted to examining inverse vector variational inequalities with constraints by means of a prominent nonlinear scalarizing functional. We show that inverse vector variational inequalities are equivalent to multiobjective optimization problems with a variable domination structure. Moreover, we introduce a nonlinear function based on a well-known nonlinear scalarization function. We...

The aim of this paper is to implement some new techniques, based on conjugate duality in convex optimization, for proving the existence of global error bounds for convex inequality systems. We deal first of all with systems described via one convex inequality and extend the achieved results, by making use of a celebrated scalarization function, to convex inequality systems expressed by means of...

This paper aims at combining variable ordering structures with set relations in set optimization, which have been defined using the constant ordering cone before. Since the purpose is to connect these two important approaches in set optimization, we do not restrict our considerations to one certain relation. Conversely, we provide the reader with many new variable set relations generalizing the...

This paper aims at combining variable ordering structures with set relations in set optimization, which have been defined using the constant ordering cone before. Since the purpose is to connect these two important approaches in set optimization, we do not restrict our considerations to one certain relation. Conversely, we provide the reader with many new variable set relations generalizing the...

The paper is concerned with the optimistic formulation of a bilevel optimization problem with multiobjective lower-level problem. Considering the scalarization approach for the multiobjective program, we transform our problem into a scalar-objective optimization problem with inequality constraints by means of the well-known optimal value reformulation. Completely detailed first-order necessary ...