Method of Best Successive Approximations for Nonlinear Operators

We present a new approach to the approximation of nonlinear operators in probability spaces. The approach is based on a combination of the specific iterative procedure and the best approximation problem solution with a quadratic approximant. We show that the combination of these new techniques allow us to build a computationally efficient and flexible method. The algorithm of the method and its application to the optimal filtering of stochastic signals are given.     

A new construction for skew multivariate distributions

This paper considers a new approach to develop a very general class of skew multivariate distributions. The approach is based on a linear combination of an elliptically distributed random variable with a linear constraint. Using this approach two different classes of multivariate distributions are constructed based on original distribution. These new classes include different types of skew normal (type A and type B) and other skew elliptical distributions, exist in the literature. We also derive the moment generating function, marginal and conditional density of our proposed classes of distributions. Straightforward explanations are applied to demonstrate the relationships among previous approaches by others with our proposed class of skew distributions.     

An inexact line search approach using modified nonmonotone strategy for unconstrained optimization

This paper concerns with a new nonmonotone strategy and its application to the line search approach for unconstrained optimization. It has been believed that nonmonotone techniques can improve the possibility of finding the global optimum and increase the convergence rate of the algorithms. We first introduce a new nonmonotone strategy which includes a convex combination of the maximum function value of some preceding successful iterates and the current function value. We then incorporate the proposed nonmonotone strategy into an inexact Armijo-type line search approach to construct a more relaxed line search procedure. The global convergence to first-order stationary points is subsequently proved and the R-linear convergence rate are established under suitable assumptions. Preliminary numerical results finally show the efficiency and the robustness of the proposed approach for solving unconstrained nonlinear optimization problems.     

Efficient decomposition and linearization methods for the stochastic transportation problem

The stochastic transportation problem can be formulated as a convex transportation problem with nonlinear objective function and linear constraints. We compare several different methods based on decomposition techniques and linearization techniques for this problem, trying to find the most efficient method or combination of methods. We discuss and test a separable programming approach, the Frank-Wolfe method with and without modifications, the new technique of mean value cross decomposition and the more well known Lagrangean relaxation with subgradient optimization, as well as combinations of these approaches. Computational tests are presented, indicating that some new combination methods are quite efficient for large scale problems.     

Constructing fixed rank optimal estimators with method of best recurrent approximations

We propose a new approach which generalizes and improves principal component analysis (PCA) and its recent advances. The approach is based on the following underlying ideas. PCA can be reformulated as a technique which provides the best linear estimator of the fixed rank for random vectors. By the proposed method, the vector estimate is presented in a special quadratic form aimed to improve the error of estimation compared with customary linear estimates. The vector is first pre-estimated from the special iterative procedure such that each iterative loop consists of a solution of the unconstrained nonlinear best approximation problem. Then, the final vector estimate is obtained from a solution of the constrained best approximation problem with the quadratic approximant. We show that the combination of these techniques allows us to provide a new nonlinear estimator with a significantly better performance compared with that of PCA and its known modifications.     

A continuous DC programming approach to the strategic supply chain design problem from qualified partner set

We present a new continuous approach based on the DC (difference of convex functions) programming and DC algorithms (DCA) to the problem of supply chain design at the strategic level when production of a new market opportunity has to be launched among a set of qualified partners. A well known formulation of this problem is the mixed integer linear program. In this paper, we reformulate this problem as a DC program by using an exact penalty technique. The proposed algorithm is a combination of DCA and Branch and Bound scheme. It works in a continuous domain but provides mixed integer solutions. Numerical simulations on many empirical data sets show the efficiency of our approach with respect to the standard Branch and Bound algorithm.     

A practical approach to approximate bilinear functions in mathematical programming problems by using Schur's decomposition and SOS type 2 variables

This paper provides a new methodology to solve bilinear, non-convex mathematical programming problems by a suitable transformation of variables. Schur's decomposition and special ordered sets (SOS) type 2 constraints are used resulting in a mixed integer linear or quadratic program in the two applications shown. While Beale, Tomlin and others developed the use of SOS type 2 variables to handle non-convexities, our approach is novel in two aspects. First, the use of Schur's decomposition as an integral part of the approximation step is new and leads to a numerically viable method to separate the variables. Second, the combination of our approach for handling bilinear side constraints in a complementarity or equilibrium problem setting is also new and opens the way to many interesting and realistic modifications to such models. We contrast our approach with other methods for solving bilinear problems also known as indefinite quadratic programs. From a practical point of view our methodology is helpful since no specialized procedures need to be created so that existing solvers can be used. The approach is illustrated with two engineering examples and the mathematical analysis appears in the Appendices.     

