Pages that link to "Item:Q1187372"

The following pages link to Unconstrained and constrained global optimization of polynomial functions in one variable (Q1187372):

Displaying 16 items.

• Global optimality conditions and optimization methods for polynomial programming problems (Q496629) (← links)
• Partitioning procedure for polynomial optimization (Q604960) (← links)
• Decomposition and interval arithmetic applied to global minimization of polynomial and rational functions (Q1310976) (← links)
• A remark on the GOP algorithm for global optimization (Q1310984) (← links)
• Primal-relaxed dual global optimization approach (Q1321372) (← links)
• New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems (Q1371947) (← links)
• Global optimality conditions and optimization methods for constrained polynomial programming problems (Q1663418) (← links)
• Optimization methods for box-constrained nonlinear programming problems based on linear transformation and Lagrange interpolating polynomials (Q1706680) (← links)
• Convergence of the (GOP) algorithm for a large class of smooth optimization problems (Q1804587) (← links)
• Simple global minimization algorithm for one-variable rational functions (Q1892608) (← links)
• A new algorithm for solving the general quadratic programming problem (Q1908926) (← links)
• Computation of polytopic invariants for polynomial dynamical systems using linear programming (Q1932703) (← links)
• Generalized primal-relaxed dual approach for global optimization (Q2565021) (← links)
• An Adapted Branch and Bound Algorithm for Approximating Real Root of a Ploynomial (Q3627691) (← links)
• Convex quadratic underestimation and Branch and Bound for univariate global optimization with one nonconvex constraint (Q3635703) (← links)
• Robust stability analysis of systems with real parametric uncertainty: A global optimization approach (Q4882286) (← links)