Stationary points of quadratic functions under linear constraints

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Minimizing quadratic functions with separable quadratic constraints

This article deals with minimizing quadratic functions with a special form of quadratic constraints that arise in 3D contact problems of linear elasticity with isotropic friction [Haslinger, J., Kučera, R. and Dostál, Z., 2004, An algorithm for the numerical realization of 3D contact problems with Coulomb friction. Journal of Computational and Applied Mathematics, 164/165, 387–408.]. The propos...

متن کامل

Robust Linear Quadratic Control of Systems with Integral Quadratic Constraints

In this paper, we consider the robust linear quadratic (LQ) control problem for a class of uncertain linear systems which are subject to a general type of integral quadratic constraints (IQCs). Both analysis and synthesis problems are considered in this paper. For the analysis problem, we determine if the system satisses a desired linear quadratic performance index for all admissible uncertaint...

متن کامل

On computation of C-stationary points for equilibrium problems with linear complementarity constraints via homotopy method

MichalČervinka In the paper we consider EPCCs with convex quadratic objective functions and one set of complementarity constraints. For this class of problems we propose a possible generalization of the homotopy method for finding stationary points of MPCCs. We analyze the difficulties which arise from this generalization. Numerical results illustrate the performance for randomly generated test...

متن کامل

Scheduling under Linear Constraints

We introduce a parallel machine scheduling problem in which the processing times of jobs are not given in advance but are determined by a system of linear constraints. The objective is to minimize the makespan, i.e., the maximum job completion time among all feasible choices. This novel problem is motivated by various real-world application scenarios. We discuss the computational complexity and...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Computer Journal

سال: 1964

ISSN: 0010-4620,1460-2067

DOI: 10.1093/comjnl/7.3.238