On efficiently combining limited-memory and trust-region techniques

Limited-memory quasi-Newton methods and trust-region methods represent two efficient approaches used for solving unconstrained optimization problems. A straightforward combination of them deteriorates the efficiency of the former approach, especially in the case of large-scale problems. For this reason, the limited-memory methods are usually combined with a line search. We show how to efficiently combine limited-memory and trust-region techniques. One of our approaches is based on the eigenvalue decomposition of the limited-memory quasi-Newton approximation of the Hessian matrix. The decomposition allows for finding a nearly-exact solution to the trust-region subproblem defined by the Euclidean norm with an insignificant computational overhead as compared with the cost of computing the quasi-Newton direction in line-search limited-memory methods. The other approach is based on two new eigenvalue-based norms. The advantage of the new norms is that the trust-region subproblem is separable and each of the smaller subproblems is easy to solve. We show that our eigenvalue-based limited-memory trust-region methods are globally convergent. Moreover, we propose improved versions of the existing limited-memory trust-region algorithms. The presented results of numerical experiments demonstrate the efficiency of our approach which is competitive with line-search versions of the L-BFGS method.     

Supply capacity acquisition and allocation with uncertain customer demands

We study a class of capacity acquisition and assignment problems with stochastic customer demands often found in operations planning contexts. In this setting, a supplier utilizes a set of distinct facilities to satisfy the demands of different customers or markets. Our model simultaneously assigns customers to each facility and determines the best capacity level to operate or install at each facility. We propose a branch-and-price solution approach for this new class of stochastic assignment and capacity planning problems. For problem instances in which capacity levels must fall between some pre-specified limits, we offer a tailored solution approach that reduces solution time by nearly 80% over an alternative approach using a combination of commercial nonlinear optimization solvers. We have also developed a heuristic solution approach that consistently provides optimal or near-optimal solutions, where solutions within 0.01% of optimality are found on average without requiring a nonlinear optimization solver.     

利用对偶树复数小波与全变差模型实现图像去噪的新方法

本文首先研究了一种三层小波系数相关萎缩的概念与性质,利用对偶树复数小波与全变差模型相结合,提出了一种新的图像去噪方法。实验结果表明,与现有的图像去噪方法相比,本文方法无论是在视觉还是在均方误差等方面均有更好的效果。     

Accurate solution of polynomial equations using Macaulay resultant matrices

We propose an algorithm for solving two polynomial equations in two variables. Our algorithm is based on the Macaulay resultant approach combined with new techniques, including randomization, to make the algorithm accurate in the presence of roundoff error. The ultimate computation is the solution of a generalized eigenvalue problem via the QZ method. We analyze the error due to roundoff of the method, showing that with high probability the roots are computed accurately, assuming that the input data (that is, the two polynomials) are well conditioned. Our analysis requires a novel combination of algebraic and numerical techniques.

     

On constrained Newton linearization and multigrid for variational inequalities

Summary. We consider the fast solution of a class of large, piecewise smooth minimization problems. For lack of smoothness, usual Newton multigrid methods cannot be applied. We propose a new approach based on a combination of convex minization with constrained Newton linearization. No regularization is involved. We show global convergence of the resulting monotone multigrid methods and give polylogarithmic upper bounds for the asymptotic convergence rates. Efficiency is illustrated by numerical experiments. Received March 22, 1999 / Revised version received February 24, 2001 / Published online October 17, 2001     

Polynomial power-Pareto quantile function models

In this paper we propose a polynomial power-Pareto quantile function model and a Bayesian method for parameters estimation. We also carried out simulation studies and applied our methodology to real data sets empirically. The results show that a quantile function approach to statistical modelling is very flexible due to the properties of quantile functions, and that the combination of a power and a Pareto distribution enables us to model both the main body and the tails of a distribution, even though the mathematical form of the distribution does not exist. Our research also suggests a new approach to studying extreme values based on a whole data set rather than group maximum/minimum or exceedances above/below a proper threshold value.     

