Semidefinite optimization models for limit and shakedown analysis problems involving matrix spreads

Limit and shakedown analysis problems of Computational Mechanics lead to convex optimization problems, characterized by linear objective functions, linear equality constraints and constraints expressing the restrictions imposed by the material strength. It is shown that two important strength criteria, the Mohr–Coulomb and the Tresca criterion, can be represented as systems of semidefinite constraints, leading this way to semidefinite programming problems.     

General Information

In this paper, we propose and analyze an SQP-type method for solving linearly constrained convex minimization problems where the objective functions are too complex to be evaluated exactly. Some basic results for global convergence and local superlinear convergence are obtained according to the properties of the approximation sequence. We illustrate the applicability of our approach by proposing a new method for solving two-stage stochastic programs with fixed recourse.     

Some remarks on the Jensen-Hadamard inequalities and applications

We provide some inequalities and integral inequalities connected to the Jensen-Hadamard inequalities for convex functions. In particular, we give some refinements to these inequalities. Some natural applications and further extensions are given.

---

Sunto Forniamo alcune diseguaglianze e diseguaglianze integrali connesse alle dise-gueglianze di Jensen-Hadamard per funzioni convesse. In particolare, diamo qualche miglioramento di queste diseguaglianze. Alcune applicazioni naturali ed ulteriori estensioni sono date.

     

Primal-dual proximal point algorithm for linearly constrained convex programming problems

A primal-dual version of the proximal point algorithm is developed for linearly constrained convex programming problems. The algorithm is an iterative method to find a saddle point of the Lagrangian of the problem. At each iteration of the algorithm, we compute an approximate saddle point of the Lagrangian function augmented by quadratic proximal terms of both primal and dual variables. Specifically, we first minimize the function with respect to the primal variables and then approximately maximize the resulting function of the dual variables. The merit of this approach exists in the fact that the latter function is differentiable and the maximization of this function is subject to no constraints. We discuss convergence properties of the algorithm and report some numerical results for network flow problems with separable quadratic costs.     

一类特殊二维0-1规划的广义指派模型求解

二维0-1整数规划模型应用广泛,对广义指派问题的研究,解决了一些二维0-1整数规划问题.但有些实际问题具有特殊上限约束,目前还没有对应的方法.针对该实际情形,本文建立了相应的数学模型,利用对指派模型的推广,求得问题最优解,从理论上解决了这一类特殊约束二维0-1整数规划的最优解求取问题.并通过算例说明了方法的使用.     

On Linear-Time Algorithms for the Continuous Quadratic Knapsack Problem

We give a linear time algorithm for the continuous quadratic knapsack problem which is simpler than existing methods and competitive in practice. Encouraging computational results are presented for large-scale problems. The author thanks the Associate Editor and an anonymous referee for their helpful comments.     

基于模糊方法的多人合作对策的研究

多人合作对策模型中联盟的收入和总体的收入常常出现相互矛盾的情况 ,此时核是空集 .由于不存在核 ,无法用 Nash-Harsanyi谈判模型求解 .采用模糊数学方法 ,调整模型中线性约束的右端系数 ,使核在一定程度上是非空集合 ,得到模糊意义下的 Nash平衡解 .该方法一定程度上解决了各联盟收入与总体收入的矛盾 .最后通过一个算例说明该方法的可行性 .     

Some properties of the bilevel programming problem

The purpose of this paper is to elaborate on the difficulties accompanying the development of efficient algorithms for solving the bilevel programming problem (BLPP). We begin with a pair of examples showing that, even under the best of circumstances, solutions may not exist. This is followed by a proof that the BLPP is NP-hard.This work was partially supported by a grant from the Advanced Research Program of the Texas Higher Education Coordinating Board.     

平衡规划问题的熵函数方法及其在混合交通流中的应用

将参变极值问题的极大熵函数方法应用到求解平衡规划问题中,通过先验分布信息和Kullback熵概念,给出了平衡规划问题基于Kullback熵表示的熵函数求解方法,并将平衡规划的极大熵函数方法应用于求解混合交通平衡分配问题．     

一种求解混合多目标规划问题的功效函数法

逻辑生长函数相对于龚珀兹生长函数具有拐点高和对称性的特点,采用逻辑生长函数形式的功效函数法求解混合多目标规划问题具有形式简单、计算量小、符合实际的优点。证明了用这种方法求出的最优解是有效解。讨论了满意值对有效解的影响。逻辑生长函数还可以应用于多维变量评价的功效系数法中。