Results 301 to 310 of about 2,345,368 (345)

Minimizing Job Idleness in Deadline Constrained Environments

Operations Research, 1992
The paper presents a formulation of an n-job, m-machine flowshop problem whose objective is to determine a processing sequence of jobs that minimizes total job idleness subject to meeting job deadlines. A mirror image problem is defined with the property that there is a one-to-one correspondence between the feasible schedules of the original problem ...
Reza H. Ahmadi, Uttarayan Bagchi
openaire   +1 more source

An Adaptive Random Search Algorithm for Constrained Minimization

IEEE Transactions on Computers, 1972
The well-known pattern search method has been randomized by Lawrence and Steiglitz [4] in order to augment its ability to adapt to direction. In this note we introduce other refinements in order to make it more adaptive in step size, and the use of penalty terms is incorporated as so to accommodate constraints.
Edward J. Beltrami, Joseph Paul Indusi
openaire   +2 more sources

Calculation of a Constrained Minimal Symmetric Matrix

SIAM Journal on Applied Mathematics, 1974
A procedure is derived for calculating a symmetric matrix, P, with minimal sum of the squares of its elements, which satisfies $PB = A$. B and A are rectangular or square matrices. It is necessary that $AB^ + B = A$, which is not a trivial requirement if B has more columns than rows, or if B is not of full rank.
openaire   +2 more sources

On Penalty and Multiplier Methods for Constrained Minimization

SIAM Journal on Control and Optimization, 1976
In this paper we consider a generalized class of quadratic penalty function methods for the solution of nonconvex nonlinear programming problems. This class contains as special cases both the usual quadratic penalty function method and the recently proposed multiplier method.
openaire   +1 more source

Constrained via minimization for systolic arrays

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1990
Due to progress in VLSI technology, algorithm-oriented array architectures such as systolic arrays or bit-slice structures appear to be effective, feasible, and economic. The constrained-via-minimization problem for circuits composed of arrays of identical cells C is discussed.
openaire   +1 more source

On the Resolution of Linearly Constrained Convex Minimization Problems

SIAM Journal on Optimization, 1994
Summary: The problem of minimizing a twice differentiable convex function \(f\) is considered, subject to \(Ax= b\), \(x\geq 0\), where \(A\in \mathbb{R}^{M\times N}\), \(M\), \(N\) are large and the feasible region is bounded. It is poven that this problem is equivalent to a ``primal-dual'' box-constrained problem with \(2N+ M\) variables.
Ana Friedlander, José Mario Martínez, Sandra Augusta Santos   +2 more
openaire   +2 more sources

Linearly constrained minimization

1985
After chapter 5 it should come as no surprise that there are specific methods for linear, as opposed to non-linear, constraints. Broadly speaking these methods, which may be called projection methods, take the search vectors generated by a standard unconstrained minimization technique and project them so that they lie in the intersection of a set of ...
openaire   +1 more source

Partial Affine-Scaling for Linearly Constrained Minimization

Mathematics of Operations Research, 1995
We propose an interior point method for finding a stationary point of a nonlinear program with linear equality and nonnegativity constraints. This method maintains a basis at each iteration and updates the iterate by taking an affine-scaling step in the space of nonbasic variables.
openaire   +1 more source

An affine scaling interior trust-region method combining with nonmonotone line search filter technique for linear inequality constrained minimization

International Journal of Computational Mathematics, 2018
Dan Li, D. Zhu
semanticscholar   +1 more source

A Preconditioner for Substructuring Based on Constrained Energy Minimization

SIAM Journal on Scientific Computing, 2003
Summary: A preconditioner for substructuring based on constrained energy minimization concepts is presented. The preconditioner is applicable to both structured and unstructured meshes and offers a straightforward approach for the iterative solution of second- and fourth-order structural mechanics problems.
openaire   +1 more source