The following pages link to Thomas F. Coleman (Q192567):
Displayed 50 items.
- Smoothing and parametric rules for stochastic mean-CVaR optimal execution strategy (Q285995) (← links)
- A direct active set algorithm for large sparse quadratic programs with simple bounds (Q583116) (← links)
- (Q751768) (redirect page) (← links)
- Data mapping of linear programming on fixed-size hypercubes (Q751769) (← links)
- Multiplicative iterative algorithms for convex programming (Q751770) (← links)
- Relaxed outer projections, weighted averages and convex feasibility (Q751771) (← links)
- Large sparse numerical optimization (Q792069) (← links)
- (Q951350) (redirect page) (← links)
- An object-oriented framework for valuing shout options on high-performance computer architectures (Q951351) (← links)
- Computation and analysis for a constrained entropy optimization problem in finance (Q952089) (← links)
- Unidimensional curve fitting search schemes revisited for multidimensional optimization algorithms (Q1064742) (← links)
- On error growth in the Bartels-Golub and Fletcher-Matthews algorithms for updating matrix factorizations (Q1096336) (← links)
- An algorithm for least squares projections onto the intersection of translated, convex cones (Q1105323) (← links)
- Local convergence of the multi-secant method for the parallel solution of systems of nonlinear equations (Q1106623) (← links)
- Data error analysis in unconstrained optimization problems with the CESTAC method (Q1118985) (← links)
- A variant of the CESTAC method and its application to constrained optimization (Q1118986) (← links)
- A class of linear complementarity problems solvable in polynomial time (Q1174838) (← links)
- Partitioned quasi-Newton methods for nonlinear equality constrained optimization (Q1184335) (← links)
- Solution of projection problems over polytopes (Q1185491) (← links)
- A globally and quadratically convergent affine scaling method for linear \(l_ 1\) problems (Q1199751) (← links)
- Modified proximal point algorithm for extended linear-quadratic programming (Q1203069) (← links)
- On partial updating in a potential reduction linear programming algorithm of Kojima, Mizuno, and Yoshise (Q1206441) (← links)
- A chordal preconditioner for large-scale optimization (Q1262220) (← links)
- (Q1312088) (redirect page) (← links)
- Isotropic effective energy simulated annealing searches for low energy molecular cluster states (Q1312089) (← links)
- A parallel build-up algorithm for global energy minimizations of molecular clusters using effective energy simulated annealing (Q1319004) (← links)
- On condition numbers and algorithms for determining a rigid body movement (Q1338519) (← links)
- Corrected sequential linear programming for sparse minimax optimization (Q1338528) (← links)
- On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds (Q1341568) (← links)
- Solving linear programming problems exactly (Q1354256) (← links)
- On the efficiency of a continuous version of the simulated annealing algorithm (Q1359728) (← links)
- On the convergence of multiplicative iterative algorithms with inexact line search (Q1375334) (← links)
- An extension of predictor-corrector algorithm to a class of convex separable program (Q1375337) (← links)
- A quasi-Newton quadratic penalty method for minimization equality constraints (Q1567477) (← links)
- An interior Newton method for quadratic programming (Q1586205) (← links)
- A trust region and affine scaling interior point method for nonconvex minimization with linear inequality constraints (Q1591353) (← links)
- Analysis of the SRISK measure and its application to the Canadian banking and insurance industries (Q1630433) (← links)
- Correction to: ``Analysis of the SRISK measure and its application to the Canadian banking and insurance industries'' (Q1630434) (← links)
- Moment matching machine learning methods for risk management of large variable annuity portfolios (Q1657175) (← links)
- Bounding the difference between RankRC and RankSVM and application to multi-level rare class kernel ranking (Q1741234) (← links)
- A continuation algorithm for a class of linear complementarity problems using an extrapolation technique (Q1801456) (← links)
- An efficient trust region method for unconstrained discrete-time optimal control problems (Q1804374) (← links)
- A parallel algorithm for constrained optimization problems (Q1903662) (← links)
- Parallel structural optimization applied to bone remodeling on distributed memory machines (Q1908534) (← links)
- Verification of constrained minima (Q1919423) (← links)
- Numerical solution of dynamic optimization problems using parametrization and \(\text{Op}^{\text{ti}}\text{A}\) software (Q1923346) (← links)
- Parallel continuation-based global optimization for molecular conformation and protein folding (Q1923787) (← links)
- An exterior Newton method for strictly convex quadratic programming (Q1967119) (← links)
- Efficient calculation of Jacobian and adjoint vector products in the wave propagational inverse problem using automatic differentiation (Q1971397) (← links)
- A simple algorithm for building the 3-D convex hull (Q2266570) (← links)