Fernandes Edite M.G.P.

Edite M.G.P. Fernandes

Information about the author Edite M.G.P. Fernandes will soon be added to the site.
Found 8 papers in total
Application of the volume algorithm to the approximate and exact solving of the asymmetric traveling salesman problem
Application of the volume algorithm to the approximate and exact solving of the asymmetric traveling salesman problem
2005
In this paper we present computational results with the volume algorithm, a variant of...
Robot trajectory planning with semi-infinite programming
Robot trajectory planning with semi-infinite programming
2004
In this paper we describe how robot trajectory planning can be formulated as a...
Performance of the truncated Newton method in unconstrained nonlinear optimization
Performance of the truncated Newton method in unconstrained nonlinear optimization
2004
Newton's method for unconstrained nonlinear optimization can be a demanding iterative...
A sequential quadratic programming with a dual parametrization approach to nonlinear semi-infinite programming
A sequential quadratic programming with a dual parametrization approach to nonlinear semi-infinite programming
2003
In the sequel of the work reported in Liu et al ., in which a method based on a dual...
Optimal signal sets via semi-infinite programming
Optimal signal sets via semi-infinite programming
2002
The optimal signal set problem has been formulated as a nonlinear programming problem...
Discretization methods for semi-infinite programming
Discretization methods for semi-infinite programming
2001
Discretization methods represent an important class of methods to solve semi-infinite...
Nonlinear least squares methods and convergence
Nonlinear least squares methods and convergence
2000
The nonlinear least squares problem is of practical importance specially in curve...
The efficiency of optimization methods based on line searches
The efficiency of optimization methods based on line searches
1998
In nonlinear multidimensional optimization line search techniques aim to compute an...
Papers per page: