Unconstrained and constrained global optimization of polynomial functions in one variable

DOI10.1007/BF00121303zbMath0781.90084OpenAlexW2095102087MaRDI QIDQ1187372

V. Visweswaran, Christodoulos A. Floudas

Publication date: 13 August 1992

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00121303

zbMATH Keywords

global optimizationconstrained nonconvex problemspolynomial functions of one variable

Mathematics Subject Classification ID

Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Simple global minimization algorithm for one-variable rational functions, A new algorithm for solving the general quadratic programming problem, New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems, Global optimality conditions and optimization methods for constrained polynomial programming problems, Partitioning procedure for polynomial optimization, Computation of polytopic invariants for polynomial dynamical systems using linear programming, Optimization methods for box-constrained nonlinear programming problems based on linear transformation and Lagrange interpolating polynomials, Robust stability analysis of systems with real parametric uncertainty: A global optimization approach, Global optimality conditions and optimization methods for polynomial programming problems, Convergence of the (GOP) algorithm for a large class of smooth optimization problems, 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, Generalized primal-relaxed dual approach for global optimization, 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

Cites Work

• The cubic algorithm
• An interval version of Shubert's iterative method for the localization of the global maximum
• The Beta-algorithm
• On Timonov's algorithm for global optimization of univariate Lipschitz functions
• Global optimization of univariate Lipschitz functions. I: Survey and properties
• Global optimization using interval analysis: The one-dimensional case
• New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints
• Primal-relaxed dual global optimization approach
• Globally minimizing polynomials without evaluating derivatives
• Global minimization of univariate functions by sequential polynomial approximation
• An algorithm for finding the absolute extremum of a function
• On Descent from Local Minima
• Numerical methods for finding global extrema (Case of a non-uniform mesh)
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item