1983 - SPIE Fellow
James V. Burke mainly investigates Mathematical optimization, Mathematical analysis, Numerical analysis, Rate of convergence and Linear complementarity problem. His Mathematical optimization research incorporates themes from Nonlinear programming and Convex optimization. His Mathematical analysis research incorporates elements of Quadratic equation and Spectral abscissa.
The study incorporates disciplines such as Geometrical optics, Least squares and Regular polygon in addition to Numerical analysis. His Rate of convergence research is multidisciplinary, incorporating elements of Smoothing and Interior point method. His Sequential quadratic programming research focuses on Second-order cone programming and how it connects with Algorithm and Quadratic programming.
His main research concerns Mathematical optimization, Applied mathematics, Algorithm, Mathematical analysis and Subderivative. His Mathematical optimization research incorporates themes from Estimator, Nonlinear programming and Convex optimization. His research in Applied mathematics focuses on subjects like Spline, which are connected to BIBO stability.
His study on Algorithm also encompasses disciplines like
The scientist’s investigation covers issues in Matrix, Algorithm, Applied mathematics, Regular polygon and Mathematical optimization. His Matrix study combines topics in areas such as Function and Mathematical analysis. His Algorithm research integrates issues from Smoothing and Covariance.
His study in Smoothing is interdisciplinary in nature, drawing from both Kalman filter, Rate of convergence, Interior point method and Convex optimization. His Applied mathematics research is multidisciplinary, incorporating perspectives in Piecewise linear function, Quadratic equation, Karush–Kuhn–Tucker conditions, Local convergence and Newton's method. As part of his studies on Mathematical optimization, James V. Burke often connects relevant subjects like Nonlinear programming.
James V. Burke mainly focuses on Optimization problem, Convex optimization, Mathematical optimization, Regular polygon and Backtracking line search. His biological study spans a wide range of topics, including Kalman filter, Covariance, Theoretical physics and Interior point method. His research integrates issues of Sampling methodology and Extension in his study of Mathematical optimization.
His studies in Regular polygon integrate themes in fields like Path, Class, Stochastic optimization, Focus and Numerical analysis. As part of the same scientific family, James V. Burke usually focuses on Backtracking line search, concentrating on Directional derivative and intersecting with Algorithm. His work in Algorithm addresses issues such as Smoothing, which are connected to fields such as Applied mathematics and Subderivative.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
James V. Burke;Adrian S. Lewis;Michael L. Overton.
Siam Journal on Optimization (2005)
Weak sharp minima in mathematical programming
J. V. Burke;M. C. Ferris.
Siam Journal on Control and Optimization (1993)
HIFOO - A MATLAB package for fixed-order controller design and H ∞ optimization
J.V. Burke;D. Henrion;A.S. Lewis;M.L. Overton.
IFAC Proceedings Volumes (2006)
An exact penalization viewpoint of constrained optimization
James V. Burke.
Siam Journal on Control and Optimization (1991)
On the identification of active constraints
James V. Burke;Jorge J. Moré.
SIAM Journal on Numerical Analysis (1988)
Optical Wavefront Reconstruction: Theory and Numerical Methods
D. Russell Luke;James V. Burke;Richard G. Lyon.
Siam Review (2002)
On the Lidskii--Vishik--Lyusternik Perturbation Theory for Eigenvalues of Matrices with Arbitrary Jordan Structure
Julio Moro;James V. Burke;Michael L. Overton.
SIAM Journal on Matrix Analysis and Applications (1997)
Stabilization via Nonsmooth, Nonconvex Optimization
J.V. Burke;D. Henrion;A.S. Lewis;M.L. Overton.
IEEE Transactions on Automatic Control (2006)
Calmness and exact penalization
J. V. Burke.
Siam Journal on Control and Optimization (1991)
The Global Linear Convergence of a Noninterior Path-Following Algorithm for Linear Complementarity Problems
James V. Burke;Song Xu.
Mathematics of Operations Research (1998)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
University of Padua
Courant Institute of Mathematical Sciences
Cornell University
University of Padua
University of Wisconsin–Madison
Linköping University
University of Washington
University of Newcastle Australia
Argonne National Laboratory
Georgia Institute of Technology
McGill University
Université de Sherbrooke
The University of Texas at Austin
Eindhoven University of Technology
Claude Bernard University Lyon 1
Utrecht University
Queen Mary University of London
University of Tokyo
Plymouth University
US Forest Service
University of Bari Aldo Moro
University of California, San Diego
Hannover Medical School
Southwest Research Institute
California Institute of Technology
University of Hawaii at Manoa