What is he best known for?
The fields of study he is best known for:
- Algebra
- Mathematical optimization
- Mathematical analysis
Roger Fletcher mainly investigates Mathematical optimization, Nonlinear programming, Algorithm, Quadratic programming and Range.
His work in the fields of Minification overlaps with other areas such as Descent.
His Nonlinear programming research is multidisciplinary, incorporating perspectives in Optimization problem, Integer programming and Sequential quadratic programming.
His Algorithm research incorporates themes from Broyden–Fletcher–Goldfarb–Shanno algorithm and Metric.
His Quadratically constrained quadratic program study in the realm of Quadratic programming connects with subjects such as Random optimization and Derivative-free optimization.
His Range research is multidisciplinary, incorporating elements of Quadratic equation, Approximation algorithm, Norm, Filter and Function.
His most cited work include:
- Practical Methods of Optimization (7762 citations)
- A Rapidly Convergent Descent Method for Minimization (3787 citations)
- Function minimization by conjugate gradients (3476 citations)
What are the main themes of his work throughout his whole career to date?
His primary scientific interests are in Mathematical optimization, Nonlinear programming, Algorithm, Hessian matrix and Sequential quadratic programming.
His work carried out in the field of Mathematical optimization brings together such families of science as Range, Line search and Trust region.
His Nonlinear programming research focuses on subjects like Penalty method, which are linked to Function.
Roger Fletcher works mostly in the field of Algorithm, limiting it down to topics relating to Numerical analysis and, in certain cases, Quadratic equation and Gradient method.
Roger Fletcher has included themes like Local convergence and Filter in his Sequential quadratic programming study.
Particularly relevant to Quadratically constrained quadratic program is his body of work in Quadratic programming.
He most often published in these fields:
- Mathematical optimization (50.68%)
- Nonlinear programming (30.14%)
- Algorithm (23.29%)
What were the highlights of his more recent work (between 2011-2018)?
- Mathematical optimization (50.68%)
- Mathematical analysis (15.07%)
- Constrained optimization (5.48%)
In recent papers he was focusing on the following fields of study:
His primary areas of investigation include Mathematical optimization, Mathematical analysis, Constrained optimization, Nonlinear programming and Algorithm.
His Mathematical optimization research includes themes of Dimension, Numerical analysis and Hessian matrix.
His work in the fields of Mathematical analysis, such as Stationary point and Maxima and minima, overlaps with other areas such as Nonlinear conjugate gradient method and Stability.
The Constrained optimization study combines topics in areas such as Quadratic programming, Active set method and Algebra.
His Nonlinear programming research includes elements of Trust region, Linear-fractional programming, Integer programming and Artificial intelligence.
His Algorithm research incorporates themes from Lanczos resampling, Quadratic equation, Method of steepest descent and Minification.
Between 2011 and 2018, his most popular works were:
- A limited memory steepest descent method (53 citations)
- A nonmonotone filter method for nonlinear optimization (32 citations)
- Conjugate Direction Methods (13 citations)
In his most recent research, the most cited papers focused on:
- Algebra
- Mathematical optimization
- Mathematical analysis
Roger Fletcher mainly focuses on Mathematical optimization, Nonlinear programming, Algorithm, Feature and Compact convergence.
His study in the field of Minification also crosses realms of Constraint logic programming.
His study in Nonlinear programming is interdisciplinary in nature, drawing from both Linear-fractional programming, CUTEr, Trust region and Artificial intelligence.
The concepts of his Algorithm study are interwoven with issues in Dimension, Numerical analysis, Lanczos resampling and Method of steepest descent.
Roger Fletcher has included themes like Local convergence and Sequential quadratic programming in his Feature study.
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.
