An algorithm of global optimization for rational functions with rational constraints
From MaRDI portal
The objective and the constraints functions of a nonlinear minimization problem are supposed continuously differentiable and rational. The problem is reduced to the standard form where constraints are either equalities or open interval costraints. A standard problem is transformed into two systems of equations using first-order necessary conditions of local minimum. The obtained systems of equations are solved iteratively by a method implied by the theoretical results on roots of polynomials.
Recommendations
- An algorithm for solving global optimization problems with nonlinear constraints
- Minimizing the sum of many rational functions
- scientific article; zbMATH DE number 3854326
- Global optimization of rational functions: a semidefinite programming approach
- Global minimization of rational functions and the nearest GCDs
Cited in
(9)- Global optimization of polynomials over real algebraic sets
- Simple global minimization algorithm for one-variable rational functions
- Global minimization of rational functions and the nearest GCDs
- Global optimization of rational functions: a semidefinite programming approach
- A sixth bibliography of fractional programming
- Overlap domain decomposition method for bioluminescence tomography (BLT)
- Supporting global numerical optimization of rational functions by generic symbolic convexity tests
- scientific article; zbMATH DE number 4091191 (Why is no real title available?)
- Minimizing rational functions by exact Jacobian SDP relaxation applicable to finite singularities
This page was built for publication: An algorithm of global optimization for rational functions with rational constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5928423)
