D-Index & Metrics Best Publications

D-Index & Metrics

Discipline name D-index D-index (Discipline H-index) only includes papers and citation values for an examined discipline in contrast to General H-index which accounts for publications across all disciplines. Citations Publications World Ranking National Ranking
Mathematics D-index 45 Citations 6,316 105 World Ranking 777 National Ranking 382
Engineering and Technology D-index 39 Citations 5,562 80 World Ranking 2654 National Ranking 1064

Research.com Recognitions

Awards & Achievements

1983 - SPIE Fellow

Overview

What is he best known for?

The fields of study he is best known for:

  • Statistics
  • Mathematical analysis
  • Mathematical optimization

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 most cited work include:

  • A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization (348 citations)
  • Weak sharp minima in mathematical programming (281 citations)
  • HIFOO - A MATLAB package for fixed-order controller design and H ∞ optimization (184 citations)

What are the main themes of his work throughout his whole career to date?

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

  • Kalman filter which is related to area like Outlier,
  • Smoothing which intersects with area such as Covariance. James V. Burke combines subjects such as Matrix and Abscissa with his study of Mathematical analysis. As a member of one scientific family, James V. Burke mostly works in the field of Subderivative, focusing on Convex analysis and, on occasion, Convex function.

He most often published in these fields:

  • Mathematical optimization (39.04%)
  • Applied mathematics (26.03%)
  • Algorithm (21.92%)

What were the highlights of his more recent work (between 2017-2021)?

  • Matrix (18.49%)
  • Algorithm (21.92%)
  • Applied mathematics (26.03%)

In recent papers he was focusing on the following fields of study:

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.

Between 2017 and 2021, his most popular works were:

  • Level-set methods for convex optimization (22 citations)
  • Gradient Sampling Methods for Nonsmooth Optimization (17 citations)
  • Foundations of Gauge and Perspective Duality (7 citations)

In his most recent research, the most cited papers focused on:

  • Statistics
  • Mathematical analysis
  • Mathematical optimization

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.

Best Publications

A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization

James V. Burke;Adrian S. Lewis;Michael L. Overton.
Siam Journal on Optimization (2005)

466 Citations

Weak sharp minima in mathematical programming

J. V. Burke;M. C. Ferris.
Siam Journal on Control and Optimization (1993)

372 Citations

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)

308 Citations

An exact penalization viewpoint of constrained optimization

James V. Burke.
Siam Journal on Control and Optimization (1991)

272 Citations

On the identification of active constraints

James V. Burke;Jorge J. Moré.
SIAM Journal on Numerical Analysis (1988)

248 Citations

Optical Wavefront Reconstruction: Theory and Numerical Methods

D. Russell Luke;James V. Burke;Richard G. Lyon.
Siam Review (2002)

196 Citations

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)

183 Citations

Stabilization via Nonsmooth, Nonconvex Optimization

J.V. Burke;D. Henrion;A.S. Lewis;M.L. Overton.
IEEE Transactions on Automatic Control (2006)

179 Citations

Calmness and exact penalization

J. V. Burke.
Siam Journal on Control and Optimization (1991)

172 Citations

The Global Linear Convergence of a Noninterior Path-Following Algorithm for Linear Complementarity Problems

James V. Burke;Song Xu.
Mathematics of Operations Research (1998)

171 Citations

Best Scientists Citing James V. Burke

Wim Michiels

Wim Michiels

University of Copenhagen

Publications: 48

Xiaoqi Yang

Xiaoqi Yang

Hong Kong Polytechnic University

Publications: 43

Adrian S. Lewis

Adrian S. Lewis

Cornell University

Publications: 43

Michael L. Overton

Michael L. Overton

New York University

Publications: 37

Gianluigi Pillonetto

Gianluigi Pillonetto

University of Padua

Publications: 35

Pierre Apkarian

Pierre Apkarian

Office National d'Études et de Recherches Aérospatiales

Publications: 32

Liqun Qi

Liqun Qi

Hong Kong Polytechnic University

Publications: 23

Alessandro Chiuso

Alessandro Chiuso

University of Padua

Publications: 22

Jen-Chih Yao

Jen-Chih Yao

National Sun Yat-sen University

Publications: 17

Lennart Ljung

Lennart Ljung

Linköping University

Publications: 17

Boris S. Mordukhovich

Boris S. Mordukhovich

Wayne State University

Publications: 16

Peter Benner

Peter Benner

Max Planck Institute for Dynamics of Complex Technical Systems

Publications: 15

Xiaojun Chen

Xiaojun Chen

Hong Kong Polytechnic University

Publications: 15

Vaithilingam Jeyakumar

Vaithilingam Jeyakumar

UNSW Sydney

Publications: 14

Christian Kanzow

Christian Kanzow

University of Würzburg

Publications: 14

Michael Patriksson

Michael Patriksson

Chalmers University of Technology

Publications: 14

Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking d-index is inferred from publications deemed to belong to the considered discipline.

If you think any of the details on this page are incorrect, let us know.

Contact us
Something went wrong. Please try again later.