Edite M. G. P. Fernandes

Orcid: 0000-0003-0722-9361

According to our database1, Edite M. G. P. Fernandes authored at least 53 papers between 2003 and 2022.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
A Kernel Clustering Algorithm Based on Diameters.
Proceedings of the Optimization, Learning Algorithms and Applications, 2022

2021
A Simple Clustering Algorithm Based on Weighted Expected Distances.
Proceedings of the Optimization, Learning Algorithms and Applications, 2021

Optimal Control by Multiple Shooting and Weighted Tchebycheff Penalty-Based Scalarization.
Proceedings of the Computational Science and Its Applications - ICCSA 2021, 2021

A Clustering Algorithm Based on Fitness Probability Scores for Cluster Centers Optimization.
Proceedings of the Computational Science and Its Applications - ICCSA 2021, 2021

2020
Single Screw Extrusion Optimization Using the Tchebycheff Scalarization Method.
Proceedings of the Computational Science and Its Applications - ICCSA 2020, 2020

Simplified Tabu Search with Random-Based Searches for Bound Constrained Global Optimization.
Proceedings of the Computational Science and Its Applications - ICCSA 2020, 2020

Penalty-Based Heuristic DIRECT Method for Constrained Global Optimization.
Proceedings of the Computational Science and Its Applications - ICCSA 2020, 2020

2019
A Population-Based Stochastic Coordinate Descent Method.
Proceedings of the Optimization of Complex Systems: Theory, 2019

Objective and Violation Upper Bounds on a DIRECT-Filter Method for Global Optimization.
Proceedings of the Numerical Computations: Theory and Algorithms, 2019

2018
Preface to the Special Issue "GOW'16".
J. Glob. Optim., 2018

Filter-based DIRECT method for constrained global optimization.
J. Glob. Optim., 2018

On a multiobjective optimal control of a tumor growth model with immune response and drug therapies.
Int. Trans. Oper. Res., 2018

2017
Theoretical and Practical Convergence of a Self-Adaptive Penalty Algorithm for Constrained Global Optimization.
J. Optim. Theory Appl., 2017

On a smoothed penalty-based algorithm for global optimization.
J. Glob. Optim., 2017

Continuous Relaxation of MINLP Problems by Penalty Functions: A Practical Comparison.
Proceedings of the Computational Science and Its Applications - ICCSA 2017, 2017

2016
Direct Sequential Based Firefly Algorithm for the \alpha -Pinene Isomerization Problem.
Proceedings of the Computational Science and Its Applications - ICCSA 2016, 2016

Improving Efficiency of a Multistart with Interrupted Hooke-and-Jeeves Filter Search for Solving MINLP Problems.
Proceedings of the Computational Science and Its Applications - ICCSA 2016, 2016

2015
Derivative-Free Augmented Lagrangian for Global Optimization: Cost Minimization in a Simplified Activated Sludge System Model.
J. Math. Model. Algorithms Oper. Res., 2015

Solving Large 0-1 Multidimensional Knapsack Problems by a New Simplified Binary Artificial Fish Swarm Algorithm.
J. Math. Model. Algorithms Oper. Res., 2015

Combining Non-dominance, Objective-order and Spread Metric to Extend Firefly Algorithm to Multi-objective Optimization.
Proceedings of the Evolutionary Multi-Criterion Optimization, 2015

2014
Improved binary artificial fish swarm algorithm for the 0-1 multidimensional knapsack problems.
Swarm Evol. Comput., 2014

A filter-based artificial fish swarm algorithm for constrained global optimization: theoretical and practical issues.
J. Glob. Optim., 2014

An artificial fish swarm algorithm based hyperbolic augmented Lagrangian method.
J. Comput. Appl. Math., 2014

A simplified binary artificial fish swarm algorithm for 0-1 quadratic knapsack problems.
J. Comput. Appl. Math., 2014

Heuristic-Based Firefly Algorithm for Bound Constrained Nonlinear Binary Optimization.
Adv. Oper. Res., 2014

Multiple Roots of Systems of Equations by Repulsion Merit Functions.
Proceedings of the Computational Science and Its Applications - ICCSA 2014 - 14th International Conference, Guimarães, Portugal, June 30, 2014

