Multicriterion structure/control design for optimal maneuverability and fault tolerance of flexible spacecraft

A multicriterion design problem for optimal maneuverability and fault tolerance of flexible spacecraft is considered. The maneuverability index reflects the time required to perform rest-to-rest attitude maneuvers for a given set of angles, with the postmaneuver spillover within a specified bound. The performance degradation is defined to reflect the maximum possible attitude error after maneuver due to the effect of faults. The fault-tolerant design is to minimize the worst performance degradation from all admissible faults by adjusting the design of the spacecraft. It is assumed that admissible faults can be specified by a vector of real parameters. The multicriterion design for optimal maneuverability and fault tolerance is shown to be well defined, leading to a minimax problem. Analysis for this nonsmooth problem leads to closed-form expressions of the generalized gradient of the performance degradation function with respect to the fault parameters and structural design variables. Necessary and sufficient conditions for the optimum are derived, and the closed-form expressions of the generalized gradients are applied for their interpretation. The bundle method is applicable to this minimax problem. Approximate methods which efficiently solve this minimax problem with relatively little computational difficulties are presented. Numerical examples suggest that it is possible to improve the fault tolerance substantially with relatively little loss in maneuverability.     

矩阵损失下一类相依回归模型中的线性容许估计和Minimax估计

本文研究设计矩人有相同值域的相依回归模型,在矩阵损失下我们给出了回归系数的线性估计是线性容许的充要条件,它们推广了已有的结果,我们也在矩阵上给出了某个回归模型的回归系数的唯一的Ｍｉｎｉｍａｘ估计,它说明此时其它模型的信息不起作用     

An admissible minimax estimator of a bounded scale-parameter in a subclass of the exponential family under scale-invariant squared-error loss

A subclass of the scale-parameter exponential family is considered and for the rth power of the scale parameter, which is lower bounded, an admissible minimax estimator under scale-invariant squared-error loss is presented. Also, an admissible minimax estimator of a lower-bounded parameter in the family of transformed chi-square distributions is given. These estimators are the pointwise limits of a sequence of Bayes estimators. Some examples are given.     

Portfolio selection with a minimax measure in safety constraint

In this paper, we attempt to design a portfolio optimization model for investors who desire to minimize the variation around the mean return and at the same time wish to achieve better return than the worst possible return realization at every time point in a single period portfolio investment. The portfolio is to be selected from the risky assets in the equity market. Since the minimax portfolio optimization model provides us with the portfolio that maximizes (minimizes) the worst return (worst loss) realization in the investment horizon period, in order to safeguard the interest of investors, the optimal value of the minimax optimization model is used to design a constraint in the mean-absolute semideviation model. This constraint can be viewed as a safety strategy adopted by an investor. Thus, our proposed bi-objective linear programming model involves mean return as a reward and mean-absolute semideviation as a risk in the objective function and minimax as a safety constraint, which enables a trade off between return and risk with a fixed safety value. The efficient frontier of the model is generated using the augmented -constraint method on the GAMS software. We simultaneously solve the ratio optimization problem which maximizes the ratio of mean return over mean-absolute semideviation with same minimax value in the safety constraint. Subsequently, we choose two portfolios on the above generated efficient frontier such that the risk from one of them is less and the mean return from other portfolio is more than the respective quantities of the optimal portfolio from the ratio optimization model. Extensive computational results and in-sample and out-of-sample analysis are provided to compare the financial performance of the optimal portfolios selected by our proposed model with that of the optimal portfolios from the existing minimax and mean-absolute semideviation portfolio optimization models on real data from S&P CNX Nifty index.     

Linear Minimax Prediction in a Finite Population with Ellipsoidal Constraints

Under a matrix loss function, we investigate the prediction problem in a finite population with ellipsoidal restriction in this paper. Firstly, a class of homogeneous linear minimax predictors for finite population regression coefficient are obtained. Moreover, it is shown that the linear minimax predictors are admissible in the class of homogeneous linear predictors. Finally, a simulation study and a real data example are used to illustrate our results.     

