Necessary and sufficient conditions for emptiness of the cones of generalized support vectors

© 2014, Springer-Verlag Berlin Heidelberg. The purpose of the paper is to establish the conditions which are necessary and sufficient for the cones of generalized (strong, strict) support vectors of a set in a finite-dimensional Euclidean space to be empty. In the present paper, an application of the proposed in J Optim Theory Appl (Gabidullina, J. Optim. Theory Appl. 158(1), 145–171, 2013) linear separability criterion for verification on emptiness or non-emptiness of the cones of GSVs (generalized support vectors) is also studied. We carry out the complete degeneracy analysis of the cones of GSVs for the different kinds of nonempty sets of Euclidean space. We present the different applications of the degeneracy analysis of the cones of GSVs as well

Classical and strong convexity of sublevel sets and application to attainable sets of nonlinear systems

Necessary and sufficient conditions for convexity and strong convexity, respectively, of sublevel sets that are defined by finitely many real-valued $C^{1,1}$-maps are presented. A novel characterization of strongly convex sets in terms of the so-called local quadratic support is proved. The results concerning strong convexity are used to derive sufficient conditions for attainable sets of continuous-time nonlinear systems to be strongly convex. An application of these conditions is a novel method to over-approximate attainable sets when strong convexity is present.Comment: 20 pages, 3 figure

Computation with Polynomial Equations and Inequalities arising in Combinatorial Optimization

The purpose of this note is to survey a methodology to solve systems of polynomial equations and inequalities. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear algebra or semidefinite programming relaxations of many kinds of feasibility or optimization questions. We are particularly interested in problems arising in combinatorial optimization.Comment: 28 pages, survey pape

DECOMPOSITION METHODS FOR SOLVING ONE TYPE OF VARIATIONAL INEQUALITIES

В настоящей работе мы изучаем декомпозиционные методы решения вариационных неравенств, тесно связанных с задачей линейного отделения множеств. Эти методы позволяют решать независимые подзадачи, на которые может быть разложено исходное вариационное неравенство, как последовательно, так и параллельно.In present paper, we treat the decomposition methods for solving the variational inequalities which are closely connected with the linear separation problem of sets. These methods allow one to solve the independent subproblems, into which the original variational inequality problem can be decoupled, successively as well as in parallel.178-17

Configurations of infinitely near points

We present a survey of some aspects and new results on configurations, i.e. disjoint unions of constellations of infinitely near points, local and global theory, with some applications and results on generalized Enriques diagrams, singular foliations, and linear systems defined by clusters

General equilibrium

Unlike partial equilibrium analysis which study the equilibrium of a particular market under the clause "ceteris paribus" that revenues and prices on the other markets stay approximately unaffected, the ambition of a general equilibrium model is to analyze the simultaneous equilibrium in all markets of a competitive economy. Definition of the abstract model, some of its basic results and insights are presented. The important issues of uniqueness and local uniqueness of equilibrium are sketched ; they are the condition for a predictive power of the theory and its ability to allow for statics comparisons. Finally, we review the main extensions of the general equilibrium model. Besides the natural extensions to infinitely many commodities and to a continuum of agents, some examples show how economic theory can accommodate the main ideas in order to study some contexts which were not thought of by the initial model.Commodity space, price space, exchange economy, production economy, feasible allocations, equilibrium, quasi-equilibrium, Pareto optimum, core, edgeworth equilibrium allocutions, time and uncertainty, continuum economies, non-convexities, public goods, incomplete markets.