Branch and Bound Based Coordinate Search Filter Algorithm for Nonsmooth Nonconvex Mixed-Integer Nonlinear Programming Problems.
Proceedings of the Computational Science and Its Applications - ICCSA 2014 - 14th International Conference, Guimarães, Portugal, June 30, 2014

2013
Multilocal Programming and Applications.
Proceedings of the Handbook of Optimization - From Classical to Modern Approach, 2013

On Challenging Techniques for Constrained Global Optimization.
Proceedings of the Handbook of Optimization - From Classical to Modern Approach, 2013

Multilocal Programming: A Derivative-Free Filter Multistart Algorithm.
Proceedings of the Computational Science and Its Applications - ICCSA 2013, 2013

2012
Self-adaptive combination of global tabu search and local search for nonlinear equations.
Int. J. Comput. Math., 2012

A hybrid genetic pattern search augmented Lagrangian method for constrained global optimization.
Appl. Math. Comput., 2012

An Artificial Fish Swarm Filter-Based Method for Constrained Global Optimization.
Proceedings of the Computational Science and Its Applications - ICCSA 2012, 2012

A Derivative-Free Filter Driven Multistart Technique for Global Optimization.
Proceedings of the Computational Science and Its Applications - ICCSA 2012, 2012

Solving Multidimensional 0-1 Knapsack Problem with an Artificial Fish Swarm Algorithm.
Proceedings of the Computational Science and Its Applications - ICCSA 2012, 2012

2011
An augmented Lagrangian fish swarm based method for global optimization.
J. Comput. Appl. Math., 2011

Global Competitive Ranking for Constraints Handling with Modified Differential Evolution.
Proceedings of the ECTA and FCTA 2011, 2011

Heuristic Pattern Search for Bound Constrained Minimax Problems.
Proceedings of the Computational Science and Its Applications - ICCSA 2011, 2011

Novel Fish Swarm Heuristics for Bound Constrained Global Optimization Problems.
Proceedings of the Computational Science and Its Applications - ICCSA 2011, 2011

Branch-and-Bound Reduction Type Method for Semi-Infinite Programming.
Proceedings of the Computational Science and Its Applications - ICCSA 2011, 2011

On Minimizing Objective and KKT Error in a Filter Line Search Strategy for an Interior Point Method.
Proceedings of the Computational Science and Its Applications - ICCSA 2011, 2011

Modified Differential Evolution Based on Global Competitive Ranking for Engineering Design Optimization Problems.
Proceedings of the Computational Science and Its Applications - ICCSA 2011, 2011

2010
Using a Genetic Algorithm to Solve a Bi-Objective WWTP Process Optimization.
Proceedings of the Operations Research Proceedings 2010, 2010

2009
Modified movement force vector in an electromagnetism-like mechanism for global optimization.
Optim. Methods Softw., 2009

Hybridizing the electromagnetism-like algorithm with descent search for solving engineering design problems.
Int. J. Comput. Math., 2009

2008
Practical implementation of an interior point nonmonotone line search filter method.
Int. J. Comput. Math., 2008

Feasibility and Dominance Rules in the Electromagnetism-Like Algorithm for Constrained Global Optimization.
Proceedings of the Computational Science and Its Applications - ICCSA 2008, International Conference, Perugia, Italy, June 30, 2008

Implementation of the Electromagnetism-Like Algorithm with a Constraint-Handling Technique for Engineering Optimization Problems.
Proceedings of the 8th International Conference on Hybrid Intelligent Systems (HIS 2008), 2008

2005
A First-Order epsilon-Approximation Algorithm for Linear Programs and a Second-Order Implementation.
Proceedings of the Computational Science and Its Applications, 2005

NEOS Server Usage in Wastewater Treatment Cost Minimization.
Proceedings of the Computational Science and Its Applications, 2005

2004
SIPAMPL: Semi-infinite programming with AMPL.
ACM Trans. Math. Softw., 2004

Robot trajectory planning with semi-infinite programming.
Eur. J. Oper. Res., 2004

2003
A quasi-Newton interior point method for semi-infinite programming.
Optim. Methods Softw., 2003


  Loading...