Borwein J.M.

J.M. Borwein

Information about the author J.M. Borwein will soon be added to the site.
Found 8 papers in total
Maximum entropy reconstruction using derivative information, 1. Fisher information and convex duality
Maximum entropy reconstruction using derivative information, 1. Fisher information and convex duality
1996
Maximum entropy spectral density estimation is a technique for reconstructing an...
A convex dual approach to the computation of nuclear magnetic resonance complex spectra
A convex dual approach to the computation of nuclear magnetic resonance complex spectra
2000
The particular entropy method proposed by Hoch et al . for the computation of NMR...
Strong conical hull intersection property, bounded linear regularity, Jameson's property (G), and error bounds in convex optimization
Strong conical hull intersection property, bounded linear regularity, Jameson's property (G), and error bounds in convex optimization
1999
The strong conical hull intersection property and bounded linear regularity are...
A nonconvex separation property in Banach spaces
A nonconvex separation property in Banach spaces
1998
We establish, in infinite dimensional Banach space, a nonconvex separation property...
Partially finite convex programming, Part I: Quasi relative interiors and duality theory
Partially finite convex programming, Part I: Quasi relative interiors and duality theory
1992
The authors study convex programs that involve the minimization of a convex function...
Partially finite convex programming, Part II: Explicit lattice models
Partially finite convex programming, Part II: Explicit lattice models
1992
In Part I of this work the authors derived a duality theorem for partially finite...
Super efficiency in convex vector optimization
Super efficiency in convex vector optimization
1991
The authors establish a Lagrange Multiplier Theorem for super efficient in convex...
The linear order complementarity problem
The linear order complementarity problem
1989
The classical complementarity problem in Euclidean space can be viewed alternatively...
Papers per page: