1000 resultados para Nonsmooth analysis


Relevância:

100.00% 100.00%

Publicador:

Resumo:

AMS subject classification: 90C30, 90C33.

Relevância:

70.00% 70.00%

Publicador:

Resumo:

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Relevância:

70.00% 70.00%

Publicador:

Resumo:

An invex constrained nonsmooth optimization problem is considered, in which the presence of an abstract constraint set is possibly allowed. Necessary and sufficient conditions of optimality are provided and weak and strong duality results established. Following Geoffrion's approach an invex nonsmooth alternative theorem of Gordan type is then derived. Subsequently, some applications on multiobjective programming are then pursued. © 2000 OPA (Overseas Publishers Association) N.V. Published by license under the Gordon and Breach Science Publishers imprint.

Relevância:

60.00% 60.00%

Publicador:

Resumo:

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Relevância:

60.00% 60.00%

Publicador:

Resumo:

We consider the question whether the assumption of convexity of the set involved in Clarke-Ledyaev inequality can be relaxed. In the case when the point is outside the convex hull of the set we show that Clarke-Ledyaev type inequality holds if and only if there is certain geometrical relation between the point and the set.

Relevância:

60.00% 60.00%

Publicador:

Resumo:

2000 Mathematics Subject Classification: 46A30, 54C60, 90C26.

Relevância:

60.00% 60.00%

Publicador:

Resumo:

2000 Mathematics Subject Classification: 35J40, 49J52, 49J40, 46E30

Relevância:

60.00% 60.00%

Publicador:

Resumo:

AMS subject classification: Primary 49J52; secondary: 26A27, 90C48, 47N10.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

We discuss sufficient conditions of optimality for nonsmooth continuous-time nonlinear optimization problems under generalized convexity assumptions. These include both first-order and second-order criteria. (C) 1998 Academic Press.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

In this article we describe some qualitative and geometric aspects of nonsmooth dynamical systems theory around typical singularities. We also establish an interaction between nonsmooth systems and geometric singular perturbation theory. Such systems are represented by discontinuous vector fields on R(l), l >= 2, where their discontinuity set is a codimension one algebraic variety. By means of a regularization process proceeded by a blow-up technique we are able to bring about some results that bridge the space between discontinuous systems and singularly perturbed smooth systems. We also present an analysis of a subclass of discontinuous vector fields that present transient behavior in the 2-dimensional case, and we dedicate a section to providing sufficient conditions in order for our systems to have local asymptotic stability.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Relevância:

30.00% 30.00%

Publicador:

Resumo:

We consider a class of nonsmooth convex optimization problems where the objective function is a convex differentiable function regularized by the sum of the group reproducing kernel norm and (Formula presented.)-norm of the problem variables. This class of problems has many applications in variable selections such as the group LASSO and sparse group LASSO. In this paper, we propose a proximal Landweber Newton method for this class of convex optimization problems, and carry out the convergence and computational complexity analysis for this method. Theoretical analysis and numerical results show that the proposed algorithm is promising.