Abstract — In algebraic geometry, the concept of Gröbner basis allows a systematic study of the solution of a system of polynomial equations. This concept can be applied to find the global (and all local optima) optimum of a nonlinear, not necessarily convex function, the only restriction being that the objective function be polynomial. The method is based on computing a lexicographic (lex) ordered Gröbner basis for the ideal generated by the first order necessary conditions defined by the Lagrangian. Computing the optimal solution is then equivalent to computing the variety corresponding to this ideal. By virtue of the (lex) ordering, the system is transformed in to set of polynomials which can be solved successively to obtain the soluti...
In this work, the combine the theory of generalized critical values with the theory of iterated ring...
Summarization: A deterministic spatial branch and bound global optimization algorithm is presented f...
A deterministic global optimization algorithm is proposed for locating the global minimum of general...
Global optimization is a branch of mathematical programming with fewer computational techniques and ...
International audienceThis is the first comprehensive introduction to the powerful moment approach f...
This paper discusses a power-based transformation technique that is especially useful when solving p...
2017 Summer.Includes bibliographical references.Numerical algebraic geometry (NAG) consists of a col...
Summarization: The optimization of systems which are described by ordinary differential equations (O...
Summarization: Many chemical engineering systems are described by differential equations. Their opti...
Some connections between constructive real algebraic geometry and constrained optimization are explo...
We present a novel efficient theoretical and numerical framework for solving global non-convex polyn...
Abstract In this paper, we develop necessary conditions for global optimality that apply to non-line...
Many engineering optimization problems can be formulated as nonconvex nonlinear pro-gramming problem...
Modern problems arising in many domains are driving a need for more capable, state-of-the-art optimi...
We propose a deterministic approach for global optimization of nonconvex quasisepa-rable problems en...
In this work, the combine the theory of generalized critical values with the theory of iterated ring...
Summarization: A deterministic spatial branch and bound global optimization algorithm is presented f...
A deterministic global optimization algorithm is proposed for locating the global minimum of general...
Global optimization is a branch of mathematical programming with fewer computational techniques and ...
International audienceThis is the first comprehensive introduction to the powerful moment approach f...
This paper discusses a power-based transformation technique that is especially useful when solving p...
2017 Summer.Includes bibliographical references.Numerical algebraic geometry (NAG) consists of a col...
Summarization: The optimization of systems which are described by ordinary differential equations (O...
Summarization: Many chemical engineering systems are described by differential equations. Their opti...
Some connections between constructive real algebraic geometry and constrained optimization are explo...
We present a novel efficient theoretical and numerical framework for solving global non-convex polyn...
Abstract In this paper, we develop necessary conditions for global optimality that apply to non-line...
Many engineering optimization problems can be formulated as nonconvex nonlinear pro-gramming problem...
Modern problems arising in many domains are driving a need for more capable, state-of-the-art optimi...
We propose a deterministic approach for global optimization of nonconvex quasisepa-rable problems en...
In this work, the combine the theory of generalized critical values with the theory of iterated ring...
Summarization: A deterministic spatial branch and bound global optimization algorithm is presented f...
A deterministic global optimization algorithm is proposed for locating the global minimum of general...