Edite M. G. P. Fernandes
YOU?
Author Swipe
View article: Interfaces da experiência docente no atendimento da classe hospitalar
Interfaces da experiência docente no atendimento da classe hospitalar Open
Trata-se de uma entrevista com professora permanente do Programa de Pós-Graduação em Educação, Cultura e Comunicação em Periferias Urbanas (FEBF/Uerj), Ediclea Mascarenhas Fernandes.
View article: Sequential adding clustering algorithm
Sequential adding clustering algorithm Open
The sequential adding clustering algorithm herein presented adds cluster centers, assigns points to clusters, merges and removes clusters (deleting their centers) iteratively in order to find the optimal cluster partition. Additionally, th…
View article: Solving nonlinear equations by a tabu search strategy
Solving nonlinear equations by a tabu search strategy Open
Solving systems of nonlinear equations is a problem of particular importance since they emerge through the mathematical modeling of real problems that arise naturally in many branches of engineering and in the physical sciences. The proble…
View article: A Two-Phase Heuristic Coupled DIRECT Method for Bound Constrained Global Optimization
A Two-Phase Heuristic Coupled DIRECT Method for Bound Constrained Global Optimization Open
View article: Penalty-Based Heuristic DIRECT Method for Constrained Global Optimization
Penalty-Based Heuristic DIRECT Method for Constrained Global Optimization Open
View article: Objective and Violation Upper Bounds on a DIRECT-Filter Method for Global Optimization
Objective and Violation Upper Bounds on a DIRECT-Filter Method for Global Optimization Open
View article: A Population-Based Stochastic Coordinate Descent Method
A Population-Based Stochastic Coordinate Descent Method Open
View article: A stochastic coordinate descent for bound constrained global optimization
A stochastic coordinate descent for bound constrained global optimization Open
This paper presents a stochastic coordinate descent algorithm for solving bound constrained global optimization problems. The algorithm borrows ideas from some stochastic optimization methods available for the minimization of expected and …
View article: Exploring a multi-objective approach for optimal control problems via a direct multiple shooting method
Exploring a multi-objective approach for optimal control problems via a direct multiple shooting method Open
This paper explores the use of a multi-objective approach through the implementation of a numerical direct multiple shooting (MS) method to solve optimal control problems (OCP). When a direct MS method is used to solve the OCP, a set of ‘c…
View article: A multiple shooting descent-based filter method for optimal control
A multiple shooting descent-based filter method for optimal control Open
A direct multiple shooting (MS) method is implemented to solve optimal control problems (OCP) in the Mayer form. The use of an MS method gives rise to the so-called ‘continuity conditions’ that must be satisfied together with general algeb…
View article: Preface to the Special Issue “GOW’16”
Preface to the Special Issue “GOW’16” Open
View article: Finding Multiple Roots of Systems of Nonlinear Equations by a Hybrid Harmony Search-Based Multistart Method
Finding Multiple Roots of Systems of Nonlinear Equations by a Hybrid Harmony Search-Based Multistart Method Open
A multistart (MS) clustering technique to compute multiple roots of a system of nonlinear equations through the global optimization of an appropriate merit function is presented. The search procedure that is invoked to converge to a root, …
View article: On Metaheuristics for Solving the Parameter Estimation Problem in Dynamic Systems: A Comparative Study
On Metaheuristics for Solving the Parameter Estimation Problem in Dynamic Systems: A Comparative Study Open
This paper presents an experimental study that aims to compare the practical performance of well-known metaheuristics for solving the parameter estimation problem in a dynamic systems context. The metaheuristics produce good quality approx…
View article: Filter-based DIRECT method for constrained global optimization
Filter-based DIRECT method for constrained global optimization Open
This paper presents a DIRECT-type method that uses a filter methodology to assure convergence to a feasible and optimal solution of nonsmooth and nonconvex constrained global optimization problems. The filter methodology aims to give prior…
View article: Theoretical and Practical Convergence of a Self-Adaptive Penalty Algorithm for Constrained Global Optimization
Theoretical and Practical Convergence of a Self-Adaptive Penalty Algorithm for Constrained Global Optimization Open
This paper proposes a self-adaptive penalty function and presents a penalty-based algorithm for solving nonsmooth and nonconvex constrained optimization problems. We prove that the general constrained optimization problem is equivalent to …
View article: On a multiobjective optimal control of a tumor growth model with immune response and drug therapies
On a multiobjective optimal control of a tumor growth model with immune response and drug therapies Open
In this paper, we consider a tumor growth mathematical model that includes an immune system and drug therapies. Immuno‐ and chemodrug administration as well as periodic administration of radiation are integrated in the model. We have set a…
View article: A shifted hyperbolic augmented Lagrangian-based artificial fish two-swarm algorithm with guaranteed convergence for constrained global optimization
A shifted hyperbolic augmented Lagrangian-based artificial fish two-swarm algorithm with guaranteed convergence for constrained global optimization Open
This article presents a shifted hyperbolic penalty function and proposes an augmented Lagrangian-based
\nalgorithm for non-convex constrained global optimization problems. Convergence to an ε-global minimizer
\nis proved. At each iteration…
View article: Firefly penalty-based algorithm for bound constrained mixed-integer nonlinear programming
Firefly penalty-based algorithm for bound constrained mixed-integer nonlinear programming Open
In this article, we aim to extend the firefly algorithm (FA) to solve bound constrained mixed-integer nonlinear programming (MINLP) problems. An exact penalty continuous formulation of the MINLP problem is used.
\nThe continuous penalty pr…
View article: Comparing immune-tumor growth models with drug therapy using optimal control
Comparing immune-tumor growth models with drug therapy using optimal control Open
In this paper we compare the dynamics of three tumor growth models that include an immune system and a drug administration therapy using optimal control. The objective is to minimize a combined function of the total of tumor cells over tim…
View article: Interrupted searches in the BBMCSFilter context for MINLP problems
Interrupted searches in the BBMCSFilter context for MINLP problems Open
The BBMCSFilter method was developed to solve mixed integer nonlinear programming problems. This kind of problems have integer and continuous variables and they appear very frequently in process engineering problems. The objective of this …
View article: Direct Sequential Based Firefly Algorithm for the $$\alpha $$ -Pinene Isomerization Problem
Direct Sequential Based Firefly Algorithm for the $$\alpha $$ -Pinene Isomerization Problem Open
View article: Comparison of penalty functions on a penalty approach to mixed-integer optimization
Comparison of penalty functions on a penalty approach to mixed-integer optimization Open
In this paper, we present a comparative study involving several penalty functions that can be used in a penalty approach for globally solving bound mixed-integer nonlinear programming (bMIMLP) problems. The penalty approach relies on a con…
View article: Improving Efficiency of a Multistart with Interrupted Hooke-and-Jeeves Filter Search for Solving MINLP Problems
Improving Efficiency of a Multistart with Interrupted Hooke-and-Jeeves Filter Search for Solving MINLP Problems Open
View article: Solving MINLP problems by a penalty framework
Solving MINLP problems by a penalty framework Open
A penalty framework for globally solving mixed-integer nonlinear programming problems is presented. Both integrality constraints and nonlinear constraints are handled separately by hyperbolic tangent penalty functions. The preliminary nume…
View article: Testing Nelder-Mead Based Repulsion Algorithms for Multiple Roots of Nonlinear Systems via a Two-Level Factorial Design of Experiments
Testing Nelder-Mead Based Repulsion Algorithms for Multiple Roots of Nonlinear Systems via a Two-Level Factorial Design of Experiments Open
This paper addresses the challenging task of computing multiple roots of a system of nonlinear equations. A repulsion algorithm that invokes the Nelder-Mead (N-M) local search method and uses a penalty-type merit function based on the erro…
View article: Solving Large 0–1 Multidimensional Knapsack Problems by a New Simplified Binary Artificial Fish Swarm Algorithm
Solving Large 0–1 Multidimensional Knapsack Problems by a New Simplified Binary Artificial Fish Swarm Algorithm Open
The artificial fish swarm algorithm has recently been emerged in continuous global
\noptimization. It uses points of a population in space to identify the position of fish in the school. Many real-world optimization problems are described …