Derivative-free optimization and filter methods to solve nonlinear constrained problems

DOI10.1080/00207160902775090zbMath1177.65085WikidataQ59120588 ScholiaQ59120588MaRDI QIDQ3643170

Aldina Correia, João L. H. Matias, Pedro Mestre, Carlos Serôdio

Publication date: 10 November 2009

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10400.22/1848

zbMATH Keywords

direct search methods; numerical examples; penalty functions; filter methods; nonlinear constrained optimization; simplex methods

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C30: Nonlinear programming

Related Items

Derivative-free nonlinear optimization filter simplex

Cites Work

• A bundle-filter method for nonsmooth convex constrained optimization
• Automatic decrease of the penalty parameter in exact penalty function methods
• Direct search methods: Then and now
• A globally convergent primal-dual interior-point filter method for nonlinear programming
• Steering exact penalty methods for nonlinear programming
• `` Direct Search Solution of Numerical and Statistical Problems
• CUTE
• A Pattern Search Filter Method for Nonlinear Programming without Derivatives
• A Multidimensional Filter Algorithm for Nonlinear Equations and Nonlinear Least-Squares
• On the Global Convergence of a Filter--SQP Algorithm
• Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming
• Benchmarking Java against C and Fortran for scientific applications
• A Sufficient Condition for Exact Penalty in Constrained Optimization
• An efficient method for finding the minimum of a function of several variables without calculating derivatives
• A Filter-Trust-Region Method for Unconstrained Optimization
• Interior Methods for Mathematical Programs with Complementarity Constraints
• Nonlinear programming without a penalty function.