Penalty-free method for nonsmooth constrained optimization via radial basis functions

DOI10.3906/mat-1512-61zbMath1424.65087OpenAlexW2742442184MaRDI QIDQ4633326

Fardin Rahmanpour, Mohammad-Mehdi Hosseini, Farid Mohammad Maalek Ghaini

Publication date: 2 May 2019

Published in: TURKISH JOURNAL OF MATHEMATICS (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3906/mat-1512-61

zbMATH Keywords

nonsmooth optimizationconstrained optimizationradial basis functionsnonlinear programmingtrust-region methodexact penalty functionderivative-free method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56)

Uses Software

• Matlab
• HOPSPACK
• DFO
• TRICE
• MLMSRBF
• UOBYQA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Interpolation of scattered data: distance matrices and conditionally positive definite functions
• Nonlinear programming without a penalty function or a filter
• Test examples for nonlinear programming codes
• Efficient global optimization of expensive black-box functions
• Recent progress in unconstrained nonlinear optimization without derivatives
• On the global convergence of an SLP-filter algorithm that takes EQP steps
• UOBYQA: unconstrained optimization by quadratic approximation
• Global optimization of costly nonconvex functions using radial basis functions
• On the superlinear local convergence of a filter-SQP method
• Geometry of interpolation sets in derivative free optimization
• A penalty-free-type nonmonotone trust-region method for nonlinear constrained optimization
• A Stochastic Radial Basis Function Method for the Global Optimization of Expensive Functions
• A Sequential Quadratic Programming Method Without A Penalty Function or a Filter for Nonlinear Equality Constrained Optimization
• A Global Convergence Theory for General Trust-Region-Based Algorithms for Equality Constrained Optimization
• Numerical solution of saddle point problems
• Introduction to Derivative-Free Optimization
• Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
• Trust-Region Interior-Point SQP Algorithms for a Class of Nonlinear Programming Problems
• A Trust Region Method for Nonlinear Programming Based on Primal Interior-Point Techniques
• On the Convergence Theory of Trust-Region-Based Algorithms for Equality-Constrained Optimization
• Radial Basis Functions
• Trust Region Methods
• An Interior Trust Region Approach for Nonlinear Minimization Subject to Bounds
• Function Minimization by Interpolation in a Data Table
• A Simplex Method for Function Minimization
• Scattered Data Approximation
• A trust region method based on interior point techniques for nonlinear programming.
• A nonmonotone trust region method for nonlinear programming with simple bound constraints

This page was built for publication: Penalty-free method for nonsmooth constrained optimization via radial basis functions