优化方法解决无上层约束的线性双层规划问题

In this paper we propose an optimal method for solving the linear bilevel programming problem with no upper-level constraint. The main idea of this method is that the initial point which is in the feasible region goes forward along the optimal direction firstly. When the iterative point reaches the boundary of the feasible region, it can continue to go forward along the suboptimal direction. The iteration is terminated until the iterative point cannot go forward along the suboptimal direction and effective direction, and the new iterative point is the solution of the lower-level programming. An algorithm which bases on the main idea above is presented and the solution obtained via this algorithm is proved to be optimal solution to the bilevel programming problem. This optimal method is effective for solving the linear bilevel programming problem.     

半参数两样本密度比率模型估计问题的一点注记

In this paper,a semiparametric two-sample density ratio model is considered and the empirical likelihood method is applied to obtain the parameters estimation.A commonly occurring problem in computing is that the empirical likelihood function may be a concaveconvex function.Here a simple Lagrange saddle point algorithm is presented for computing the saddle point of the empirical likelihood function when the Lagrange multiplier has no explicit solution.So we can obtain the maximum empirical likelihood estimation (MELE) of parameters.Monte Carlo simulations are presented to illustrate the Lagrange saddle point algorithm.     

A Note on the Estimation of Semiparametric Two-Sample Density Ratio Models

In this paper,a semiparametric two-sample density ratio model is considered and the empirical likelihood method is applied to obtain the parameters estimation.A commonly occurring problem in computing is that the empirical likelihood function may be a concaveconvex function.Here a simple Lagrange saddle point algorithm is presented for computing the saddle point of the empirical likelihood function when the Lagrange multiplier has no explicit solution.So we can obtain the maximum empirical likelihood estimation (MELE) of parameters.Monte Carlo simulations are presented to illustrate the Lagrange saddle point algorithm.     

模糊多目标半定规划

This paper first applies the fuzzy set theory to multi-objective semi-definite program-ming （MSDP）, and proposes the fuzzy multi-objective semi-definite programming （FMSDP） model whose optimal efficient solution is defined for the first time, too. By constructing a membership function, the FMSDP is translated to the MSDP. Then we prove that the optimal efficient solution of FMSDP is consistent with the efficient solution of MSDP and present the optimality condition about these programming. At last, we give an algorithm for FMSDP by introducing a new membership function and a series of transformation.     

SOLVING A CLASS OF INVERSE QP PROBLEMS BY A SMOOTHING NEWTON METHOD

We consider an inverse quadratic programming （IQP） problem in which the parameters in the objective function of a given quadratic programming （QP） problem are adjusted as little as possible so that a known feasible solution becomes the optimal one. This problem can be formulated as a minimization problem with a positive semidefinite cone constraint and its dual （denoted IQD（A, b）） is a semismoothly differentiable （SC^1） convex programming problem with fewer variables than the original one. In this paper a smoothing Newton method is used for getting a Karush-Kuhn-Tucker point of IQD（A, b）. The proposed method needs to solve only one linear system per iteration and achieves quadratic convergence. Numerical experiments are reported to show that the smoothing Newton method is effective for solving this class of inverse quadratic programming problems.     

混合约束下广义几何规划的一种全局收敛算法

In this paper, we develop a rapidly convergent algorithm for mixed constrained signomial geometric programming. The algorithm makes use of the characteristics of signomial geometric programming, and establishes a new active-set strategy on the basis of trust region method. The global convergence is proved, and some numerical tests are given to illustrate the effectiveness.     

A RECURSIVE ALGORITHM AND ITS CONVERGENCE FOR PARAMETER ESTIMATION OF CONVOLUTION MODEL

In this article, the problem on the estimation of the convolution model parameters is considered. The recursive algorithm for estimating model parameters is introduced from the orthogonal procedure of the data, the convergence of this algorithm is theoretically discussed, and a sufficient condition for the convergence criterion of the orthogonal procedure is given. According to this condition, the recursive algorithm is convergent to model wavelet A- = （1, α1,..., αq）.     

