The following pages link to J. Ben Rosen (Q946339):
Displaying 43 items.
- (Q751500) (redirect page) (← links)
- Parallel solution of large-scale, block-angular linear programs (Q751502) (← links)
- A collocation method for parabolic quasilinear problems on general domains (Q755286) (← links)
- Stability and bounds for nonlinear systems of difference and differential equations (Q774977) (← links)
- Erratum to ``Bounds for the solution of linear complementarity problems'' (Q922317) (← links)
- Multi-funnel optimization using Gaussian underestimation (Q946340) (← links)
- Bounds for the solution set of linear complementarity problems (Q1087474) (← links)
- Penalty formulation for zero-one nonlinear programming (Q1091262) (← links)
- Global minimization of indefinite quadratic problems (Q1092620) (← links)
- Constrained global optimization: algorithms and applications (Q1099780) (← links)
- A parallel algorithm for constrained concave quadratic global minimization (Q1116888) (← links)
- Algorithms for the quickest path problem and the enumeration of quickest paths (Q1184451) (← links)
- A parallel stochastic method for solving linearly constrained concave global minimization problems (Q1200631) (← links)
- Sufficient conditions for solving linearly constrained separable concave global minimization problems (Q1207045) (← links)
- A globally convergent algorithm for the Euclidean multiplicity location problem (Q1210269) (← links)
- Parsimonious least norm approximation (Q1273417) (← links)
- A quadratic assignment formulation of the molecular conformation problem (Q1319011) (← links)
- Computational comparison of two methods for constrained global optimization (Q1342896) (← links)
- Lower dimensional representation of text data based on centroids and least squares (Q1415409) (← links)
- Signal identification using a least \(L_1\) norm algorithm (Q1586417) (← links)
- Accurate solution to overdetermined linear equations with errors using \(L_1\) norm minimization (Q1841564) (← links)
- Exponential modeling with unknown model order using structured nonlinear total least norm (Q1872007) (← links)
- Convex quadratic approximation (Q1876590) (← links)
- A polynomial time dual algorithm for the Euclidean multifacility location problem (Q1919190) (← links)
- Low rank approximation of a Hankel matrix by structured total least norm (Q1963917) (← links)
- Construction of large-scale global minimum concave quadratic test problems (Q2265952) (← links)
- A parallel algorithm for partially separable non-convex global minimization: Linear constraints (Q2276880) (← links)
- Primal partition programming for block diagonal matrices (Q2394962) (← links)
- Approximating data in \({\mathbb R}^{n}\) by a quadratic underestimator with specified Hessian minimum and maximum eigenvalues (Q2433931) (← links)
- Iterative convex quadratic approximation for global optimization in protein docking (Q2490366) (← links)
- Nonconvex piecewise-quadratic underestimation for global minimization (Q2494310) (← links)
- Convex kernel underestimation of functions with multiple local minima (Q2506188) (← links)
- Chebyshev solution of large linear systems (Q2524946) (← links)
- Minimum error bounds for multidimensional spline approximation (Q2550603) (← links)
- Global minimization via piecewise-linear underestimation (Q2569149) (← links)
- Fast data transmission and maximal dynamic flow. (Q2583548) (← links)
- (Q2765820) (← links)
- Solution of Nonlinear Programming Problems by Partitioning (Q2779004) (← links)
- Global Minimization of a Linearly Constrained Concave Function by Partition of Feasible Domain (Q3040932) (← links)
- Performance of approximate algorithms for global minimization (Q3217953) (← links)
- The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints (Q3280554) (← links)
- Penalty for zero–one integer equivalent problem (Q3328282) (← links)
- Inequalities for Stochastic Nonlinear Programming Problems (Q5341346) (← links)
