基于最小二乘加权支持向量机的个人信用预测模型研究

针对不同类别样本数差异和不同误分代价的分类问题，提出了一种基于最小二乘加权支持向量机的分类预测方法。在最小二乘加权支持向量机的基础上，考虑不同类别样本数差异和不同误分代价，提出了新的最小二乘加权支持向量机分类模型，构造了新的最优分类函数。将该模型应用于个人信用预测实验，与已有方法的对比实验结果表明，提出的模型在解决不同类别样本数差异和不同误分代价的个人信用预测问题时，有效地降低了总误分代价，提高了个人信用预测精确度。     

最小费用流的最优参数配置问题

本文提出并讨论了最小费用流的反问题：如何在有限的投资条件下，最有效地扩充容量参数，达到一个予定的流值。建立了反问题的数学模型，给出了最优参数配置的算法。     

多重整体谱范数最小摄动问题的可解性

1．引言Golub和VanLoan等人［1-8]均研究了TLS问题或多重整体最小二乘问题（简称MTLS问题）：的可解性，其中AECm×n，BECm×d．我们在［6，7］中给出了该问题可解的充要条件如下：定理．设（A，B）H（A，B）＝Cdiag（Al，AZ，…，人十d）C”，其中》1＞入2＞…＞人＞人十1＝…一入。＋1＝…一人t＞人在十1三…三入n＋d；s5fi＜t5fi＋d，CHC一人十d．记则MTLS问题（1．1）可解的充要条件是存在T的子集T’＝｛if，iZ，…，i。n｝使rank（屯…，c：。；cL；…；ex＋。）＝d·（1·2）有趣的是，我们发现存在矩阵对（人B）（见…     

平面上的min-max型点-线选址问题

本文研究两类平面选址问题：(1)求一直线到n个给定点的最大加权距离为最小；(2)求一点到n条给定直线的最大加权距离为最小．对这两个非线性优化问题，我们给出最优解的刻划及迭代次数为多项式的算法．     

F-互补问题及其与极小元问题的等价性

本文在Ｂａｎａｃｈ空间中引进了 Ｆ－互补问题,讨论了这一问题解的存在性,在向量格中,给出了Ｆ－互补问题的可行集是 ∧ －子格的条件,研究了Ｆ－互补问题与最小元问题的等价性。     

3-正则图的分割问题是NP-完全问题

证明了3-正则图的最小平分问题和最小α-分割问题都是NP-完全问题.     

基于偏最小二乘回归的美式期权仿真定价方法

本文应用最优停止理论给出了美式期权定价的一般理论框架，进而给出了美式期权普通多项式偏最小二乘仿真定价算法．解决丁当前普通最小二乘方法的理论缺陷．最后以数字实验演示了无红利美式股票卖权的价值计算，实验结果表明该方法是可行的．     

基于计算机试验的均匀设计

本文在计算机试验的基础上，提出了最小相关准则和最小距离离差准则，并将信息论中的Hamming距离和Lee距离引入到计算机试验中，证明了均匀设计在Hamming距离下的最优性和部分好格子点均匀设计在Lee距离下的最优性．基于偏差的考虑，给出了一类新的好格子点均匀设计和一个学习算法，利用这个学习算法，给出了基于Lee距离的最小距离离差准则的均匀设计表的构造方法．通过与已有的好格子点均匀设计和循环拉丁方均匀设计作比较，证明了文中的均匀设计在距离和偏差意义下有更好的均匀性．     

广义非线性最小二乘问题的两个新方法

1．引言讨论如下的广义非线性最小二乘问题其中为常数（i＝1~m），W由于此问题的特殊形式，将此问题转化为如下两个子问题进行求解比较有效[1]子问题1．对每一固定的X，解得子问题2。对子问题1的解，解对两个子问题的求解，[1]中给出了一种有效的方法。然而在两个子问题的已有求解方法中，关于方法收敛速度的讨论非常少见，本文给出了求解这两个子问题的两个算法，并证明了算法的超线性收敛性．为书写简单，以下约定：一个符号在（，L）处的值略去（，L），如V‘F＝＊‘列X，L）等·一个具有上标k和＊的符号分别表示其在（x‘，t‘）和…     

单调线性互补问题的最小原则(II)

在文［１］的基础上，对单调线性互补问题（ＭＬＣＰ）给出了不同于文［１７］的最小原则的另一形式，并提出了一个在有限步内求出单调线性互补问题解集的新算法；给出了单调线性互补问题的三个误差界公式．这些公式推广了文［６］的有关结果，并且较文［８］中的误差界表示形式简洁和易于检验．     

Optimal control of a bioreactor

This paper is concerned with the analysis of a control problem related to the optimal management of a bioreactor. This real-world problem is formulated as a state-control constrained optimal control problem. We analyze the state system (a complex system of partial differential equations modelling the eutrophication processes for non-smooth velocities), and we prove that the control problem admits, at least, a solution. Finally, we present a detailed derivation of a first order optimality condition - involving a suitable adjoint system - in order to characterize these optimal solutions, and some computational results.     

基于Heston模型的待遇预定制养老基金管理最优决策

