Some Results on Mathematical Programming with Generalized Ratio Invexity

In this paper, a generalized ratio invexity concept has been applied for single objective fractional programming problems. A concept which has been invoked seems to be more general than the one used earlier by Khan and Hanson in such contexts. Further, duality results for fractional programs have also been obtained.     

Global optimization of a class of nonconvex quadratically constrained quadratic programming problems

In this paper we study a class of nonconvex quadratically constrained quadratic programming problems generalized from relaxations of quadratic assignment problems. We show that each problem is polynomially solved. Strong duality holds if a redundant constraint is introduced. As an application, a new lower bound is proposed for the quadratic assignment problem.     

Lipschitz强增殖映射方程的迭代解

本文讨论一致凸Banach空间中的Lipschitz强增殖映射方程解的Ishikawa迭代和Mann迭代的收敛性,部分回答了Chianme提出的两个问题。     

一类二层凸规划的对偶二层规划

本文讨论上层目标函数以下层子系统目标函数的最优值作为反馈的一类二层凸规划的对偶规划问题 ,在构成函数满足凸连续可微等条件的假设下 ,建立了二层凸规划的 Lagrange对偶二层规划 ,并证明了基本对偶定理 .     

Generalized Nonlinear Lagrangian Formulation for Bounded Integer Programming

Several nonlinear Lagrangian formulations have been recently proposed for bounded integer programming problems. While possessing an asymptotic strong duality property, these formulations offer a success guarantee for the identification of an optimal primal solution via a dual search. Investigating common features of nonlinear Lagrangian formulations in constructing a nonlinear support for nonconvex piecewise constant perturbation function, this paper proposes a generalized nonlinear Lagrangian formulation of which many existing nonlinear Lagrangian formulations become special cases.     

一类二层凸规划的分解法

研究了一类二层凸规划和与之相应的凸规划问题的等价性．并讨论了这类凸规划的对偶性和鞍点问题,最后给出了求解这类二层凸规划的一个分解法．     

A duality principle in weighted Sobolev spaces on the real line

An embedding inequality of Sobolev type is characterized in the paper with help of a duality principle and boundedness criteria for the Hardy–Steklov integral operator in weighted Lebesgue spaces.     

A posteriori error estimation and adaptivity for degenerate parabolic problems

Two explicit error representation formulas are derived for degenerate parabolic PDEs, which are based on evaluating a parabolic residual in negative norms. The resulting upper bounds are valid for any numerical method, and rely on regularity properties of solutions of a dual parabolic problem in nondivergence form with vanishing diffusion coefficient. They are applied to a practical space-time discretization consisting of piecewise linear finite elements over highly graded unstructured meshes, and backward finite differences with varying time-steps. Two rigorous a posteriori error estimates are derived for this scheme, and used in designing an efficient adaptive algorithm, which equidistributes space and time discretization errors via refinement/coarsening. A simulation finally compares the behavior of the rigorous a posteriori error estimators with a heuristic approach, and hints at the potentials and reliability of the proposed method.

     

Necessary and Sufficient Conditions for Minimax Fractional Programming

We establish the necessary and sufficient optimality conditions for a class of nondifferentiable minimax fractional programming problems solving generalized convex functions. Subsequently, we apply the optimality conditions to formulate one parametric dual problem and we prove weak duality, strong duality, and strict converse duality theorems.