Bound-Constrained Polynomial Optimization Using Only Elementary Calculations
نویسندگان
چکیده
منابع مشابه
Bound-Constrained Polynomial Optimization Using Only Elementary Calculations
We provide a monotone non increasing sequence of upper bounds f k (k ≥ 1) converging to the global minimum of a polynomial f on simple sets like the unit hypercube. The novelty with respect to the converging sequence of upper bounds in [J.B. Lasserre, A new look at nonnegativity on closed sets and polynomial optimization, SIAM J. Optim. 21, pp. 864–885, 2010] is that only elementary computation...
متن کاملConstrained Polynomial Optimization Problems with Noncommuting Variables
In this paper we study constrained eigenvalue optimization of noncommutative (nc) polynomials, focusing on the polydisc and the ball. Our three main results are as follows: (1) an nc polynomial is nonnegative if and only if it admits a weighted sum of hermitian squares decomposition; (2) (eigenvalue) optima for nc polynomials can be computed using a single semidefinite program (SDP) – this shar...
متن کاملGeneral Constrained Polynomial Optimization: an Approximation Approach
In this paper, we consider approximation algorithms for optimizing a generic multi-variate (inhomogeneous) polynomial function, subject to some fairly general constraints. The focus is on the design and analysis of polynomial-time approximation algorithms. First, we study the problem of maximizing a polynomial function over the Euclidean ball. A polynomialtime approximation algorithm is propose...
متن کاملRecent Advances in Bound Constrained Optimization
A new active set algorithm (ASA) for large-scale box constrained optimization is introduced. The algorithm consists of a nonmonotone gradient projection step, an unconstrained optimization step, and a set of rules for switching between the two steps. Numerical experiments and comparisons are presented using box constrained problems in the CUTEr and MINPACK test problem libraries. keywords: Nonm...
متن کاملBenchmarking of bound-constrained optimization software
In this report we describe a comparison of different algorithms for solving nonlinear optimization problems with simple bounds on the variables. Moreover, we would like to come out with an assessment of the optimization library DOT used in the optimization suite OPTALIA at Airbus for this kind of problems.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Operations Research
سال: 2017
ISSN: 0364-765X,1526-5471
DOI: 10.1287/moor.2016.0829