Keywords
Affiliated Institutions
Related Publications
Interior-Point Polynomial Algorithms in Convex Programming
Written for specialists working in optimization, mathematical programming, or control theory. The general theory of path-following and potential reduction interior point polynom...
Determinant Maximization with Linear Matrix Inequality Constraints
The problem of maximizing the determinant of a matrix subject to linear matrix inequalities (LMIs) arises in many fields, including computational geometry, statistics, system id...
Theory and algorithms for linear optimization : an interior point approach
Partial table of contents: INTRODUCTION: THEORY AND COMPLEXITY. Duality Theory for Linear Optimization. A Polynomial Algorithm for the Skew-Symmetric Model. Solving the Canonica...
An affine scaling methodology for best basis selection
A methodology is developed to derive algorithms for optimal basis selection by minimizing diversity measures proposed by Wickerhauser (1994) and Donoho (1994). These measures in...
Numerical solution of the nonlinear Poisson–Boltzmann equation: Developing more robust and efficient methods
Abstract We present a robust and efficient numerical method for solution of the nonlinear Poisson‐Boltzmann equation arising in molecular biophysics. The equation is discretized...
Publication Info
- Year
- 1996
- Type
- article
- Volume
- 72
- Issue
- 1
- Pages
- 65-82
- Citations
- 24
- Access
- Closed
External Links
Social Impact
Social media, news, blog, policy document mentions
Citation Metrics
Cite This
Identifiers
- DOI
- 10.1007/bf02592332