Results 1  10
of
31
A General Class of Convexification Transformation for the Noninferior Frontier of a Multiobjective Program
, 2012
"... Copyright © 2013 Tao Li et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. A general class of convexification transformations is ..."
Abstract
 Add to MetaCart
Copyright © 2013 Tao Li et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. A general class of convexification transformations
SYMPLECTIC PONTRYAGIN APPROXIMATIONS FOR OPTIMAL DESIGN
 MATHEMATICAL MODELLING AND NUMERICAL ANALYSIS
, 1999
"... The powerful HamiltonJacobi theory is used for constructing regularizations and error estimates for optimal design problems. The constructed Pontryagin method is a simple and general method for optimal design and reconstruction: the first, analytical, step is to regularize the Hamiltonian; next the ..."
Abstract

Cited by 6 (5 self)
 Add to MetaCart
The powerful HamiltonJacobi theory is used for constructing regularizations and error estimates for optimal design problems. The constructed Pontryagin method is a simple and general method for optimal design and reconstruction: the first, analytical, step is to regularize the Hamiltonian; next
Approachability in unknown games: Online learning meets multiobjective optimization
"... In the standard setting of approachability there are two players and a target set. The players play a repeated vectorvalued game where one of them wants to have the average vectorvalued payoff converge to the target set which the other player tries to exclude. We revisit the classical setting and ..."
Abstract
 Add to MetaCart
that there is a known game structure with actions for two players. Rather, the player receives an arbitrary vectorvalued reward vector at every round. We show that it is impossible, in general, to approach the best target set in hindsight. We further propose a concrete strategy that approaches a non
Discrete Convexity and Equilibria in Economies with Indivisible Goods and Money
 MATH. SOCIAL SCI
, 2000
"... We consider a variant of the standard ArrowDebreu model which contains a number of indivisible goods and one perfectly divisible good (numeraire or money). The objective of this paper is to clarify a general mathematical mechanism which guarantees the existence of an equilibrium in such a model. I ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
. It is shown that the crucial condition for the existence of an equilibrium is that the sets of supply and demand of indivisible goods should belong to a class of "discrete convexity." The class of generalized polymatroids provides one of the most interesting classes of discrete convexity.
A VARIATIONAL PROBLEM ARISING IN ECONOMICS: APPROXIMATE SOLUTIONS AND THE LAW OF LARGE NUMBERS
, 1981
"... ..."
Stochastic games with a Single Controller and Incomplete
 Information, Discussion Paper 1346, Center for Mathematical Studies in Economics and Management Science, Northwestern
, 2002
"... Abstract. We study stochastic games with incomplete information on one side, in which the transition is controlled by one of the players. We prove that if the informed player also controls the transitions, the game has a value, whereas if the uninformed player controls the transitions, the maxmin v ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
Abstract. We study stochastic games with incomplete information on one side, in which the transition is controlled by one of the players. We prove that if the informed player also controls the transitions, the game has a value, whereas if the uninformed player controls the transitions, the max
www.elsevier.com/locate/hm The origins of quasiconcavity: a development between mathematics and economics
, 2003
"... The origins of the notion of quasiconcave function are considered, with special interest in some work by John von Neumann, Bruno de Finetti, and W. Fenchel. The development of such pioneering studies subsequently led to a whole field of research, known as “generalized convexity. ” The different sty ..."
Abstract
 Add to MetaCart
The origins of the notion of quasiconcave function are considered, with special interest in some work by John von Neumann, Bruno de Finetti, and W. Fenchel. The development of such pioneering studies subsequently led to a whole field of research, known as “generalized convexity. ” The different
Banach Spaces Determined By Their Uniform Structures
 Funct. Anal
, 1996
"... Following results of Bourgain and Gorelik we show that the spaces ` p , 1 ! p ! 1, as well as some related spaces have the following uniqueness property: If X is a Banach space uniformly homeomorphic to one of these spaces then it is linearly isomorphic to the same space. We also prove that if a C(K ..."
Abstract

Cited by 18 (3 self)
 Add to MetaCart
Following results of Bourgain and Gorelik we show that the spaces ` p , 1 ! p ! 1, as well as some related spaces have the following uniqueness property: If X is a Banach space uniformly homeomorphic to one of these spaces then it is linearly isomorphic to the same space. We also prove that if a C
Variational representations for Ncyclically monotone vector fields
, 2012
"... Given a convex bounded domain Ω in R d and an integer N ≥ 2, we associate to any jointly Nmonotone (N − 1)tuplet (u1, u2,..., uN−1) of vector fields from Ω into R d, a Hamiltonian H on R d × R d... × R d, that is concave in the first variable, jointly convex in the last (N − 1) variables such that ..."
Abstract

Cited by 10 (4 self)
 Add to MetaCart
Given a convex bounded domain Ω in R d and an integer N ≥ 2, we associate to any jointly Nmonotone (N − 1)tuplet (u1, u2,..., uN−1) of vector fields from Ω into R d, a Hamiltonian H on R d × R d... × R d, that is concave in the first variable, jointly convex in the last (N − 1) variables
Research Statement
"... This article documents work that ranges from the basic step of level set methods, that is, constructing level set functions, to extending the level set method to more general equations and applications. For clarity, I will begin by giving a summary of my research, followed by a slightly more indept ..."
Abstract
 Add to MetaCart
This article documents work that ranges from the basic step of level set methods, that is, constructing level set functions, to extending the level set method to more general equations and applications. For clarity, I will begin by giving a summary of my research, followed by a slightly more in
Results 1  10
of
31