Showing 1 - 9 of 9
A basic closed semialgebraic subset of Rn\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbb...
Persistent link: https://www.econbiz.de/10014501895
Convex underestimators of a polynomial on a box. Given a non convex polynomial <InlineEquation ID="IEq1"> <EquationSource Format="TEX">$${f\in \mathbb{R}[{\rm x}]}$$</EquationSource> </InlineEquation> and a box <InlineEquation ID="IEq2"> <EquationSource Format="TEX">$${{\rm B}\subset \mathbb{R}^n}$$</EquationSource> </InlineEquation>, we construct a sequence of convex polynomials <InlineEquation ID="IEq3"> <EquationSource Format="TEX">$${(f_{dk})\subset \mathbb{R}[{\rm x}]}$$</EquationSource> </InlineEquation>, which converges in a strong sense to the...</equationsource></inlineequation></equationsource></inlineequation></equationsource></inlineequation>
Persistent link: https://www.econbiz.de/10010994036
Persistent link: https://www.econbiz.de/10010994039
We provide motivations for the correlated equilibrium solution concept from the game-theoretic and optimization perspectives. We then propose an algorithm that computes <InlineEquation ID="IEq1"> <EquationSource Format="TEX">$${\varepsilon}$$</EquationSource> </InlineEquation> -correlated equilibria with global-optimal (i.e., maximum) expected social welfare for normal form...</equationsource></inlineequation>
Persistent link: https://www.econbiz.de/10010994047
A small polygon is a convex polygon of unit diameter. We are interested in small polygons which have the largest area for a given number of vertices n. Many instances are already solved in the literature, namely for all odd n, and for n = 4, 6 and 8. Thus, for even n ≥ 10, instances of this...
Persistent link: https://www.econbiz.de/10010994077
Several algorithms are available in the literature for finding the entire set of Pareto-optimal solutions of Multiobjective Linear Programmes (MOLPs). However, all of them are based on active-set methods (simplex-like approaches). We present a different method, based on a transformation of any...
Persistent link: https://www.econbiz.de/10010845814
In this paper, we propose a new deterministic global optimization method for solving nonlinear optimal control problems in which the constraint conditions of differential equations and the performance index are expressed as polynomials of the state and control functions. The nonlinear optimal...
Persistent link: https://www.econbiz.de/10010600689
Persistent link: https://www.econbiz.de/10008925259
Persistent link: https://www.econbiz.de/10010896421