Second order optimality conditions for generalized semi-infinite programming problems

We consider generalized semi-infinite programming problems. Second order necessary and sufficient conditionsfor local optimality are given. The conditions are derived under assumptions such that the feasible set can be described by means of a finite number of optimal value functions. Since we do not require a strict complementary condition for the local reduction these functions are only of class C¹ A sufficient condition for optimality is proven under much weaker assumptions.     

Algorithms for uniform optimal strategies in two-player zero-sum stochastic games with perfect information

We deal with zero-sum two-player stochastic games with perfect information. We propose two algorithms to find the uniform optimal strategies and one method to compute the optimality range of discount factors. We prove the convergence in finite time for one algorithm. The uniform optimal strategies are also optimal for the long run average criterion and, in transient games, for the undiscounted criterion as well.     

Generalized partial derivatives and optimality conditions for non-differentiable functions

In [9] a generalization of the concept of a classical gradient was presented, which exists for a broad class of non-differentiable functions. This concept differs from traditional “set-valued”" generalizations by an expansion of a directional derivative into a special orthogonal series. Investigating the coefficients of this series and interpreting them as a kind of partial derivatives formal analogies to properties of classical partial derivatives could be drawn. Moreover the new concept reveals relations between questions appearing within the theory of optimization and results in other branches of mathematics, especially to the theory of harmonic and subharmonic functions, The aim of this paper is to show that with the new tool of generalized partial derivatives necessary and sufficient conditions for optimality can be deduced in the case, that a function under consideration is not differentiable at the point of interest. In such a way criteria of optimality can be formulated using the language of these generalized partial derivatives. Numerical considerations show, that the generalized partial derivatives can (approximately) be calculated without solving integrals by hyperinterpolation on the sphere     

鲁棒凸优化问题拟近似解的刻划

本文研究鲁棒凸优化问题拟近似解的最优性条件和对偶理论.首先利用鲁棒优化方法,在由约束函数的共轭函数的上图给出的闭凸锥约束规格条件下,建立了拟近似解的最优性充要条件.其次给出了鲁棒凸优化问题拟近似解在Wolf型和Mond-weir型对偶模型下的强(弱)对偶定理.最后给出具体实例验证了本文获得的结果.     

On a Lagrangian sufficient optimality condition

By exploiting the concept of image of a constrained extremum problem, a sufficient optimality condition of Lagrangian type is established. The result is achieved by applying the idea of coercivity in the image space; this produces new results with respect to the use of coercivity in the given space. The condition embeds a known one.     

On the continuity of a Lagrangian multiplier function in input optimization

We show that a Lagrangian multiplier function in input optimization is generally discontinuous on regions of stability and then we find conditions for its continuity.Research partly supported by the Natural Sciences and Engineering Research Council of Canada.Presented at TIMS/ORSA Meeting in Boston, Massachusetts, April 29-May 1, 1985.The contribution of this author is part of his M.Sc. thesis in Applied Mathematics at McGill University.     

New optimality condition of fixed-endpoint regulators for single-input linear digital systems and its application to fixed-endpoint LQ regulators

This note discusses the regulator problem with zero terminal state for a single-input, linear, time-invariant, discrete-time system. The fundamental structure of the regulator for a general additive performance index is obtained. The new optimality condition is expressed by the optimality condition of the induced free-endpoint regulator in the first phase and the deadbeat control in the second phase. Furthermore, a closed-loop expression for the quadratic performance index is obtained.     

非光滑非凸多目标优化不动点方法

本文首次讨论了用不动点刻划的不可微多目标优化的最优性必要条件和充分条件，并研究了不动点算法求解此问题的方法及大范围收敛性．为不可微多目标优化研究提供了另一条新的途径．     

一类规划问题所给最优性必要条件的注记

本文指出了一类规划问题所给最优性必要条件中所存在的问题。对于一些带有附加项，（如（x^TDx)^1/2‖Sx‖p）的单目标规划问题一般都给出了一个类似集合Z^0 ，并以“Z^0为空集”作为一个前提条件。本文指出此条件太强，并论证了当只有Z^0为空集时，就可推出强最优性必要条件，而不必要求“x^0是最优解”。     

Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints

Using the theory of exact penalization for mathematical programs with subanalytic constraints, the theory of error bounds for quadratic inequality systems, and the theory of parametric normal equations, we derive various exact penalty functions for mathematical programs subject to equilibrium constraints, and we also characterize stationary points of these programs. The research of this author is based on work supported by the National Sciences and Engineering Research Council of Canada under grant OPG0090391. The research of this author is based on work supported by the National Science Foundation under grants DDM-9104078 and CCR-9213739. Part of this paper was completed while he was visiting The University of Melbourne and The University of New South Wales. The research of this author is based on work supported by the Australian Research Council.