Studying graph - stability to apprehend relative hardness of constructive-non-constructive approximation
Su un particolare problema di allocazione di servizi
Sub differentiability and trustworthiness in the light of a new variational principle of Borwein and Preiss
Subgradient optimization and large scale programming : an application to optimum multicommodity network synthesis with security constraints
Subgraph isomorphism in planar graphs and related problems.
Sufficient condition for Pareto optimization in Banach spaces
Sufficient conditions and duality for multiobjective variational problems with generalized B-invexity
Sufficient conditions of optimality for multiobjective optimization problems with γ-paraconvex data
We study multiobjective optimization problems with γ-paraconvex multifunction data. Sufficient optimality conditions for unconstrained and constrained problems are given in terms of contingent derivatives.
Sufficient decrease principle on Riemannian manifolds.
Sufficient optimality conditions and semi-smooth newton methods for optimal control of stationary variational inequalities
In this paper sufficient second order optimality conditions for optimal control problems subject to stationary variational inequalities of obstacle type are derived. Since optimality conditions for such problems always involve measures as Lagrange multipliers, which impede the use of efficient Newton type methods, a family of regularized problems is introduced. Second order sufficient optimality conditions are derived for the regularized problems...
Sufficient optimality conditions and semi-smooth newton methods for optimal control of stationary variational inequalities
In this paper sufficient second order optimality conditions for optimal control problems subject to stationary variational inequalities of obstacle type are derived. Since optimality conditions for such problems always involve measures as Lagrange multipliers, which impede the use of efficient Newton type methods, a family of regularized problems is introduced. Second order sufficient optimality conditions are derived for the regularized problems...
Sufficient Second Order Optimality Conditions for C^1 Multiobjective Optimization Problems
2000 Mathematics Subject Classification: Primary 90C29; Secondary 90C30.In this work, we use the notion of Approximate Hessian introduced by Jeyakumar and Luc [19], and a special scalarization to establish sufficient optimality conditions for constrained multiobjective optimization problems. Throughout this paper, the data are assumed to be of class C^1, but not necessarily of class C^(1.1).
Sum-Of-Squares Clustering on Networks
Superadditivity in general fuzzy coalition games
The superadditivity and related concepts belong to the fundamental ones in the coalition game theory. Their definition in general coalition games (games without side-payments) is based on the set theoretical approaches. It means that in the case of fuzzy coalition games the set theoretical model can be modified into the fuzzy set theoretical one. In this paper, the coalition games without side-payments and with fuzzy expectations of the pay-offs of players are considered and it is shown that for...
Superlinear Convergence of Symmetric Huang's Class of Methods.
Supervised learning for record linkage through weighted means and OWA operators
Support properties of a family of connected compact sets
A problem of finding a system of proportionally located parallel supporting hyperplanes of a family of connected compact sets is analyzed. A special attention is paid to finding a common supporting halfspace. An existence theorem is proved and a method of solution is proposed.
Support separation theorems and their applications to vector surrogate reverse duality
Sur des méthodes d'optimisation par relaxation
Sur la convergence de la méthode d'Adomian