A SUPERLINEARLY CONVERGENT TRUST REGION ALGORITHM FOR LC^1 CONSTRAINED OPTIMIZATION PROBLEMS

In this paper, a new trust region algorithm for nonlinear equality constrained LC^1 optimization problems is given. It obtains a search direction at each iteration not by solving a quadratic programming subproblem with a trust region bound, but by solving a system of linear equations. Since the computational complexity of a QP-Problem is in general much larger than that of a system of linear equations, this method proposed in this paper may reduce the computational complexity and hence improve computational efficiency. Furthermore, it is proved under appropriate assumptions that this algorithm is globally and super-linearly convergent to a solution of the original problem. Some numerical examples are reported, showing the proposed algorithm can be beneficial from a computational point of view.     

A proximal point algorithm revisit on the alternating direction method of multipliers

The alternating direction method of multipliers(ADMM)is a benchmark for solving convex programming problems with separable objective functions and linear constraints.In the literature it has been illustrated as an application of the proximal point algorithm(PPA)to the dual problem of the model under consideration.This paper shows that ADMM can also be regarded as an application of PPA to the primal model with a customized choice of the proximal parameter.This primal illustration of ADMM is thus complemental to its dual illustration in the literature.This PPA revisit on ADMM from the primal perspective also enables us to recover the generalized ADMM proposed by Eckstein and Bertsekas easily.A worst-case O(1/t)convergence rate in ergodic sense is established for a slight extension of Eckstein and Bertsekas’s generalized ADMM.     

The computation of Buehler confidence limits

In medicine and industry, small sample size often arises owing to the high test cost. Then exact confidence inference is important. Buehler confidence limit is a kind of exact confidence limit for the function of parameters in a model. It can be always defined if the order in sample space is given. But the computing problem is often difficult, especially for the cases with high dimension parameter or with incomplete data. This paper presents an algorithm to compute the Buehler confidence limits by EM algorithm. This is the first-time usage of EM algorithm on Buehler confidence limits, but the algorithm is often used for maximum likelihood estimate in literatures. Three computation examples are given to illustrate the method.     

Rough posynomial geometric programming

A rough posynomial geometric programming is put forward by the author. This model is advantageous for us to consider questions not only from the quantity of aspect, but from the quality because it contains more information than a traditional geometric programming one. Here, a rough convex function concept is advanced in rough value sets on foundation of rough sets and rough convex sets. Besides, a knowledge expression model in rough posynomial geometric programming is established and so is a mathematical one. Thirdly, solution properties are studied in mathematical model of rough posynomial geometric programming, and antinomy of the more-for-less paradox is solved with an arithmetic in rough posynomial geometric programming given, which can be changed into a rough linear programming after monomial rough posynomial geometric programming is solved. Finally, validity in model and algorithm is verified by examples.     

一类灰色组合投资决策方法

以灰色系统理论和概率论为基础,探讨了含有区间灰数的组合投资决策问题,提出了具有交易费用的灰色组合投资模型的有效解及其临界最优解和均值白化最优解的概念.并且指出了这些概念所对应的投资偏好.利用分析方法和技巧,融合经典组合投资理论,构建了带有交易费用的灰色组合投资模型的熵权分析算法.为不确定型组合投资决策方法的研究提出了一条新思路.文中的算例说明了算法的可行性.     

Editorial

Linear programming problems with fuzzy parameters are formulated by fuzzy functions. The ambiguity considered here is not randomness, but fuzziness which is associated with the lack of a sharp transition from membership to nonmembership. Parameters on constraint and objective functions are given by fuzzy numbers. In this paper, our object is the formulation of a fuzzy linear programming problem to obtain a reasonable solution under consideration of the ambiguity of parameters. This fuzzy linear programming problem with fuzzy numbers can be regarded as a model of decision problems where human estimation is influential.     

Global optimization of signomial geometric programming problems

This paper presents a global optimization approach for solving signomial geometric programming problems. In most cases nonconvex optimization problems with signomial parts are difficult, NP-hard problems to solve for global optimality. But some transformation and convexification strategies can be used to convert the original signomial geometric programming problem into a series of standard geometric programming problems that can be solved to reach a global solution. The tractability and effectiveness of the proposed successive convexification framework is demonstrated by seven numerical experiments. Some considerations are also presented to investigate the convergence properties of the algorithm and to give a performance comparison of our proposed approach and the current methods in terms of both computational efficiency and solution quality.     