Robust multi-market newsvendor models with interval demand data

We present a robust model for determining the optimal order quantity and market selection for short-life-cycle products in a single period, newsvendor setting. Due to limited information about demand distribution in particular for short-life-cycle products, stochastic modeling approaches may not be suitable. We propose the minimax regret multi-market newsvendor model, where the demands are only known to be bounded within some given interval. In the basic version of the problem, a linear time solution method is developed. For the capacitated case, we establish some structural results to reduce the problem size, and then propose an approximation solution algorithm based on integer programming. Finally, we compare the performance of the proposed minimax regret model against the typical average-case and worst-case models. Our test results demonstrate that the proposed minimax regret model outperformed the average-case and worst-case models in terms of risk-related criteria and mean profit, respectively.     

Incorporating model uncertainty into optimal insurance contract design

In stochastic optimization models, the optimal solution heavily depends on the selected probability model for the scenarios. However, the scenario models are typically chosen on the basis of statistical estimates and are therefore subject to model error. We demonstrate here how the model uncertainty can be incorporated into the decision making process. We use a nonparametric approach for quantifying the model uncertainty and a minimax setup to find model-robust solutions. The method is illustrated by a risk management problem involving the optimal design of an insurance contract.     

On maximum tests for normal distributions

Lety be a normally distributed random vector with known regular covariance matrix and letA, B be disjoint closed convex sets inR ⁿ . To be tested is the zero-hypothesisE(y)εA against the alternative hypothesisE(y) ε B at a level of significanceα. Taking the set of admissible tests as one strategy set, the set of probability densities corresponding toB as the other strategy set and the power function of the test problem as the pay-off function this game has an equilibrium point. Thus there is a test, in particular a Neyman-Pearson test, which is simultaneously a maximin and a minimax test. The optimal test is uniquely determined, except on sets with measure zero. Finally the case of non-convexA, B is briefly considered.     

Variable-metric technique for the solution of affinely parametrized nondifferentiable optimal design problems

The composite functions which appear in various optimal feedback system design problems, as well as in open-loop optimal control problems, can lead to severely ill-conditioned minimax problems. This ill-conditioning can cause first-order minimax algorithms to converge very slowly. We propose a variable-metric technique which substantially mitigates this ill-conditioning. The technique does not require the evaluation of second derivatives and can be used to speed the convergence of any first-order minimax algorithm which produces estimates of the optimal multipliers. Numerical experiments are presented which show that the variable-metric technique increases the speed of two algorithms.     

Adaptive estimation of linear functionals in functional linear models

We consider the estimation of the value of a linear functional of the slope parameter in functional linear regression, where scalar responses are modeled in dependence of randomfunctions. In Johannes and Schenk [2010] it has been shown that a plug-in estimator based on dimension reduction and additional thresholding can attain minimax optimal rates of convergence up to a constant. However, this estimation procedure requires an optimal choice of a tuning parameter with regard to certain characteristics of the slope function and the covariance operator associated with the functional regressor. As these are unknown in practice, we investigate a fully data-driven choice of the tuning parameter based on a combination of model selection and Lepski??s method, which is inspired by the recent work of Goldenshluger and Lepski [2011]. The tuning parameter is selected as theminimizer of a stochastic penalized contrast function imitating Lepski??smethod among a random collection of admissible values. We show that this adaptive procedure attains the lower bound for the minimax risk up to a logarithmic factor over a wide range of classes of slope functions and covariance operators. In particular, our theory covers pointwise estimation as well as the estimation of local averages of the slope parameter.     

Generalized KKM theorems on hyperconvex metric spaces and some applications

In this work, we establish the intersection property for a family of admissible subsets in a hyperconvex metric space, and we apply this intersection property to get generalized KKM theorems, coincidence theorems, variational inequality theorems and minimax inequality theorems.     

Optimal designs with respect to Elfving's partial minimax criterion in polynomial regression

