An algorithm for indefinite quadratic programming with convex constraints
نویسندگان
چکیده
منابع مشابه
An interior point algorithm for convex quadratic programming with strict equilibrium constraints
We describe an interior point algorithm for convex quadratic problem with a strict complementarity constraints. We show that under some assumptions the approach requires a total of O( √ nL) number of iterations, where L is the input size of the problem. The algorithm generates a sequence of problems, each of which is approximately solved by Newton’s method.
متن کاملAn Analytic Solution for Some Separable Convex Quadratic Programming Problems with Equality and Inequality Constraints
In this paper we provide a complete analytic solution to a particular separable convex quadratic programming problem with bound and equality constraints. This study constitutes the generalization of prior papers in which additional simplifications were considered. We present an algorithm that leads to determination of the analytic optimal solution. We demonstrate that our algorithm is able to d...
متن کاملAn Interior Point Algorithm for Solving Convex Quadratic Semidefinite Optimization Problems Using a New Kernel Function
In this paper, we consider convex quadratic semidefinite optimization problems and provide a primal-dual Interior Point Method (IPM) based on a new kernel function with a trigonometric barrier term. Iteration complexity of the algorithm is analyzed using some easy to check and mild conditions. Although our proposed kernel function is neither a Self-Regular (SR) fun...
متن کاملCharacterization of Properly Efficient Solutions for Convex Multiobjective Programming with Nondifferentiable vanishing constraints
This paper studies the convex multiobjective optimization problem with vanishing constraints. We introduce a new constraint qualification for these problems, and then a necessary optimality condition for properly efficient solutions is presented. Finally by imposing some assumptions, we show that our necessary condition is also sufficient for proper efficiency. Our results are formula...
متن کاملAn implementation of an interior-point algorithm for convex quadratic programming using the identification of superfluous constraints
In this paper quadratic programming problems with strict convex objective functions f and linear constraints are considered. Based on a nonlinear separation theorem, a complete characterization of constraints that are superfluous in an optimal point is given. It allows to derive sufficient conditions for deletion of restrictions. The corresponding conditions can easily be checked if upper bound...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Letters
سال: 1991
ISSN: 0167-6377
DOI: 10.1016/0167-6377(91)90004-9