Concave function

About: Concave function is a research topic. Over the lifetime, 1415 publications have been published within this topic receiving 33278 citations.

Representation Theorem for Convex Nonparametric Least Squares

Abstract: Summary We examine a nonparametric least-squares regression model that endogenously selects the functional form of the regression function from the family of continuous, monotonic increasing and globally concave functions that can be nondifferentiable. We show that this family of functions can be characterized without a loss of generality by a subset of continuous, piece-wise linear functions whose intercept and slope coefficients are constrained to satisfy the required monotonicity and concavity conditions. This representation theorem is useful at least in three respects. First, it enables us to derive an explicit representation for the regression function, which can be used for assessing marginal properties and for the purposes of forecasting and ex post economic modelling. Second, it enables us to transform the infinite dimensional regression problem into a tractable quadratic programming (QP) form, which can be solved by standard QP algorithms and solver software. Importantly, the QP formulation applies to the general multiple regression setting. Third, an operational computational procedure enables us to apply bootstrap techniques to draw statistical inference.

Indefinite Trust Region Subproblems and Nonsymmetric Eigenvalue Perturbations

Abstract: This paper extends the theory of trust region subproblems in two ways: (i) it allows indefinite inner products in the quadratic constraint, and (ii) it uses a two-sided (upper and lower bound) quadratic constraint. Characterizations of optimality are presented that have no gap between necessity and sufficiency. Conditions for the existence of solutions are given in terms of the definiteness of a matrix pencil. A simple dual program is introduced that involves the maximization of a strictly concave function on an interval. This dual program simplifies the theory and algorithms for trust region subproblems. It also illustrates that the trust region subproblems are implicit convex programming problems, and thus explains why they are so tractable.The duality theory also provides connections to eigenvalue perturbation theory. Trust region subproblems with zero linear term in the objective function correspond to eigenvalue problems, and adding a linear term in the objective function is seen to correspond to a p...

Sparse approximate solutions to semidefinite programs

Abstract: We propose an algorithm for approximately maximizing a concave function over the bounded semi-definite cone, which produces sparse solutions. Sparsity for SDP corresponds to low rank matrices, and is a important property for both computational as well as learning theoretic reasons. As an application, building on Aaronson's recent work, we derive a linear time algorithm for Quantum State Tomography.

Portfolio Choice Under Cumulative Prospect Theory: An Analytical Treatment

Abstract: We formulate and carry out an analytical treatment of a single-period portfolio choice model featuring a reference point in wealth, S-shaped utility (value) functions with loss aversion, and probability weighting under Kahneman and Tversky's cumulative prospect theory (CPT). We introduce a new measure of loss aversion for large payoffs, called the large-loss aversion degree (LLAD), and show that it is a critical determinant of the well-posedness of the model. The sensitivity of the CPT value function with respect to the stock allocation is then investigated, which, as a by-product, demonstrates that this function is neither concave nor convex. We finally derive optimal solutions explicitly for the cases in which the reference point is the risk-free return and those in which it is not (while the utility function is piecewise linear), and we employ these results to investigate comparative statics of optimal risky exposures with respect to the reference point, the LLAD, and the curvature of the probability weighting. This paper was accepted by Wei Xiong, finance.

Joint pricing and ordering policy for a deteriorating inventory with partial backlogging

Abstract: In this paper, a deterministic inventory model for deteriorating items with time-dependent backlogging rate is developed. The demand and deterioration rate are known, continuous, and differentiable function of price and time, respectively. Under these general assumptions, we first prove that the optimal replenishment schedule not only exists but is unique, for any given selling price. Next, we show that the total profit is a concave function of price when the replenishment schedule is given. We then provide a simple algorithm to find the optimal selling price and replenishment schedule for the proposed model. Finally, we use a numerical example to illustrate the algorithm.