Polynomial Optimization (PO) refers to optimization problems in which all
objective and constraint functions are polynomials.  Such problems form an
important and remarkably general class of NP-hard global optimization
problems.  A fascinating feature of PO is that it can be approached from
several different directions.  Indeed, in addition to traditional techniques

drawn from operational research, computer science and numerical analysis,

new techniques have recently emerged based on concepts taken from

algebraic geometry, commutative algebra and moment theory.  For this
reason, PO is a rapidly expanding field.

 

We are pleased to announce this special issue of Mathematical Programming
Series B on PO, the deadline for which is 30th November 2013.   We welcome
papers on all aspects of PO, whether concerned with theory, applications,
algorithms or software.  Since we expect a large number of submissions,
all papers that we receive will be refereed to a high standard.  Papers that

are deemed to be of high quality, yet are not included in the special issue,

may be forwarded to either Mathematical Programming Series A or
Mathematical Programming Computation for consideration (with the agreement
of both the authors and the respective editor-in-chief).

 

Manuscripts must be submitted on-line via:

http://www.editorialmanager.com/mapr/

When prompted to Choose Article Type, please select

"S.I. : Polynomial Optimization - Series B" from the menu.  Due to limits in

page volume, we request that initial submissions be no more than 25 pages

in length.  We also request that papers use the standard Springer LaTeX

style "svjour3".  The necessary files are available at:

www.eng.cam.ac.uk/~dr241/MPB/MPB-Springer-latex-style-files.zip.

 

Many thanks in advance for your contributions to this special issue.

 

The guest editors:
Jean-Bernard Lasserre (LAAS-CNRS, Toulouse)
Adam Letchford (Lancaster, UK)
Pablo Parrilo (MIT)
David Steurer (Cornell).