TY - JOUR TI - A Survey of Heuristic Algorithms AU - Uzsoy, R. T2 - Sanayi Muhendisligi DA - 1985/9// PY - 1985/9// VL - 4 SP - 20-22 ER - TY - JOUR TI - On the relation between the behavior and the distribution of the zeros of a polynomial AU - Huang, K AU - Li, Zhilin T2 - Journal of Nanjing University, Mathematics Biquarterly DA - 1985/// PY - 1985/// VL - 2 IS - 1 SP - 53–59 ER - TY - CONF TI - An illustration of a methodology for the construction of efficient systolic architectures in VLSI AU - Delosme, J.-M. AU - Ipsen, I.C.F. T2 - Second International Symposium on VLSI Technology, Systems and Applications C2 - 1985/// C3 - Proceedings of the Second International Symposium on VLSI Technology, Systems and Applications CY - Taipei, Taiwan DA - 1985/// PY - 1985/// SP - 268–273 ER - TY - RPRT TI - Multiple Link Outage Analysis, AT&T Bell Laboratories AU - Fang, S. DA - 1985/7// PY - 1985/7// M1 - 54112-850703-01 M3 - AT&T Bell Laboratories Internal Memorandum SN - 54112-850703-01 ER - TY - RPRT TI - Controlled Dual Perturbations for lp Programming AU - Fang, S. AU - Rajasekera, J.R. DA - 1985/11// PY - 1985/11// M1 - 54112-851115-01 M3 - AT&T Bell Laboratories Technical Memorandum SN - 54112-851115-01 ER - TY - RPRT TI - A Perturbation Method for Quadratically Constrained Quadratic Programming AU - Fang, S. AU - Rajasekera, J.R. DA - 1985/7// PY - 1985/7// M1 - 54112-850715-01 M3 - AT&T Bell Laboratories Technical Memorandum SN - 54112-850715-01 ER - TY - RPRT TI - A Dual Perturbation Method for Geometric Programming AU - Fang, S. AU - Rajasekera, J.R. DA - 1985/8// PY - 1985/8// M1 - 54112-850815-0 M3 - AT&T Bell Laboratories Technical Memorandum SN - 54112-850815-0 ER - TY - RPRT TI - Dynamic Facility Network Planning – Modeling AU - Fang, S. DA - 1985/9// PY - 1985/9// M1 - 54112–850915–01 M3 - AT&T Bell Laboratories Technical Memorandum SN - 54112–850915–01 ER - TY - RPRT TI - An Introduction to Multimode LITES AU - Murr, M.R. AU - Fang, S. A3 - AT&T Engineering Research Center DA - 1985/3// PY - 1985/3// M1 - CC8305 M3 - Technical Report PB - AT&T Engineering Research Center SN - CC8305 ER - TY - CONF TI - Finding a Simple Sequential Algorithm for Transportation Problems AU - Fang, S. AU - Murr, M.R. C2 - 1985/// C3 - IIE Proceedings of Annual Conference DA - 1985/// SP - 533 – 537 ER - TY - CONF TI - Diameter Class Optimization in Even Aged Stands AU - Roise, J.P. T2 - Society of American Foresters symposium A2 - Field, Richard C. A2 - Dress, Peter E. C2 - 1985/12/9/ C3 - Proceedings of S.A.F. Systems Analysis Symposium CY - Georgia Center for Continuing Education, Athens, Georgia DA - 1985/12/9/ PY - 1985/12/9/ ER - TY - JOUR TI - Optimal assortment with concave cost functions AU - Fang, S. C. T2 - International Journal of Systems Science AB - The assortment problem was introduced for decision-makers to select optimal production configurations to stock or manufacture. Early work on this topic assumed either linear cost functions or concave manufacturing costs with additive, proportional substitution costs. This paper extends the analysis to more general concave cost functions. Sufficient conditions for the existence of an optimal segmented policy are investigated. A dynamic programming algorithm for an optimal assortment is also included. DA - 1985/10// PY - 1985/10// DO - 10.1080/00207728508926753 VL - 16 IS - 10 SP - 1305-1311 J2 - International Journal of Systems Science LA - en OP - SN - 0020-7721 1464-5319 UR - http://dx.doi.org/10.1080/00207728508926753 DB - Crossref ER - TY - JOUR TI - An economic equilibrium model on a multicommodity network AU - Fang, S. C. AU - Peterson, E. L. T2 - International Journal of Systems Science AB - The paper considers a multicommodity network transhipment model involving producers, consumers, goods and transportation facilities. An equilibrium system of prices, supplies, demands and shipments is studied. In parallel with the work of Fang and Peterson (1983), the work introduces the convex programming and variational inequality approaches. Existence and uniqueness conditions under various monotonicity assumptions are derived. An application to private ownership economies is included. Some computational algorithms are also discussed. DA - 1985/4// PY - 1985/4// DO - 10.1080/00207728508926688 VL - 16 IS - 4 SP - 479-490 J2 - International Journal of Systems Science LA - en OP - SN - 0020-7721 1464-5319 UR - http://dx.doi.org/10.1080/00207728508926688 DB - Crossref ER - TY - JOUR TI - A fixed-point representation of the generalized complementarity problem AU - Fang, S. C. AU - Peterson, E. L. T2 - Journal of Optimization Theory and Applications DA - 1985/3// PY - 1985/3// DO - 10.1007/bf00938441 VL - 45 IS - 3 SP - 375-381 J2 - J Optim Theory Appl LA - en OP - SN - 0022-3239 1573-2878 UR - http://dx.doi.org/10.1007/bf00938441 DB - Crossref ER - TY - CONF TI - On the numerical approximations for linear functional differential equations with input and output delays AU - Tran, Hien AU - Manitius, A. T2 - 1985 24th IEEE Conference on Decision and Control AB - In this paper we state some new results on the approximations for linear retarded functional differential equations with delays in control and observation. We consider the finite difference (i.e., averaging) approximation scheme for such systems treated as evolution equations in the state space setup, and we establish several basic properties of the approximation scheme. These results are extensions of recent results of Lasiecka and ManitiusL1 to the case of systems with input and output delays. C2 - 1985/12// C3 - 1985 24th IEEE Conference on Decision and Control CY - Fort Lauderdale, FL DA - 1985/12// PY - 1985/12/11/ DO - 10.1109/cdc.1985.268746 PB - IEEE UR - http://dx.doi.org/10.1109/cdc.1985.268746 ER - TY - JOUR TI - Computation of closed-loop eigenvalues associated with the optimal regulator problem for functional differential equations AU - Manitius, A. AU - Tran, H. T2 - IEEE Transactions on Automatic Control AB - A solution of the linear quadratic control problem involving functional differential equations gives a linear feeback which modifies the original system dynamics. Under certain assumptions, the eigenvalues of the modified system constitute a stable part of the spectrum of a certain Hamiltonian operator. These eigenvalues can be computed without solving the infinite-dimensional Riccati equation. In this note we present a method to compute the eigenvalues directly from a characteristic equation of the optimal closed-loop system. Numerical results are presented for three examples and compared to those obtained by a finite-dimensional approximation of a functional differential equation. DA - 1985/12// PY - 1985/12// DO - 10.1109/tac.1985.1103866 VL - 30 IS - 12 SP - 1245-1248 J2 - IEEE Trans. Automat. Contr. LA - en OP - SN - 0018-9286 UR - http://dx.doi.org/10.1109/tac.1985.1103866 DB - Crossref ER - TY - ER - TY - JOUR TI - The Numerical Solution of Higher Index Linear Time Varying Singular Systems of Differential Equations AU - Campbell, Stephen L. T2 - SIAM Journal on Scientific and Statistical Computing AB - A family of Taylor-type methods is given for solving numerically a large class of singular systems of differential equations of the form $A(t)x'(t) + B(t)x(t) = f(t)$. The advantages, disadvantages, and implementation of these methods are discussed and several analytical and numerical examples are given. DA - 1985/4// PY - 1985/4// DO - 10.1137/0906024 VL - 6 IS - 2 SP - 334-348 J2 - SIAM J. Sci. and Stat. Comput. LA - en OP - SN - 0196-5204 2168-3417 UR - http://dx.doi.org/10.1137/0906024 DB - Crossref ER - TY - JOUR TI - Bounded solutions of discrete singular systems on infinite time intervals AU - Campbell, S. AU - Rodriguez, J. T2 - IEEE Transactions on Automatic Control AB - This paper concerns noncausal, nonlinear discrete singular systems of the form aX_{k+1} + Bx_{k} = m[x]_{k} on the infinite interval i = [0, 1, --.] for some causal, nonlinear time variable operators m . Existence theorems for bounded solutions are given. Methods for estimating the infinite time problem by a finite time problem are developed. DA - 1985/2// PY - 1985/2// DO - 10.1109/tac.1985.1103905 VL - 30 IS - 2 SP - 165-168 J2 - IEEE Trans. Automat. Contr. OP - SN - 0018-9286 1558-2523 UR - http://dx.doi.org/10.1109/tac.1985.1103905 DB - Crossref ER - TY - RPRT TI - Using PQ-trees for planar embedding problems AU - Stallmann, Matthias A3 - North Carolina State University. Dept. of Computer Science DA - 1985/// PY - 1985/// PB - North Carolina State University. Dept. of Computer Science ER - TY - CONF TI - Efficient algorithms for graphic matroid intersection and parity AU - Gabow, Harold N AU - Stallmann, Matthias T2 - Springer, Berlin, Heidelberg C2 - 1985/// C3 - International Colloquium on Automata, Languages, and Programming DA - 1985/// SP - 210-220 ER - TY - JOUR TI - Broyden's method for approximate solution of nonlinear integral equations AU - Kelley, C.T. AU - Sachs, E.W. T2 - Journal of Integral Equations DA - 1985/// PY - 1985/// VL - 9 IS - 1 SP - 25–44 ER - TY - JOUR TI - Why does the {F_N}-Method work? AU - Kelley, C T AU - Mullikin, T W T2 - Trans. Th. Stat. Phys. DA - 1985/// PY - 1985/// VL - 14 SP - 513-526 ER - TY - CONF TI - Analytical determination of normal contact stresses for arbitrary geometries with application to the tire/pavement interaction mechanism AU - Clapp, T G AU - Kelley, C T AU - Eberhardt, A C T2 - American Society for Testing and Materials A2 - Gillespie, T D A2 - Sayers, M C2 - 1985/// C3 - Measuring Road Roughness and its Effects on User Cost and Comfort CY - Baltimore DA - 1985/// SP - 162-178 ER - TY - JOUR TI - Expanded Convergence Domains for Newton’s Method at Nearly Singular Roots AU - Decker, D. W. AU - Kelley, C. T. T2 - SIAM Journal on Scientific and Statistical Computing AB - We consider Newton’s method for a class of nonlinear equations for which the derivative is nearly singular at the root. We show that there is a larger than expected domain of attraction for the Newton iterates but that convergence appears to be only linear in most of this domain. We give a modification of Newton’s method that improves this slow convergence. DA - 1985/10// PY - 1985/10// DO - 10.1137/0906064 VL - 6 IS - 4 SP - 951-966 J2 - SIAM J. Sci. and Stat. Comput. LA - en OP - SN - 0196-5204 2168-3417 UR - http://dx.doi.org/10.1137/0906064 DB - Crossref ER - TY - JOUR TI - Broyden’s Method for a Class of Problems Having Singular Jacobian at the Root AU - Decker, D. W. AU - Kelley, C. T. T2 - SIAM Journal on Numerical Analysis AB - For a class of nonlinear equations $F(x) = 0$, in $\mathbb{R}^n $, with the Jacobian $F'$ being singular at a root, $x^ * $, Broyden’s method is shown to yield a sequence that converges linearly to $x^ * $ if the initial guess is chosen in a special region. The asymptotic linear rate is ${{(\sqrt 5 - 1)} / 2}$. DA - 1985/6// PY - 1985/6// DO - 10.1137/0722034 VL - 22 IS - 3 SP - 566-574 J2 - SIAM J. Numer. Anal. LA - en OP - SN - 0036-1429 1095-7170 UR - http://dx.doi.org/10.1137/0722034 DB - Crossref ER - TY - RPRT TI - How to embed trees in hypercubes AU - Bhatt, S.N. AU - Ipsen, I.C.F. A3 - Department of Computer Science, Yale University DA - 1985/// PY - 1985/// M1 - 443 M3 - Research Report PB - Department of Computer Science, Yale University SN - 443 ER - TY - JOUR TI - Why does the -method work? AU - Kelley, C.T. AU - Mullikin, T.W. T2 - Transport Theory and Statistical Physics DA - 1985/// PY - 1985/// VL - 14 SP - 513–526 ER -