J. Ben Rosen

From MaRDI portal
Revision as of 20:15, 12 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page J. Ben Rosen to J. Ben Rosen: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:946339

Available identifiers

zbMath Open rosen.j-benMaRDI QIDQ946339

List of research outcomes





PublicationDate of PublicationType
Multi-funnel optimization using Gaussian underestimation2008-09-23Paper
Approximating data in \({\mathbb R}^{n}\) by a quadratic underestimator with specified Hessian minimum and maximum eigenvalues2006-10-31Paper
Convex kernel underestimation of functions with multiple local minima2006-09-28Paper
Nonconvex piecewise-quadratic underestimation for global minimization2006-06-26Paper
Iterative convex quadratic approximation for global optimization in protein docking2006-05-02Paper
Fast data transmission and maximal dynamic flow.2006-01-17Paper
Global minimization via piecewise-linear underestimation2005-10-18Paper
Convex quadratic approximation2004-08-20Paper
Lower dimensional representation of text data based on centroids and least squares2003-12-04Paper
Exponential modeling with unknown model order using structured nonlinear total least norm2003-05-04Paper
https://portal.mardi4nfdi.de/entity/Q27658202002-10-23Paper
Solution of Nonlinear Programming Problems by Partitioning2002-10-22Paper
https://portal.mardi4nfdi.de/entity/Q45527162002-10-22Paper
https://portal.mardi4nfdi.de/entity/Q45399862002-07-16Paper
https://portal.mardi4nfdi.de/entity/Q45399982002-07-16Paper
Parsimonious least norm approximation2002-02-24Paper
Signal identification using a least \(L_1\) norm algorithm2001-06-12Paper
Accurate solution to overdetermined linear equations with errors using \(L_1\) norm minimization2001-02-18Paper
Low rank approximation of a Hankel matrix by structured total least norm2000-02-03Paper
https://portal.mardi4nfdi.de/entity/Q42498162000-01-09Paper
Structured Total Least Norm for Nonlinear Problems1999-05-18Paper
https://portal.mardi4nfdi.de/entity/Q43533681998-09-20Paper
https://portal.mardi4nfdi.de/entity/Q43710751998-01-28Paper
https://portal.mardi4nfdi.de/entity/Q43532061998-01-22Paper
https://portal.mardi4nfdi.de/entity/Q43708951998-01-07Paper
A polynomial time dual algorithm for the Euclidean multifacility location problem1997-02-23Paper
Total Least Norm Formulation and Solution for Structured Problems1996-03-27Paper
https://portal.mardi4nfdi.de/entity/Q48633611996-03-07Paper
https://portal.mardi4nfdi.de/entity/Q48413541995-11-23Paper
Large-Scale, Nonlinearly Constrained Optimization on a 1024-Processor<scp>n</scp>CUBE1995-02-28Paper
https://portal.mardi4nfdi.de/entity/Q43236171995-02-23Paper
https://portal.mardi4nfdi.de/entity/Q43236181995-02-23Paper
Computational comparison of two methods for constrained global optimization1995-02-09Paper
A quadratic assignment formulation of the molecular conformation problem1994-04-12Paper
On the Convergence of a Hyperboloid Approximation Procedure for the Perturbed Euclidean Multifacility Location Problem1994-03-13Paper
A globally convergent algorithm for the Euclidean multiplicity location problem1993-05-24Paper
Sufficient conditions for solving linearly constrained separable concave global minimization problems1993-05-04Paper
Anomalous Acceleration in Parallel Multiple-Cost-Row Linear Programming1993-01-17Paper
A parallel stochastic method for solving linearly constrained concave global minimization problems1993-01-16Paper
Computational Comparison of Two Algorithms for the Euclidean Single Facility Location Problem1993-01-13Paper
https://portal.mardi4nfdi.de/entity/Q40101821992-09-27Paper
Parallel Solution of Large-Scale, Block-Diagonal Concave Maximization Problems1992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q39982941992-09-17Paper
Algorithms for the quickest path problem and the enumeration of quickest paths1992-06-28Paper
On a new algorithm for stable assignment*1992-06-28Paper
On the Convergence of Miehle's Algorithm for the Euclidean Multifacility Location Problem1992-06-28Paper
Parallel solution of large-scale, block-angular linear programs1990-01-01Paper
A parallel algorithm for partially separable non-convex global minimization: Linear constraints1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34913181990-01-01Paper
Erratum to ``Bounds for the solution of linear complementarity problems1988-01-01Paper
A parallel algorithm for constrained concave quadratic global minimization1988-01-01Paper
Global Optimization Approach to the Linear Complementarity Problem1988-01-01Paper
Reduction of nonlinear integer separable programming problems1988-01-01Paper
Bounds for the solution set of linear complementarity problems1987-01-01Paper
Penalty formulation for zero-one nonlinear programming1987-01-01Paper
Global minimization of indefinite quadratic problems1987-01-01Paper
Constrained global optimization: algorithms and applications1987-01-01Paper
An Algorithm for Global Minimization of Linearly Constrained Concave Quadratic Functions1987-01-01Paper
Construction of large-scale global minimum concave quadratic test problems1986-01-01Paper
Global minimization of large-scale constrained concave quadratic problems by separable programming1986-01-01Paper
Methods for Global Concave Minimization: A Bibliographic Survey1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36901131985-01-01Paper
Performance of approximate algorithms for global minimization1984-01-01Paper
Global Minimization of a Linearly Constrained Concave Function by Partition of Feasible Domain1983-01-01Paper
Penalty for zero–one integer equivalent problem1982-01-01Paper
Global minimum test problem construction1982-01-01Paper
A collocation method for parabolic quasilinear problems on general domains1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39084101978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40485041974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56845101972-01-01Paper
Minimum error bounds for multidimensional spline approximation1971-01-01Paper
Approximate Solution and Error Bounds for Quasi-Linear Elliptic Boundary Value Problems1970-01-01Paper
An interactive display for approximation by linear programming1970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56572871968-01-01Paper
Chebyshev solution of large linear systems1967-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55745231967-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56041841967-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56171991967-01-01Paper
Iterative Solution of Nonlinear Optimal Control Problems1966-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56743761966-01-01Paper
Existence and Uniqueness of Equilibrium Points for Concave N-Person Games1965-01-01Paper
Primal partition programming for block diagonal matrices1964-01-01Paper
Inequalities for Stochastic Nonlinear Programming Problems1964-01-01Paper
Minimum and Basic Solutions to Singular Linear Systems1964-01-01Paper
https://portal.mardi4nfdi.de/entity/Q53422921963-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56381331963-01-01Paper
Stability and bounds for nonlinear systems of difference and differential equations1961-01-01Paper
The Gradient Projection Method for Nonlinear Programming. Part II. Nonlinear Constraints1961-01-01Paper
The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints1960-01-01Paper

Research outcomes over time

This page was built for person: J. Ben Rosen