基于改进自适应混沌控制的逆可靠度分析方法

自适应混沌控制方法是一种高效、稳健的逆可靠度分析方法,但在求解强非线性凹功能函数时,计算效率仍然有待提高,且可能会陷入局部最优.通过对混沌控制因子更新策略进行改进,提出了基于改进自适应混沌控制的逆可靠度分析方法.数值算例分析表明:该方法能够有效地改善混沌控制因子自适应选取时的合理性,具有更好的收敛性和更高的计算效率,为结构可靠度分析和可靠度优化问题提供了更加高效、稳健的求解途径.     

拓扑空间中锥拟凸映射多目标优化问题有效解集的连通性

本文研究拓扑空间中锥拟凸多目标优化问题的有效解集的连通性．在目标映射是上连续和拟凸(次严格拟凸)的条件下，证明了锥弱有效(有效)解集是连通的.进一步，在是连续和强拟凸的条件下，证明了锥有效解集是路连通的.     

Comparison of three methods for fractionation and enrichment of low molecular weight proteins for SELDI-TOF-MS differential analysis

In most diseases, the clinical need for serum/plasma markers has never been so crucial, not only for diagnosis, but also for the selection of the most efficient therapies, as well as exclusion of ineffective or toxic treatment. Due to the high sample complexity, prefractionation is essential for exploring the deep proteome and finding specific markers.In this study, three different sample preparation methods (i.e., highly abundant protein precipitation, restricted access materials (RAM) combined with IMAC chromatography and peptide ligand affinity beads) were investigated in order to select the best fractionation step for further differential proteomic experiments focusing on the LMW proteome (MW inferior to 40,000 Da). Indeed, the aim was not to cover the entire plasma/serum proteome, but to enrich potentially interesting tissue leakage proteins. These three methods were evaluated on their reproducibility, on the SELDI-TOF-MS peptide/protein peaks generated after fractionation and on the information supplied.The studied methods appeared to give complementary information and presented good reproducibility (below 20%). Peptide ligand affinity beads were found to provide efficient depletion of HMW proteins and peak enrichment in protein/peptide profiles.     

A graphical characterization of the efficient set for?convex multiobjective problems

In this paper, a graphical characterization, in the decision space, of the properly efficient solutions of a convex multiobjective problem is derived. This characterization takes into account the relative position of the gradients of the objective functions and the active constraints at the given feasible solution. The unconstrained case with two objective functions and with any number of functions and the general constrained case are studied separately. In some cases, these results can provide a visualization of the efficient set, for problems with two or three variables. Besides, a proper efficiency test for general convex multiobjective problems is derived, which consists of solving a single linear optimization problem.     

Contractibility of the Solution Sets in Strictly Quasiconcave Vector Maximization on Noncompact Domains

We study the contractibility of the efficient solution set of strictly quasiconcave vector maximization problems on (possibly) noncompact feasible domains. It is proved that the efficient solution set is contractible if at least one of the objective functions is strongly quasiconcave and any intersection of level sets of the objective functions is a compact (possibly empty) set. This theorem generalizes the main result of Benoist (Ref.1), which was established for problems on compact feasible domains.The authors thank Dr. T. D. Phuong, Dr. T. X. D. Ha, and the referees for helpful comments and suggestions.     

带关联的双层多目标决策研究

本文研究是线性的双层多目标决策.根据线性规划的对偶理论证明了双层多目标决策的可行集的连通性;利用s*-最优均衡解的概念,求得双层多目标规划的偏好满意解;最后,我们得到了满意解的有效性,并在极点得到.     

Comparison between different duals in multiobjective fractional programming

The present paper is a continuation of [2] where we deal with the duality for a multiobjective fractional optimization problem. The basic idea in [2] consists in attaching an intermediate multiobjective convex optimization problem to the primal fractional problem, using an approach due to Dinkelbach ([6]), for which we construct then a dual problem expressed in terms of the conjugates of the functions involved. The weak, strong and converse duality statements for the intermediate problems allow us to give dual characterizations for the efficient solutions of the initial fractional problem. The aim of this paper is to compare the intermediate dual problem with other similar dual problems known from the literature. We completely establish the inclusion relations between the image sets of the duals as well as between the sets of maximal elements of the image sets.      

参数优化的最优性及在控制问题中的一个应用

在Banach空间中,给出了含参数的单值映射的不变类凸,拟不变类凸和伪不变类凸的概念.在这类较弱凸性条件下,提出了参数优化问题弱有效解的几个最优性充分条件.作为应用,研究了一类状态约束最优控制问题的弱最优控制.     

Connectedness of efficient solution sets for set-valued maps in normed spaces

In vector optimization, the topological properties of the set of efficient solutions are of interest. Several authors have studied this topic for point-valued functions. In this paper, we study the connectedness of the efficient solution sets in convex vector optimization for set-valued maps in normed spaces.The author would like to thank Professor W. T. Fu for helpful discussions concerning Theorem 3.1 and other valuable comments. Moreover, the author is grateful to Professor H. P. Benson and three referees for valuable remarks and suggestions concerning a previous draft of this paper.