GLOBAL WEAK SHARP MINIMA AND COMPLETENESS OF METRIC SPACE

A sufficient condition on the existence of a global weak sharp minima for general function in metric space is established. A characterization for convex function to have global weak sharp minima is also presented, which generalized Burke and Ferris‘ result to infinite dimensional space. A characterization of the completeness of a metric space is given by the existence of global weak sharp minima.     

Weak sharp minima revisited, part II: application to linear regularity and error bounds

The notion of weak sharp minima is an important tool in the analysis of the perturbation behavior of certain classes of optimization problems as well as in the convergence analysis of algorithms designed to solve these problems. It has been studied extensively by several authors. This paper is the second of a series on this subject where the basic results on weak sharp minima in Part I are applied to a number of important problems in convex programming. In Part II we study applications to the linear regularity and bounded linear regularity of a finite collection of convex sets as well as global error bounds in convex programming. We obtain both new results and reproduce several existing results from a fresh perspective. We dedicate this paper to our friend and mentor Terry Rockafellar on the occasion of his 70th birthday. He has been our guide in mathematics as well as in the backcountry and waterways of the Olympic and Cascade mountains. Research supported in part by the National Science Foundation Grant DMS-0203175.     

Generalized weak sharp minima in cone-constrained convex optimization with applications

In this paper, we consider convex optimization problems with cone constraints (CPC in short). We study generalized weak sharp minima properties for (CPC) in the Banach space and Hilbert space settings, respectively. Some criteria and characterizations for the solution set to be a set of generalized weak sharp minima for (CPC) are derived. As an application, we propose an algorithm for (CPC) in the Hilbert space setting. Convergence analysis of this algorithm is given.     

Inexact subgradient methods for quasi-convex optimization problems

In this paper, we consider a generic inexact subgradient algorithm to solve a nondifferentiable quasi-convex constrained optimization problem. The inexactness stems from computation errors and noise, which come from practical considerations and applications. Assuming that the computational errors and noise are deterministic and bounded, we study the effect of the inexactness on the subgradient method when the constraint set is compact or the objective function has a set of generalized weak sharp minima. In both cases, using the constant and diminishing stepsize rules, we describe convergence results in both objective values and iterates, and finite convergence to approximate optimality. We also investigate efficiency estimates of iterates and apply the inexact subgradient algorithm to solve the Cobb–Douglas production efficiency problem. The numerical results verify our theoretical analysis and show the high efficiency of our proposed algorithm, especially for the large-scale problems.     

Global weak sharp minima for convex (semi-)infinite optimization problems

We mainly consider global weak sharp minima for convex infinite and semi-infinite optimization problems (CIP). In terms of the normal cone, subdifferential and directional derivative, we provide several characterizations for (CIP) to have global weak sharp minimum property.     

On convergence of the Gauss-Newton method for convex composite optimization

The local quadratic convergence of the Gauss-Newton method for convex composite optimization f=h∘F is established for any convex function h with the minima set C, extending Burke and Ferris’ results in the case when C is a set of weak sharp minima for h. Received: July 24, 1998 / Accepted: November 29, 2000?Published online September 3, 2001     

Finite termination of the proximal point method for convex functions on Hadamard manifolds

In this article, we proved that the sequence generated by the proximal point method, associated to a unconstrained optimization problem in the Riemannian context, has finite termination when the objective function has a weak sharp minima on the solution set of the problem.     

Invariant foliations for parabolic equations

It is proved for parabolic equations that under certain conditions the weak (un-) stable manifolds possess invariant foliations, called strongly (un-) stable foliations. The relevant results on center manifoids are generalized to weak hyperbolic manifolds     

Maximal element with applications to Nash equilibrium problems in Hadamard manifolds

ABSTRACT

The purpose of this paper is to study the existence of maximal elements with applications to Nash equilibrium problems for generalized games in Hadamard manifolds. By employing a KKM lemma, we establish a new maximal element theorem in Hadamard manifolds. As applications, some existence results of Nash equilibria for generalized games are derived. The results in this paper unify, improve and extend some known results from the literature.     

Existence results for a class of hemivariational inequality problems on Hadamard manifolds

In this paper, a class of hemivariational inequality problems are introduced and studied on Hadamard manifolds. Using the properties of Clarke’s generalized directional derivative and Fan-KKM lemma, an existence theorem of solution in connection with the hemivariational inequality problem is obtained when the constraint set is bounded. By employing some coercivity conditions and the properties of Clarke’s generalized directional derivative, an existence result and the boundedness of the set of solutions for the underlying problem are investigated when the constraint set is unbounded. Moreover, a sufficient and necessary condition for ensuring the nonemptiness of the set of solutions concerned with the hemivariational inequality problem is also given.     