For the polynomial regression model on the interval [a, b] the optimal design problem with respect to Elfving's minimax criterion is considered. It is shown that the minimax problem is related to the problem of determining optimal designs for the estimation of the individual parameters. Sufficient conditions are given guaranteeing that an optimal design for an individual parameter in the polynomial regression is also minimax optimal for a subset of the parameters. The results are applied to polynomial regression on symmetric intervals [–b, b] (b1) and on nonnegative or nonpositive intervals where the conditions reduce to very simple inequalities, involving the degree of the underlying regression and the index of the maximum of the absolute coefficients of the Chebyshev polynomial of the first kind on the given interval. In the most cases the minimax optimal design can be found explicitly.Research supported in part by the Deutsche Forschungsgemeinschaft.Research supported in part by NSF Grant DMS 9101730.     

基于混合患病兄弟对IBD数据的连锁分析

患病兄弟对(affected sib-pair,ASP)设计在遗传统计中有着广泛的应用,这种设计针对的是完全兄弟对(full-sib),而在实际问题中,被抽样的患病兄弟对中常会混有一定数目的半兄弟对(half-sib).论文对这种基于IBD信息的混有半兄弟对NASP(称为mixed affected sib-pair,...     

Minimax designs for linear regression models with bias in a reproducing kernel Hilbert space in a discrete set

Consider the design problem for estimation and extrapolation in approximately linear regression models with possible misspecification. The design space is a discrete set consisting of finitely many points, and the model bias comes from a reproducing kernel Hilbert space. Two different design criteria are proposed by applying the minimax approach for estimating the parameters of the regression response and extrapolating the regression response to points outside of the design space. A simulated annealing algorithm is applied to construct the minimax designs.These minimax designs are compared with the classical D-optimal designs and all-bias extrapolation designs. Numerical results indicate that the simulated annealing algorithm is feasible and the minimax designs are robust against bias caused by model misspecification.     

An algorithm for computing solutions of variational problems with global convexity constraints

We present an algorithm to approximate the solutions to variational problems where set of admissible functions consists of convex functions. The main motivation behind the numerical method is to compute solutions to Adverse Selection problems within a Principal-Agent framework. Problems such as product lines design, optimal taxation, structured derivatives design, etc. can be studied through the scope of these models. We develop a method to estimate their optimal pricing schedules.     

A Unified and Broadened Class of Admissible Minimax Estimators of a Multivariate Normal Mean

The problem of estimating the mean of a multivariate normal distribution is considered. A class of admissible minimax estimators is constructed. This class includes two well-known classes of estimators, Strawderman's and Alam's. Further, this class is much broader than theirs.     

Reducibility of minimax to minisum 0–1 programming problems

We consider 0–1 programming problems with a minimax objective function and any set of constraints. Upon appropriate transformations of its cost coefficients, such a minimax problem can be reduced to a linear minisum problem with the same set of feasible solutions such that an optimal solution to the latter will also solve the original minimax problem.Although this reducibility applies for any 0–1 programming problem, it is of particular interest for certain locational decision models. Among the obvious implications are that an algorithm for solving a p-median (minisum) problem in a network will also solve a corresponding p-center (minimax) problem.It should be emphasized that the results presented will in general only hold for 0–1 problems due to intrinsic properties of the minimax criterion.     

非凸极小极大问题的优化算法与复杂度分析

非凸极小极大问题是近期国际上优化与机器学习、信号处理等交叉领域的一个重要研究前沿和热点,包括对抗学习、强化学习、分布式非凸优化等前沿研究方向的一些关键科学问题都归结为该类问题。国际上凸-凹极小极大问题的研究已取得很好的成果,但非凸极小极大问题不同于凸-凹极小极大问题,是有其自身结构的非凸非光滑优化问题,理论研究和求解难度都更具挑战性,一般都是NP-难的。重点介绍非凸极小极大问题的优化算法和复杂度分析方面的最新进展。     

Minimax strategy for optimal simple inspection plan design

Mathematical Methods of Operations Research - After providing minimax strategy in simple and composite hypothesis testing for optimal simple inspection plan design, this paper examines...