基于最大——最小贴近度的IOWA算子最优组合预测模型

将最大一最小贴近度与IOWA算子相结合,建立了基于最大一最小贴近度的IOWA算子最优组合预测模型,并且定义了在最大一最小贴近度下非劣性组合预测、预测方法优超等概念.在此模型下,研究了模型的非劣性组合预测及优性组合预测存在的充分条件.最后给出实例分析,表明该组合预测方法的有效性.     

A priori estimates for rough PDEs with application to rough conservation laws

We introduce a general weak formulation for PDEs driven by rough paths, as well as a new strategy to prove well-posedness. Our procedure is based on a combination of fundamental a priori estimates with (rough) Gronwall-type arguments. In particular this approach does not rely on any sort of transformation formula (flow transformation, Feynman–Kac representation formula etc.) and is therefore rather flexible. As an application, we study conservation laws driven by rough paths establishing well–posedness for the corresponding kinetic formulation.     

Global exponential stability of almost periodic solution for a large class of delayed dynamical systems

Research on delayed neural networks with variable self-inhibitions, interconnection weights, and inputs is an important issue. In this paper, we discuss a large class of delayed dynamical systems with almost periodic self-inhibitions, inter-connection weights, and inputs. This model is universal and includes delayed systems with time-varying delays, distributed delays as well as combination of both. We prove that under some mild conditions, the system has a unique almost periodic solution, which is globally exponentially stable. We propose a new approach, which is independent of existing theory concerning with existence of almost periodic solution for dynamical systems.     

Asymptotic theory of simultaneous estimation of Poisson means

The Poisson distribution is often a good approximation to the underlying sampling distribution and is central to the study of categorical data. In this paper, we propose a new unified approach to an investigation of point properties of simultaneous estimations of Poisson population parameters with general quadratic loss functions. The main accent is made on the shrinkage estimation. We build a series of estimators that could be represented as a convex combination of linear statistics such as maximum likelihood estimator (benchmark estimator), restricted estimator, composite estimator, preliminary test estimator, shrinkage estimator, positive rule shrinkage estimator (James-Stein type estimator). All these estimators are represented in a general integrated estimation approach, which allows us to unify our investigation and order them with respect to the risk. A simulation study with numerical and graphical results is conducted to illustrate the properties of the investigated estimators.     

Evidences of the fractional kinetics in temperature region: Evolution of extreme points in ibuprofen

Based on a new approach presented in detail in this paper one can find new evidences of existence of the fractional kinetics not only in the frequency range. One can find rather general principles of detection of different collective motions in temperature region. These principles can be expressed in terms of an algorithm (defined in the paper as an approach). This approach includes some steps that help to separate a couple of the neighboring collective motions (expressed in the frequency range as a linear combination of two power-law exponents) from each other and establish the temperature evolution of the extreme point that follows to the generalized Vogel–Fulcher–Tamman (VFT)-equation. This experimentally confirmed fact gives new evidences for supporting of the theory of dielectric relaxation based on the fractional kinetics on the frequency/temperature domain. As an example for verification of this new approach the ibuprofen complex permittivity data measured in the wide frequency/temperature range were chosen. The reason of such selection was the following. It helps to compare the conventional study of this complex substance recently published in [1] and use possibilities of the developed approach that can add some new features to the picture obtained in the frame of the conventional treatment. We suppose that possibilities presented by new approach will be extremely useful for detection of different collective motions in other substances studied by the method of broadband dielectric spectroscopy (BDS).     

Solving Large Airline Crew Scheduling Problems: Random Pairing Generation and Strong Branching

The airline crew scheduling problem is the problem of assigning crew itineraries to flights. We develop a new approach for solving the problem that is based on enumerating hundreds of millions random pairings. The linear programming relaxation is solved first and then millions of columns with best reduced cost are selected for the integer program. The number of columns is further reduced by a linear programming based heuristic. Finally an integer solution is obtained with a commercial integer programming solver. The branching rule of the solver is enhanced with a combination of strong branching and a specialized branching rule. The algorithm produces solutions that are significantly better than ones found by current practice.