Unconstrained Parametric Minimization of a Polynomial: Approximate and Exact

DOI10.1007/978-3-540-87827-8_2zbMATH Open1166.65347OpenAlexW1543993108MaRDI QIDQ3597977FDOQ3597977

Authors: Songxin Liang, D. J. Jeffrey 

Publication date: 29 January 2009

Published in: Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-87827-8_2

Recommendations

• Minimizing polynomial functions
• On the minimum of a positive polynomial over the standard simplex
• ON AN EXTREMAL PROBLEM ON THE MINIMUM OF A TRIGONOMETRIC POLYNOMIAL
• On global optimizations with polynomials
• Equality-constrained minimization of polynomial functions

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Numerical integration (65D30)

Cites Work

• Title not available (Why is that?)
• Encyclopedia of optimization. In 6 vols.
• Positivity Conditions for Quartic Polynomials
• Title not available (Why is that?)
• Quantifier elimination: Optimal solution for two classical examples
• Parametric optimization and approximation. Conference held at the Mathematisches Forschungsinstitut, Oberwolfach, October 16-22, 1983
• The evaluation of trigonometric integrals avoiding spurious discontinuities
• The Importance of Being Continuous
• Title not available (Why is that?)

Cited In (4)

• Minimizer Extraction in Polynomial Optimization Is Robust
• An efficient, strongly polynomial, \(\varepsilon\)-approximation parametric optimization scheme
• The near-best solution of a polynomial minimization problem by the Carathéodory-Fejér method
• Unconstrained and constrained global optimization of polynomial functions in one variable

This page was built for publication: Unconstrained Parametric Minimization of a Polynomial: Approximate and Exact

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3597977)