A divide-and-conquer algorithm for exploiting policy function monotonicity is proposed and analyzed. To compute a discrete problem with n states and n choices, the algorithm requires at most 5n log2(n)n function evaluations and so is O(n log2 n). In contrast, existing methods for non-concave...

Computational Statistics is an international journal that fosters the publication of applications and methodological research in the field of computational statistics. In this article, we will discuss the motivation, history, some specialties, and the future scope of this journal

In this study, we consider multi-period portfolio optimization model that is formulated as a mixed-integer second-order cone programming problems (MISOCPs). The Markowitz (1952) mean/variance framework has been extended by including transaction costs, conditional value-at-risk (CVaR),...

Keane's bump function is considered as a standard benchmark for nonlinear constrained optimization. It is highly multi-modal and its optimum is located at the non-linear constrained boundary. The true minimum of this function is, perhaps, unknown. We intend in this paper to optimize Keane's...

The nearest correlation matrix problem is to find a valid (positive semidefinite) correlation matrix, R(m,m), that is nearest to a given invalid (non-positive semidefinite) or pseudo-correlation matrix, Q(m,m); m larger than 2. In the literature on this problem, 'nearest' is invariably defined...

In this note we show that the strong duality theorem of an unconstrained (generalized) geometric programming problem as defined by Peterson (cf.[1]) is actually a special case of a Lagrangian duality result. Contrary to [1] we also consider the case that the set C is compact and convex and in...

In this paper we will show that the closely K-convexlike vector-valued functions with K Rm a nonempty convex cone and related classes of vector-valued functions discussed in the literature arise naturally within the theory of biconjugate functions applied to the Lagrangian perturbation scheme in...

In the first chapter of this book the basic results within convex and quasiconvex analysis are presented. In Section 2 we consider in detail the algebraic and topological properties of convex sets within Rn together with their primal and dual representations. In Section 3 we apply the results...

Single-ratio and multi-ratio fractional programs in applications are often generalized convex programs. We begin with a survey of applications of single-ratio fractional programs, min-max fractional programs and sum-of-ratios fractional programs. Given the limited advances for the latter class...

There is an irreductible conflict between, on the one hand, the desire to allocate income in society in an equitable way and, on the other, the desire to alleviate poverty. The conflict materializes itself in the problem of designing a basic income (or negative income tax) system which requires...