Stochastic optimal control and algorithm of the trajectory of horizontal wells

This paper presents a nonlinear, multi-phase and stochastic dynamical system according to engineering background. We show that the stochastic dynamical system exists a unique solution for every initial state. A stochastic optimal control model is constructed and the sufficient and necessary conditions for optimality are proved via dynamic programming principle. This model can be converted into a parametric nonlinear stochastic programming by integrating the state equation. It is discussed here that the local optimal solution depends in a continuous way on the parameters. A revised Hooke–Jeeves algorithm based on this property has been developed. Computer simulation is used for this paper, and the numerical results illustrate the validity and efficiency of the algorithm.     

A new algorithm for geometric programming based on the linear structure of its dual problem

In this article, we present an algorithm for the resolution of a nonlinear optimization problem, concretely the posynomial geometric programming model. The solution procedure that we develop extends the condensation techniques for geometric programming, allowing us to find the optimal solutions to the dual geometric problems that we get from the interior of the corresponding feasible regions, in the line that interior point methods for linear programming work, which leads us to obtain considerable computational advantages with respect of the classical solution procedures.     

灰色Verhulst模型的改进及其应用

针对灰色Verhulst模型的不足,讨论了灰色Verhulst模型的参数优化问题.首先,利用最小二乘原理给出了一种初值优化的改进模型.其次,在平均相对误差最小准则下,将Verhulst模型的参数优化转化为线性规划问题,然后利用粒子群优化算法估计Verhulst模型中的参数,得到另外一种改进模型.最后,给出了一个仿真实例,结果表明灰色Verhulst模型的改进方法是可行的和有效的,而且具有较高的拟合和预测精度.     

含交易费用的证券组合投资模型的满意解

在证券组合投资过程中,忽略交易费用会导致非有效的证券组合投资,本文提出了一个考虑交易费用的证券组合投资的区间数线性规划模型,通过引入区间数线性规划问题中的目标函数优化水平参数λ和约束条件满足水平参数η将目标函数和约束条件均为区间数的区间数线性规划模型转化为确定型的一般线性规划模型,进而求得相应于优化水平λ和满足水平η的满意解.     

A revisit of numerical approach for solving linear fractional programming problem in a fuzzy environment

In the article, Veeramani and Sumathi [10] presented an interesting algorithm to solve a fully fuzzy linear fractional programming (FFLFP) problem with all parameters as well as decision variables as triangular fuzzy numbers. They transformed the FFLFP problem under consideration into a bi-objective linear programming (LP) problem, which is then converted into two crisp LP problems. In this paper, we show that they have used an inappropriate property for obtaining non-negative fuzzy optimal solution of the same problem which may lead to the erroneous results. Using a numerical example, we show that the optimal fuzzy solution derived from the existing model may not be non-negative. To overcome this shortcoming, a new constraint is added to the existing fuzzy model that ensures the fuzzy optimal solution of the same problem is a non-negative fuzzy number. Finally, the modified solution approach is extended for solving FFLFP problems with trapezoidal fuzzy parameters and illustrated with the help of a numerical example.     

Monomial geometric programming with fuzzy relation equation constraints

Monomials are widely used. They are basic structural units of geometric programming. In the process of optimization, many objective functions can be denoted by monomials. We can often see them in resource allocation and structure optimization and technology management, etc. Fuzzy relation equations are important elements of fuzzy mathematics, and they have recently been widely applied in fuzzy comprehensive evaluation and cybernetics. In view of the importance of monomial functions and fuzzy relation equations, we present a fuzzy relation geometric programming model with a monomial objective function subject to the fuzzy relation equation constraints, and develop an algorithm to find an optimal solution based on the structure of the solution set of fuzzy relation equations. Two numerical examples are given to verify the developed algorithm. Our numerical results show that the algorithm is feasible and effective.