Various algorithms can compute approximate feasible points or approximate solutions to equality and bound constrained optimization problems. In exhaustive search algorithms for gl...
ABSTRACT. We consider equilibrium constrained optimization problems, which have a general formulation that encompasses well-known models such as mathematical programs with equilibr...
S. Ilker Birbil, Gemayqzel Bouza, J. B. G. Frenk, ...
Abstract. We present a null-space primal-dual interior-point algorithm for solving nonlinear optimization problems with general inequality and equality constraints. The algorithm a...
One can reduce the problem of proving that a polynomial is nonnegative, or more generally of proving that a system of polynomial inequalities has no solutions, to finding polynomi...
— This paper deals with the tracking problem for constrained linear systems using a model predictive control (MPC) law. As it is well known, MPC provides a control law suitable f...