Strong Fermat Rules for Constrained Set-Valued Optimization Problems on Banach Spaces

In this paper, we propose two kinds of optimality concepts, called the sharp minima and the weak sharp minima, for a constrained set-valued optimization problem. Subsequently, we extend the Fermat rules for the local minima of the constrained set-valued optimization problem to the sharp minima and the weak sharp minima in Banach spaces or Asplund spaces, by means of the Mordukhovich generalized differentiation and the normal cone. As applications, we investigate the generalized inequality systems with constraints, and get some characterizations of error bounds for the constrained generalized inequality systems in convex and nonconvex cases.     

Sharp conditions of global existence for the generalized Davey-Stewartson system

This paper discusses the generalized Davey–Stewartsonsystem. By constructing a cross-constrained variational problemand so-called invariant manifolds of the evolution flow, wederive a sharp criterion for blow-up and global existence ofthe solutions.     

Weak sharp minima for piecewise linear multiobjective optimization in normed spaces

In a general normed space, we consider a piecewise linear multiobjective optimization problem. We prove that a cone-convex piecewise linear multiobjective optimization problem always has a global weak sharp minimum property. By a counter example, we show that the weak sharp minimum property does not necessarily hold if the cone-convexity assumption is dropped. Moreover, under the assumption that the ordering cone is polyhedral, we prove that a (not necessarily cone-convex) piecewise linear multiobjective optimization problem always has a bounded weak sharp minimum property.     

A Gauss—Newton method for convex composite optimization

An extension of the Gauss—Newton method for nonlinear equations to convex composite optimization is described and analyzed. Local quadratic convergence is established for the minimization ofh F under two conditions, namelyh has a set of weak sharp minima,C, and there is a regular point of the inclusionF(x) C. This result extends a similar convergence result due to Womersley (this journal, 1985) which employs the assumption of a strongly unique solution of the composite functionh F. A backtracking line-search is proposed as a globalization strategy. For this algorithm, a global convergence result is established, with a quadratic rate under the regularity assumption.This material is based on research supported by National Science Foundation Grants CCR-9157632 and DMS-9102059, the Air Force Office of Scientific Research Grant F49620-94-1-0036, and the United States—Israel Binational Science Foundation Grant BSF-90-00455.     

Existence and stability of solutions for maximal element theorem on Hadamard manifolds with applications

In this paper, maximal element theorem on Hadamard manifolds is established. First, we prove the existence of solutions for maximal element theorem on Hadamard manifolds. Further, we prove that most of problems in maximal element theorem on Hadamard manifolds (in the sense of Baire category) are essential and that, for any problem in maximal element theorem on Hadamard manifolds, there exists at least one essential component of its solution set. As applications, we study existence and stability of solutions for variational relation problems on Hadamard manifolds, and existence and stability of weakly Pareto-Nash equilibrium points for n-person multi-objective games on Hadamard manifolds.     

Vector variational inequalities on Hadamard manifolds involving strongly geodesic convex functions

This paper is intended to study the vector variational inequalities on Hadamard manifolds. Generalized Minty and Stampacchia vector variational inequalities are introduced involving generalized subdifferential. Under strongly geodesic convexity, relations between solutions of these inequalities and a nonsmooth vector optimization problem are established. To illustrate the relationship between a solution of generalized weak Stampacchia vector variational inequality and weak efficiency of a nonsmooth vector optimization problem, a non-trivial example is presented.     

Generalized Browder-type fixed point theorem with strongly geodesic convexity on Hadamard manifolds with applications

In this paper, a generalized Browder-type fixed point theorem on Hadamard manifolds is introduced, which can be regarded as a generalization of the Browder-type fixed point theorem for the set-valued mapping on an Euclidean space to a Hadamard manifold. As applications, a maximal element theorem, a section theorem, a Ky Fan-type Minimax Inequality and an existence theorem of Nash equilibrium for non-cooperative games on Hadamard manifolds are established.     

广义弱群像代数

本文首先介绍了广义弱群像代数的概念, 并构造了一系列具体的例子, 通过例子可以看出有限群胚代数和群像代数都可以看作是广义弱群像代数; 接着本文证明了广义弱群像代数也可以看作是一类广义弱双Frobenius代数, 并探讨了广义弱双Frobenius代数成为有限群胚代数的条件; 最后本文给出了低维广义弱群像代数的具体结构.     

与A-调和方程有关的两个结果

给出两个与A 调和方程有关的结果 .第一个结果是一类A 调和方程的很弱解可由调和函数逼近 .另一个是变分积分弱极值的充分必要条件     

GENERALIZED WEAK FUNCTIONS

In this paper the authors introduce some new ideas on generalized numbers and generalized weak functions. They prove that the product of any two weak functions is a generalized weak function. So in particular they solve the problem of the multiplication of two generalized functions.