An algorithm of global optimization for rational functions with rational constraints (Q5928423): Difference between revisions

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.