Repository logo
 
Publication

A filter algorithm: comparison with NLP solvers

dc.contributor.authorSilva, Cândida
dc.contributor.authorMonteiro, M. Teresa T.
dc.date.accessioned2016-02-15T10:45:33Z
dc.date.available2016-02-15T10:45:33Z
dc.date.issued2008
dc.description.abstractThe purpose of this work is to present an algorithm to solve nonlinear constrained optimization problems, using the filter method with the inexact restoration (IR) approach. In the IR approach two independent phases are performed in each iteration—the feasibility and the optimality phases. The first one directs the iterative process into the feasible region, i.e. finds one point with less constraints violation. The optimality phase starts from this point and its goal is to optimize the objective function into the satisfied constraints space. To evaluate the solution approximations in each iteration a scheme based on the filter method is used in both phases of the algorithm. This method replaces the merit functions that are based on penalty schemes, avoiding the related difficulties such as the penalty parameter estimation and the non-differentiability of some of them. The filter method is implemented in the context of the line search globalization technique. A set of more than two hundred AMPL test problems is solved. The algorithm developed is compared with LOQO and NPSOL software packages.pt_PT
dc.description.sponsorshipThis work has been partially supported by project POCTI/MAT/45276/2002, Nonlinear semi-infinite programming solver.
dc.identifier.doi10.1080/00207160701203401pt_PT
dc.identifier.issn0020-7160
dc.identifier.issn1029-0265
dc.identifier.urihttp://hdl.handle.net/10400.22/7653
dc.language.isoengpt_PT
dc.publisherTaylor & Francispt_PT
dc.relationPOCTI/MAT/45276/2002
dc.relation.publisherversionhttp://www.tandfonline.com/doi/full/10.1080/00207160701203401
dc.subjectNonlinear programmingpt_PT
dc.subjectFilter methodpt_PT
dc.subjectInexact restorationpt_PT
dc.titleA filter algorithm: comparison with NLP solverspt_PT
dc.typejournal article
dspace.entity.typePublication
oaire.citation.endPage689pt_PT
oaire.citation.startPage667pt_PT
oaire.citation.titleInternational Journal of Computer Mathematicspt_PT
oaire.citation.volume85; 3-4pt_PT
person.familyNameSilva
person.givenNameCândida
person.identifier.ciencia-id9A15-C950-D653
person.identifier.orcid0000-0002-7342-1282
person.identifier.ridH-9382-2013
person.identifier.scopus-author-id11140480500
rcaap.rightsopenAccesspt_PT
rcaap.typearticlept_PT
relation.isAuthorOfPublication4e1c8389-7b33-480b-93c4-374f716b3b75
relation.isAuthorOfPublication.latestForDiscovery4e1c8389-7b33-480b-93c4-374f716b3b75

Files

Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
ART_CandidaSilva_2008_1.pdf
Size:
401.38 KB
Format:
Adobe Portable Document Format
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description: