Search Results - subject:"Polynomial optimization"

A polynomial optimization approach to principal-agent problems

Renner, Philipp; Schmedders, Karl - In: Econometrica : journal of the Econometric Society, an … 83 (2015) 2, pp. 729-769

Persistent link: https://www.econbiz.de/10011350620

A bilevel Farkas lemma to characterizing global solutions of a class of bilevel polynomial programs

Jeyakumar, Vaithilingam; Li, Guoyin - In: Operations research letters 43 (2015) 4, pp. 405-410

Persistent link: https://www.econbiz.de/10011372404

A Semidefinite Programming approach for solving Multiobjective Linear Programming

Blanco, Victor; Puerto, Justo; Ali, Safae El Haj Ben - In: Journal of Global Optimization 58 (2014) 3, pp. 465-480

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

Semidefinite relaxations for semi-infinite polynomial programming

Wang, Li; Guo, Feng - In: Computational Optimization and Applications 58 (2014) 1, pp. 133-159

. We first recall two SDP relaxation methods for solving polynomial optimization problems with finitely many constraints …

Persistent link: https://www.econbiz.de/10010847463

Economic-emission dispatch problem: A semi-definite programming approach

Jubril, A.M.; Olaniyan, O.A.; Komolafe, O.A.; Ogunbona, P.O. - In: Applied Energy 134 (2014) C, pp. 446-455

problem to a standard polynomial optimization problem which was formulated as a hierarchy of semi-definite relaxation problems …

Persistent link: https://www.econbiz.de/10010930669

Handelman’s hierarchy for the maximum stable set problem

Laurent, Monique; Sun, Zhao - In: Journal of Global Optimization 60 (2014) 3, pp. 393-423

The maximum stable set problem is a well-known NP-hard problem in combinatorial optimization, which can be formulated as the maximization of a quadratic square-free polynomial over the (Boolean) hypercube. We investigate a hierarchy of linear programming relaxations for this problem, based on a...

Persistent link: https://www.econbiz.de/10010938216

Approximation methods for complex polynomial optimization

Jiang, Bo; Li, Zhening; Zhang, Shuzhong - In: Computational Optimization and Applications 59 (2014) 1, pp. 219-248

Complex polynomial optimization problems arise from real-life applications including radar code design, MIMO … beamforming, and quantum mechanics. In this paper, we study complex polynomial optimization models where the objective function … polynomial functions. Approximation algorithms for the above-mentioned complex polynomial optimization models with worst …

Persistent link: https://www.econbiz.de/10010998316

Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations

Jeyakumar, V.; Li, G.; Srisatkunarajah, S. - In: Journal of Global Optimization 58 (2014) 1, pp. 31-50

under-estimators, we establish sufficient conditions for global optimality for classes of polynomial optimization problems …

Persistent link: https://www.econbiz.de/10010758665

Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness

Jeyakumar, Vaithilingam; Phạm, T. S.; Li, Guoyin - In: Operations research letters 42 (2014) 1, pp. 34-40

Persistent link: https://www.econbiz.de/10010259257

Probability bounds for polynomial functions in random variables

He, Simai; Jiang, Bo; Li, Zhening; Zhang, Shuzhong - In: Mathematics of operations research 39 (2014) 3, pp. 889-907

Persistent link: https://www.econbiz.de/10010402949