Get started
Keyword

polynomial optimization

Description: Polynomial optimization is the study of minimizing or maximizing polynomial objective functions subject to polynomial equality and inequality constraints.
OpenAlex ID: keywords/polynomial-optimization
Global Optimization with Polynomials and the Problem of Moments
2001 · Jean B. Lasserre · SIAM Journal on Optimization · 2,477
Moments, Positive Polynomials and Their Applications
2009 · Jean Bernard Lasserre · Series on optimization and its applications · 880
A feasible method for optimization with orthogonality constraints
2012 · Zaiwen Wen, Wotao Yin · Mathematical Programming · 850
Sums of Squares, Moment Matrices and Optimization Over Polynomials
2008 · Monique Laurent · ˜The œIMA volumes in mathematics and its applications · 663
Convex Analysis and Global Optimization
1998 · Hoang Tuy · Nonconvex optimization and its applications · 611
Introducing SOSTOOLS: a general purpose sum of squares programming solver
2003 · S. Prajna, A. Papachristodoulou, et al. · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · 556
GloptiPoly 3: moments, optimization and semidefinite programming
2009 · Didier Henrion, Jean-Bernard Lasserre, et al. · Optimization methods & software · 538
PDF
Semidefinite Optimization and Convex Algebraic Geometry
2012 · Society for Industrial and Applied Mathematics eBooks · 472
Optimal Inequalities in Probability Theory: A Convex Optimization Approach
2005 · Dimitris Bertsimas, Ioana Popescu · SIAM Journal on Optimization · 430
PDF
LMI Techniques for Optimization Over Polynomials in Control: A Survey
2010 · Graziano Chesi · IEEE Transactions on Automatic Control · 392
GloptiPoly
2003 · Didier Henrion, Jean-Bernard Lasserre · ACM Transactions on Mathematical Software · 369
Positive Polynomials in Control
2005 · Garulli, Andrea, Henrion, Didier · Lecture notes in control and information sciences · 343
Handbook on Semidefinite, Conic and Polynomial Optimization
2011 · Lasserre, Jean-Bernard, Miguel, Anjos, F. · International series in management science/operations research/International series in operations research & management science · 325
Positive Polynomials and Sums of Squares
2008 · Murray Marshall · Mathematical surveys and monographs · 288
Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
2006 · Jean B. Lasserre · SIAM Journal on Optimization · 282
Nondifferentiable Optimization and Polynomial Problems
1998 · Naum Z. Shor · Nonconvex optimization and its applications · 270
An Introduction to Polynomial and Semi-Algebraic Optimization
2015 · Jean Bernard Lasserre · Cambridge University Press eBooks · 260
Optimality conditions and finite convergence of Lasserre’s hierarchy
2013 · Jiawang Nie · Mathematical Programming · 251
PDF
The Moment Problem
2017 · Konrad Schmüdgen · Graduate texts in mathematics · 234
Letter to the Editor—Reduction of Integer Polynomial Programming Problems to Zero-One Linear Programming Problems
1967 · Lawrence J. Watters · Operations Research · 219
Class of global minimum bounds of polynomial functions
1988 · N. Z. Shor · Cybernetics and Systems Analysis · 213
DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization
2019 · Amir Ali Ahmadi, Anirudha Majumdar · SIAM Journal on Applied Algebra and Geometry · 200
PDF
A method of unconstrained global optimization
1970 · Hans Bremermann · Mathematical Biosciences · 199
Convergent Relaxations of Polynomial Optimization Problems with Noncommuting Variables
2010 · S. Pironio, M. Navascués, et al. · SIAM Journal on Optimization · 195
PDF
On the complexity of Putinar's Positivstellensatz
2006 · Jiawang Nie, Markus Schweighofer · Journal of Complexity · 182
PDF
Works count: 2,242
Citation count: 29,320
Year
Topic
Type