Showing 1 - 10 of 27
We consider the problem of finding the minimum of a real-valued multivariate polynomial function constrained in a compact set defined by polynomial inequalities and equalities. This problem, called polynomial optimization problem (POP), is generally nonconvex and has been of growing interest to...
Persistent link: https://www.econbiz.de/10008491699
Persistent link: https://www.econbiz.de/10008775650
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
In this paper, we first propose a portfolio management model where the objective is to balance equity and liability. The asset price dynamics includes both permanent and temporary price impact, where the permanent impact is a linear function of the cumulative trading amount and the temporary...
Persistent link: https://www.econbiz.de/10011209357
In this paper we provide a generalization of a Positivstellensatz by Pólya [Pólya in Naturforsch Ges Zürich 73:141–145 <CitationRef CitationID="CR18">1928</CitationRef>]. We show that if a homogeneous polynomial is positive over the intersection of the non-negative orthant and a given basic semialgebraic cone (excluding the origin),...</citationref>
Persistent link: https://www.econbiz.de/10011240889
It has been observed that the Handelman’s certificate of positivity of a polynomial over a compact polyhedron offers a hierarchical relaxation scheme for polynomial programs. The Handelman hierarchy seems particularly suitable for a class of combinatorial optimizations that are formulated as a...
Persistent link: https://www.econbiz.de/10010896415
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
Persistent link: https://www.econbiz.de/10010845840
Persistent link: https://www.econbiz.de/10010845846
We observe that in a simple one-dimensional polynomial optimization problem (POP), the ‘optimal’ values of semidefinite programming (SDP) relaxation problems reported by the standard SDP solvers converge to the optimal value of the POP, while the true optimal values of SDP relaxation...
Persistent link: https://www.econbiz.de/10010847466