Frank E. Curtis
Frank E. Curtis publishes mostly in Numerical Analysis, Artificial Intelligence and Computational Mechanics, on topics such as Advanced Optimization Algorithms Research, Sparse and Compressive Sensing Techniques and Stochastic Gradient Optimization Techniques.
- World rank
- #392,610 of 7,710,434 ranked researchers
- Rank in United States
- #139,494 of 1,627,098
- Works
- 130
- Citations
- 2.2k
- Citations per work
- 16.9
What does Frank E. Curtis research?
Frank E. Curtis's work is mostly in Computer Science (34%), Engineering (28%), Mathematics (24%).
Their six largest subfields, inside their fields and domains; the grey slice is everything else they publish. The interactive view splits every one of their works down to single topics.
The fields and subfields, with their numbers
- Physical Sciences11285.8%
- Computer Science4433.8%
- Engineering3627.5%
- Mathematics3224.5%
- Everything else1814.2%
- 1Numerical Analysis24% of their works
- 2Artificial Intelligence19% of their works
- 3Computational Mechanics18% of their works
- 4Computational Theory and Mathematics14% of their works
- 5Electrical and Electronic Engineering5% of their works
- 6Control and Systems Engineering4% of their works
Research topics
- Advanced Optimization Algorithms Research
- Sparse and Compressive Sensing Techniques
- Stochastic Gradient Optimization Techniques
- Matrix Theory and Algorithms
- Optimization and Variational Analysis
- Advanced Control Systems Optimization
- Advanced Multi-Objective Optimization Algorithms
- Risk and Portfolio Optimization
Which keywords describe Frank E. Curtis's research?
The keywords of their largest research topics: Convex Optimization, Optimization Software, Semidefinite Programming, Compressed Sensing, Sparse Representation, Random Projections, Stochastic Gradient Descent and Optimization.
- Robust Optimization
- Multiobjective Optimization
- Nonlinear Systems
- Nonlinear Operators
- Numerical Linear Algebra
- Optimization
- Random Projections
- Compressed Sensing
- Optimization Software
- Convex Optimization
- Semidefinite Programming
- Sparse Representation
- Stochastic Gradient Descent
- Matrix Computations
- Iterative Algorithms
- Model Predictive Control
- Evolutionary Algorithms
- Risk Management
Size is their works in the topics tagged with each word, from their 8 largest topics. Each links to the topic it comes from most. The words come from the keyword list OpenAlex gives each topic, not from the text of the papers, so a word can appear that none of the papers uses.
All 18 words, with their numbers
- Convex Optimization2134 topics
- Optimization Software861 topic
- Semidefinite Programming861 topic
- Compressed Sensing681 topic
- Sparse Representation681 topic
- Random Projections511 topic
- Stochastic Gradient Descent511 topic
- Optimization282 topics
- Matrix Computations231 topic
- Numerical Linear Algebra231 topic
- Iterative Algorithms181 topic
- Nonlinear Operators181 topic
- Model Predictive Control101 topic
- Nonlinear Systems101 topic
- Evolutionary Algorithms91 topic
- Multiobjective Optimization91 topic
- Risk Management81 topic
- Robust Optimization81 topic
Where does Frank E. Curtis work?
Frank E. Curtis's main affiliation in the publication record is Lehigh University, United States.
How many publications and citations does Frank E. Curtis have?
OpenAlex counts 130 works and 2,202 citations for Frank E. Curtis, an h-index of 26, ranking #392,610 of 7,710,434 researchers worldwide on the quality score.
Ranked on field-normalised citation excellence (50%), output (30%) and citations (20%). Counts come from OpenAlex author records, which occasionally merge different people who share a name or split one person into several.
Papers, co-authors, who cited this work and researchers on the nearest topics have tabs of their own, above. Is this your page? Claim it with your ORCID iD, or request a correction or removal.
Discussion
Ask a question or share a note about Frank E. Curtis. Keep it to the research: no personal attacks, advertising or links. Any reader can report a post, which collapses it for everyone until it is opened.