Luís Nunes Vicente mainly focuses on Mathematical optimization, Derivative-free optimization, Nonlinear programming, Algorithm and Trust region. Luís Nunes Vicente has included themes like Iterated function and Theory of computation in his Mathematical optimization study. His Derivative-free optimization research focuses on Stationary point and how it connects with Convergence tests, Modes of convergence, Compact convergence and Particle swarm optimization.
The Nonlinear programming study combines topics in areas such as Numerical analysis, Interior point method, Optimal control and Sequential quadratic programming. His work on Predictor–corrector method and Computational mathematics as part of general Algorithm study is frequently connected to Linear complementarity problem, therefore bridging the gap between diverse disciplines of science and establishing a new relationship between them. His work carried out in the field of Optimization problem brings together such families of science as Underdetermined system, Theoretical computer science, Field, Linear model and Nelder–Mead method.
Mathematical optimization, Derivative-free optimization, Algorithm, Nonlinear programming and Trust region are his primary areas of study. His Mathematical optimization research incorporates themes from Iterated function and Worst-case complexity. His study with Derivative-free optimization involves better knowledge in Optimization problem.
His study looks at the relationship between Algorithm and fields such as Quadratic equation, as well as how they intersect with chemical problems. Luís Nunes Vicente has researched Nonlinear programming in several fields, including Optimal control, Modes of convergence, Sequential quadratic programming, Local convergence and Interior point method. His Trust region research includes themes of Probabilistic logic, Symbolic convergence theory, Applied mathematics and Stationary point.
Luís Nunes Vicente mainly investigates Mathematical optimization, Worst-case complexity, Derivative-free optimization, Trust region and Convex function. In the subject of general Mathematical optimization, his work in Feasible region is often linked to Order, thereby combining diverse domains of study. His Worst-case complexity research is multidisciplinary, incorporating perspectives in Iterated function and Regular polygon.
His Derivative-free optimization study deals with Direct search intersecting with Random optimization and Random search. His studies in Trust region integrate themes in fields like Function, Symbolic convergence theory, Heuristics and Surrogate model. As part of the same scientific family, he usually focuses on Convex function, concentrating on Multi-objective optimization and intersecting with Estimator.
Luís Nunes Vicente mostly deals with Mathematical optimization, Worst-case complexity, Trust region, Probabilistic logic and Iterated function. As part of his studies on Mathematical optimization, Luís Nunes Vicente often connects relevant areas like Quadratic equation. His research integrates issues of Convex function and Regular polygon in his study of Worst-case complexity.
His studies deal with areas such as Stochastic programming, Probabilistic-based design optimization and Descent as well as Trust region. His Probabilistic logic research is multidisciplinary, relying on both Type, Matching, Algorithm, Polling and Bounded function. His work deals with themes such as Discrete mathematics and Sequence, which intersect with Iterated function.
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.
Introduction to derivative-free optimization
Andrew R. Conn;Katya Scheinberg;Luis N. Vicente.
(2009)
Bilevel and multilevel programming: A bibliography review
Luís Nunes Vicente;Paul H. Calamai.
Journal of Global Optimization (1994)
A particle swarm pattern search method for bound constrained global optimization
A. Ismael Vaz;Luís N. Vicente.
Journal of Global Optimization (2007)
Descent approaches for quadratic bilevel programming
L. Vicente;G. Savard;J. Júdice.
Journal of Optimization Theory and Applications (1994)
Direct multisearch for multiobjective optimization
A. L. Custodio;José Firmino Aguilar Madeira;A. I. F. Vaz;L. N. Vicente.
Siam Journal on Optimization (2011)
A globally convergent primal-dual interior-point filter method for nonlinear programming
Michael Ulbrich;Stefan Ulbrich;Luís N. Vicente.
Mathematical Programming (2004)
Global Convergence of General Derivative-Free Trust-Region Algorithms to First- and Second-Order Critical Points
Andrew R. Conn;Katya Scheinberg;Luís N. Vicente.
Siam Journal on Optimization (2009)
Using Sampling and Simplex Derivatives in Pattern Search Methods
A. L. Custódio;L. N. Vicente.
Siam Journal on Optimization (2007)
Discrete linear bilevel programming problem
L. Vicente;G. Savard;J. Júdice.
Journal of Optimization Theory and Applications (1996)
Trust-Region Interior-Point SQP Algorithms for a Class of Nonlinear Programming Problems
J. E. Dennis;Matthias Heinkenschloss;Luís N. Vicente.
Siam Journal on Control and Optimization (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:
Cornell University
Rice University
ETH Zurich
University of Wisconsin–Madison
Polytechnique Montréal
Rice University
University of Florida
Chinese Academy of Sciences
University of Perugia
University of Namur
University of Salerno
Royal Institute of Technology
University of Oklahoma
National Institute of Advanced Industrial Science and Technology
University of Cambridge
National Institutes of Health
University of Tübingen
University of California, Los Angeles
Kent State University
Yale University
University of Manchester
Federal University of Toulouse Midi-Pyrénées
Goethe University Frankfurt
National Institutes of Health
Harvard University
New Mexico State University