Global optimality conditions and optimization methods for constrained polynomial programming problems
A new method for solving linear ill-posed problems
Global solutions to a class of CEC benchmark constrained optimization problems
To be fair or efficient or a bit of both
Are you sure you would like to clear your session, including search history and login status?