In this paper, we investigate the nite element method for numerically identifying physical parameters in parabolic initial-boundary value problems. The identifying problem is rst formulated as a constrained minimization problem using the output least squares approach with the H 1-regularization or BV-regularization. Then a simple nite element method is used to approximate the constrained minimi...

We consider the expected residual minimization formulation of the stochastic R0 matrix linear complementarity problem. We show that the involved matrix being a stochastic R0 matrix is a necessary and sufficient condition for the solution set of the expected residual minimization problem to be nonempty and bounded. Moreover, local and global error bounds are given for the stochastic R0 matrix li...

assembly lines are special kinds of production systems which are of great importance in the industrial production of high quantity commodities. in many practical manufacturing systems, configuration of assembly lines is fixed and designing a new line may be incurred huge amount of costs and thereby it is not desirable for practitioners. when some changes related to market demand occur, it is wo...

Multi-criteria test-suite minimization aims to remove redundant test cases from a test suite based on some criteria such as code coverage, while trying to optimally maintain the capability of the reduced suite based on other criteria such as fault-detection effectiveness. Existing techniques addressing this problem with integer linear programming claim to produce optimal solutions. However, the...

In this article we propose a generalization of the determinant minimization criterion. The problem of minimizing the determinant of a matrix expression has implicit assumptions that the objective matrix is always nonsingular. In case of singular objective matrix the determinant would be zero and the minimization problem would be meaningless. To be able to handle all possible cases we generalize...

In this paper we consider the single-machine setup times scheduling with general effects of deterioration and learning. By the general effects of deterioration and learning, we mean that the actual job processing time is a general function of the processing times of the jobs already processed and its scheduled position. The setup times are proportional to the length of the already processed job...

The affine rank minimization problem consists of finding a matrix of minimum rank that satisfies a given system of linear equality constraints. Such problems have appeared in the literature of a diverse set of fields including system identification and control, Euclidean embedding, and collaborative filtering. Although specific instances can often be solved with specialized algorithms, the gene...

We consider minimization of a quadratic objective function subject to a sign-indefinite quadratic equality constraint. We derive necessary and sufficient conditions for the existence of solutions to the constrained minimization problem. These conditions involve a generalized eigenvalue of the matrix pencil consisting of a symmetric positivesemidefinite matrix and a symmetric indefinite matrix. ...

The optimal attitude estimate is often defined as the solution to a minimization problem. When the objective function of the minimization problem is quadratic in the attitude matrix or equivalently quartic in the attitude quaternion, for example, in GPS attitude determination, gradient-based iterative algorithms are usually used, which can only find the local minimizer. A novel numerical method...

The single-machine scheduling problems with position and sum-of-processing-time based processing times are considered. The actual processing time of a job is defined by function of its scheduled position and total normal processing time of jobs in front of it in the sequence. We provide optimal solutions in polynomial time for some special cases of the makespan minimization and the total comple...