A necessary condition - the Principle of Fermat-Lagrange - is offered for mixed smooth-convexoptimization problems. This generalizes and unifies most of the known necessary conditions forconcrete finite and infinite dimensional optimization problems of interest. The new idea in comparisonwith...

In this paper we consider optimization problems defined by a quadraticobjective function and a finite number of quadratic inequality constraints.Given that the objective function is bounded over the feasible set, we presenta comprehensive study of the conditions under which the optimal solution...

In this paper we introduce several classes of generalized convexfunctions already discussed in the literature and show the relationbetween those function classes. Moreover, for some of those functionclasses a Farkas-type theorem is proved. As such this paper unifiesand extends results existing...

Many economic and social situations can be represented by a digraph. Both axiomatic and iterativemethods to determine the strength or power of all the nodes in a digraph have been proposed inthe literature. We propose a new method, where the power of a node is determined by both thenumber of its...

We consider infinite products of the form ,where {mk} is an arbitrary sequence of trigonometric polynomials of degree at most n with uniformly bounded normssuch that mk(0)=1 for all k. We show that can decrease at infinity not faster than and present conditions underwhich this maximal decay...

Efficient influence functions and efficient score functions are representations of derivatives of maps. The invariance of theformer under changes of parametrization, and the formula relating the efficient influence function for the projection of aparameter to the efficient score function, turn...