JavaScript is disabled for your browser. Some features of this site may not work without it.
Browsing by Author "Coleman, Thomas F."
Now showing items 3958 of 64

A Parallel Buildup Algorithm for Global Energy Minimizations of Molecular Clusters Using Effective Energy Simulated Annealing
Coleman, Thomas F.; Shalloway, David; Wu, Zhijun (Cornell University, 199305)This work studies the buildup method for the global minimizationproblem for molecular conformation, especially protein folding. The problem is hard to solve for large molecules using general minimization approaches because ... 
Parallel ContinuationBased Global Optimization for Molecular Conformation and Protein Folding
Coleman, Thomas F.; Wu, Zhijun (Cornell University, 199403)This paper presents our recent work on developing parallel algorithms and software for solving the global minimization problem for molecular conformation, especially protein folding. Global minimization problems are difficult ... 
Parallel Finite Element Analysis of Biomechanical Structures on the Ncube 6400
Chinchalkar, Shirish; Coleman, Thomas F. (Cornell University, 199108)This paper presents parallel 3D finite element analysis for distributed memory multiprocessors. Traditionally, finite element analysis has been performed on sequential computers. Current research in high ... 
Parallel Structural Optimization Applied to Bone Remodeling on Distributed Memory Machines
Chinchalkar, Shirish; Coleman, Thomas F. (Cornell University, 199307)This paper demonstrates parallel structural optimization methods on distributed memory MIMD machines. We have restricted ourselves to the simpler case of minimizing a multivariate nonlinear function subject to bounds on ... 
A Parallel Triangular Solver for a Hypercube Multiprocessor
Li, Guangye; Coleman, Thomas F. (Cornell University, 198610)We consider solving triangular systems of linear equations on a hypercube multiprocessor. Specifically, we propose a fast parallel algorithm, applicable when the triangular matrix is distributed around the cube by column ... 
Partitioned QuasiNewton Methods for Nonlinear Equality Constrained Optimization
Coleman, Thomas F.; Fenyes, Peter (Cornell University, 198808)We derive new quasiNewton updates for the (nonlinear) equality constrained minimization problem. The new updates satisfy a quasiNewton equation, maintain positive definiteness on the null space of the active constraint ... 
A Preconditioned Conjugate Gradient Approach to Linear Equality
Coleman, Thomas F.; Verma, Arun (Cornell University, 20030128)We propose a new framework for the application of preconditioned conjugate gradients in the solution of largescale linear equality constrained minimization problems. This framework allows for the exploitation of ... 
A Preconditioned Conjugate Gradient Approach to Linear Equality Constrained Minimization
Coleman, Thomas F.; Verma, Arun (Cornell University, 20030123)We propose a new framework for the application of preconditioned conjugate gradients in the solution of largescale linear equality constrained minimization problems. This framework allows for the exploitation of structure ... 
Predicting Fill for Sparse Orthogonal Factorization
Coleman, Thomas F.; Edenbrandt, Anders; Gilbert, John R. (Cornell University, 198310)In solving large sparse linear least squares problems $Ax \cong b$, several different numeric methods involve computing the same upper triangular factor $R$ of $A$. It is of interest to be able to compute the nonzero ... 
A QuadraticallyConvergent Algorithm for the Linear Programming Problem with Lower and Upper Bounds
Coleman, Thomas F.; Li, Yuying (Cornell University, 199004)We present a new algorithm to solve linear programming problems with finite lower and upper bounds. This algorithm generates an infinite sequence of points guaranteed to converge to the solution; the ultimate convergence ... 
A QuasiNewton $L_{2}$Penalty Method for Minimization Subject toNonlinear Equality Constraints
Coleman, Thomas F.; Yuan, Wei (Cornell University, 199503)We present a modified $L_{2}$ penalty function method for equality constrained optimization problems. The pivotal feature of our algorithm is that at every iterate we invoke a special change of variables to improve the ... 
A QuasiNewton L2Penalty Method for Minimization Subject to Nonlinear Constraints
Coleman, Thomas F.; Yuan, Wei (Cornell University, 199502)We present a modified L2 penalty function method for equality constrained optimization problems. The pivotal feature of our algorithm is that at every iterate we invoke a special change of variables to improve the ability ... 
Reconstructing the Unknown Local Volatility Function
Coleman, Thomas F.; Li, Yuying; Verma, Arun (Cornell University, 20030123)Using market European option prices, a method for computing a smooth local volatility function in a 1factor continuous diffusion model is proposed. Smoothness is introduced to facilitate accurate approximation of the ... 
A Reflective Newton Method for Minimizing a Quadratic Function Subject to Bounds on Some of the Variables
Coleman, Thomas F.; Li, Yuying (Cornell University, 199211)We propose a new algorithm, a reflective Newton method, for the minimization of a quadratic function of many variables subject to upper and lower bounds on some of the variables. This method applies to a general ... 
A Reflective Newton Method for Minimizing a Quadratic FunctionSubject to Bounds on Some of The Variables.
Coleman, Thomas F.; Li, Yuying (Cornell University, 199211)We propose a new algorithm, a reflective Newton method, for the minimization of a quadratic function of many variables subject to upper and lower bounds on some of the variables. The method applies to a general (indefinite) ... 
Segmentation of Pulmonary Nodule Images Using Total Variation Minimization
Coleman, Thomas F.; Li, Yuying; Mariano, Adriano (Cornell University, 20030122)Total variation minimization has edge preserving and enhancing properties which make it suitable for image segmentation. We present Image Simplification, a new formulation and algorithm for image segmentation. We illustrate ... 
Segmentation of Pulmonary Nodule Images Using Total VariationMinimization
Coleman, Thomas F.; Li, Yuying; Mariano, Adrian (Cornell University, 199809)Total variation minimization has edge preserving and enhancing properties which make it suitable for image segmentation. We present Image Simplification, a new formulation and algo rithm for image segmentation. We ... 
Software For Estimating Sparse Hessian Matrices
Coleman, Thomas F.; Garbow, Burton S.; More, Jorge J. (Cornell University, 198501)The solution of a nonlinear optimization problem often requires an estimate of the Hessian matrix for a function $f$. In large scale problems the Hessian matrix is usually sparse, and then estimation by differences of ... 
Software for Estimating Sparse Jacobian Matrices
Coleman, Thomas F.; More, Jorge J. (Cornell University, 198206)In many nonlinear problems it is necessary to estimate the Jacobian matrix of a nonlinear mapping $F$. In large scale problems the Jacobian of $F$ is usually sparse, and then estimation by differences is attractive because ... 
Solution of Nonlinear LeastSquare Problems on a Multiprocessor
Coleman, Thomas F.; Plassmann, Paul (Cornell University, 198806)In this paper we describe algorithms for solving nonlinear leastsquares problems on a messagepassing multiprocessor. We demonstrate new parallel algorithms, including an efficient parallel algorithm for determining the ...