Unconstrained and constrained global optimization of polynomial functions in one variable
From MaRDI portal
Recommendations
- Univariate parameterization for global optimization of mixed-integer polynomial problems
- On global optimizations with polynomials
- Unconstrained Parametric Minimization of a Polynomial: Approximate and Exact
- Global minimization of univariate functions by sequential polynomial approximation
- Semidefinite Approximations for Global Unconstrained Polynomial Optimization
- Global optimality conditions and optimization methods for constrained polynomial programming problems
- Global optimization of polynomials restricted to a smooth variety using sums of squares
- Global optimality conditions and optimization methods for polynomial programming problems
- Some applications of a polynomial inequality to global optimization
- A global optimization algorithm for polynomial programming
Cites work
- An algorithm for finding the absolute extremum of a function
- An interval version of Shubert's iterative method for the localization of the global maximum
- Global minimization of univariate functions by sequential polynomial approximation
- Global optimization of univariate Lipschitz functions. I: Survey and properties
- Global optimization using interval analysis: The one-dimensional case
- Globally minimizing polynomials without evaluating derivatives
- scientific article; zbMATH DE number 3649911 (Why is no real title available?)
- scientific article; zbMATH DE number 3690565 (Why is no real title available?)
- scientific article; zbMATH DE number 193463 (Why is no real title available?)
- scientific article; zbMATH DE number 3485507 (Why is no real title available?)
- scientific article; zbMATH DE number 1024452 (Why is no real title available?)
- New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints
- Numerical methods for finding global extrema (Case of a non-uniform mesh)
- On Descent from Local Minima
- On Timonov's algorithm for global optimization of univariate Lipschitz functions
- Primal-relaxed dual global optimization approach
- The Beta-algorithm
- The cubic algorithm
Cited in
(20)- Decomposition and interval arithmetic applied to global minimization of polynomial and rational functions
- A remark on the GOP algorithm for global optimization
- Primal-relaxed dual global optimization approach
- New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems
- Algorithms for unconstrained global optimization of nonlinear (polynomial) programming problems: the single and multi-segment polynomial B-spline approach
- Global optimality conditions and optimization methods for constrained polynomial programming problems
- Univariate polynomial optimization with sum-of-squares interpolants
- Optimization methods for box-constrained nonlinear programming problems based on linear transformation and Lagrange interpolating polynomials
- Convergence of the (GOP) algorithm for a large class of smooth optimization problems
- Simple global minimization algorithm for one-variable rational functions
- A new algorithm for solving the general quadratic programming problem
- Computation of polytopic invariants for polynomial dynamical systems using linear programming
- Atomic optimization. I: Search space transformation and one-dimensional problems
- Generalized primal-relaxed dual approach for global optimization
- An Adapted Branch and Bound Algorithm for Approximating Real Root of a Ploynomial
- Convex quadratic underestimation and Branch and Bound for univariate global optimization with one nonconvex constraint
- scientific article; zbMATH DE number 4062839 (Why is no real title available?)
- Robust stability analysis of systems with real parametric uncertainty: A global optimization approach
- Global optimality conditions and optimization methods for polynomial programming problems
- Partitioning procedure for polynomial optimization
This page was built for publication: Unconstrained and constrained global optimization of polynomial functions in one variable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1187372)
