NFDNA - um algoritmo para otimização não convexa e não diferenciável

Loading...
Thumbnail Image

Journal Title

Journal ISSN

Volume Title

Publisher

Universidade Federal de Juiz de Fora

DOI

Abstract

In this work we study an algorithm for solving unsconstrained, not necessarily convex or differentiable optimization problems called Nonsmooth Feasible Direction Nonconvex Algorithm - NFDNA. We also employ this algorithm as a subroutine of the Interior Epigraph Directions (IED) method. The IED method, devised for solving constrained, nonconvex and nonsmooth optimization problems uses Lagrangean Duality which requires the minimization of the Lagrangean function. The effectiveness of the IED depends strongly on the Lagrangean function minimization. As an application, we replace the Matlab routine fminsearch, originally used by IED, with NFDNA. We show through the solution of test problems that the IED performance is more efficient by employing NFDNA.

Description

Citation

Endorsement

Review

Supplemented By

Referenced By

Rights and licensing

Acesso Aberto