资产组合与缴费计划是待遇预定制养老基金管理的核心问题. 针对此类养老基金的管理, 建立Heston随机波动率模型, 结合最优控制理论和Legendre变换, 将原问题转化为对偶问题, 通过对偶问题的求解, 求得原问题的解析解, 从而确定风险资产比例和缴费水平, 最终实现养老基金管理的最优资产配置和最低缴费水平.     

An existence and monotonicity theorem for the discrete algebraic matrix Riccati equation

Maximal hermitian solutions of the discrete algebraic matrix Riccati equation play an important role in least squares optimal control problems for discrete linear systems. We prove an existence and comparison theorem concerning maximal hermitian solutions. This theorem is inspired by known results for the algebraic Riccati equation arising in the least squares optimal control problem in continuous linear systems.     

Boundary optimal control for nonlinear antiplane problems

We consider a nonlinear antiplane problem which models the deformation of an elastic cylindrical body in frictional contact with a rigid foundation. The contact is modelled with Tresca’s law of dry friction in which the friction bound is slip dependent.The aim of this article is to study an optimal control problem which consists of leading the stress tensor as close as possible to a given target, by acting with a control on the boundary of the body. The existence of at least one optimal control is proved. Next we introduce a regularized problem, depending on a small parameter ρ, and we study the convergence of the optimal controls when ρ tends to zero. An optimality condition is delivered for the regularized problem.     

Décomposition de domaine pour le contrôle de systèmes gouvernés par des équations d'évolution

We present a non overlapping iterative domain decomposition method with “coupled” Robin transmission conditions. We prove its convergence on an optimal control problem for the wave equation. The linear part of the “feed-back” law associated to the local optimal control problems set on subdomains is independent of the iterative process. The method can be applied, at least formally, to the optimal control of systems governed by evolution equations.     

Optimal Control for Fractional Diffusion Equations with Incomplete Data

We are concerned with the optimal control of time-fractional diffusion equations with missing boundary condition. Using the notion of no-regret control and least (or low) regret control developed by Lions, we first prove that the least regret control problem associated with the boundary fractional diffusion equation has a unique solution. Then we show that this solution converges to the no-regret control which we characterize by a singular optimality system.     

关于一类连续最优控制问题的一种可实现的离散方法

本文对具有状态终端约束、控制受限的非线性连续最优控制问题给出一种新的可实现的离散方法，此方法通过求解非线最小二乘问题避免这类问题离散后出现的不可行现象，文中给出这种做法的理论证明和实现方案。     

Least Square Control Problems in Nonreflexive Spaces

We consider a control problem in a Banach space with a bounded observer, but an unbounded controller which takes values in the extrapolated Favard class. A least square regulator problem can be formulated if the observer and the admissible controls take values in Hilbert spaces. We prove that for this type of LQR-problem the value function is given by a Riccati operator, and that a bounded state feedback based on the Riccati operator yields the optimal control. April 30, 1999     

A control type method for solving the Cauchy–Stokes problem

In this work, we propose an approximate optimal control formulation of the Cauchy problem for the Stokes system. Here the problem is converted into an optimization one. In order to handle the instability of the solution of this ill-posed problem, a regularization technique is developed. We add a term in the least square function which happens to vanish while the algorithm converges. The efficiency of the proposed method is illustrated by numerical experiments.     

Abort landing in the presence of windshear as a minimax optimal control problem,part 2: Multiple shooting and homotopy

In Part 1 of the paper (Ref. 2), we have shown that the necessary conditions for the optimal control problem of the abort landing of a passenger aircraft in the presence of windshear result in a multipoint boundary-value problem. This boundary-value problem is especially well suited for numerical treatment by the multiple shooting method. Since this method is basically a Newton iteration, initial guesses of all variables are needed and assumptions about the switching structure have to be made. These are big obstacles, but both can be overcome by a so-called homotopy strategy where the problem is imbedded into a one-parameter family of subproblems in such a way that (at least) the first problem is simple to solve. The solution data to the first problem may serve as an initial guess for the next problem, thus resulting in a whole chain of problems. This process is to be continued until the objective problem is reached.Techniques are presented here on how to handle the various changes of the switching structure during the homotopy run. The windshear problem, of great interest for safety in aviation, also serves as an excellent benchmark problem: Nearly all features that can arise in optimal control appear when solving this problem. For example, the candidate for an optimal trajectory of the minimax optimal control problem shows subarcs with both bang-bang and singular control functions, boundary arcs and touch points of two state constraints, one being of first order and the other being of third order, etc. Therefore, the results of this paper may also serve as some sort of user's guide for the solution of complicated real-life optimal control problems by multiple shooting.The candidate found for an optimal trajectory is discussed and compared with an approximate solution already known (Refs. 3–4). Besides the known necessary conditions, additional sharp necessary conditions based on sign conditions of certain multipliers are also checked. This is not possible when using direct methods.An extended abstract of this paper was presented at the 8th IFAC Workshop on Control Applications of Nonlinear Programming and Optimization, Paris, France, 1989 (see Ref. 1).This paper is dedicated to Professor Hans J. Stetter on the occasion of his 60th birthday.