An inexact restoration derivative-free filter method for nonlinear programming
From MaRDI portal
Publication:520323
DOI10.1007/s40314-015-0253-0zbMath1359.65092OpenAlexW1039515204WikidataQ113105481 ScholiaQ113105481MaRDI QIDQ520323
Nélida E. Echebest, R. P. Vignau, María Laura Schuverdt
Publication date: 3 April 2017
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://sedici.unlp.edu.ar/handle/10915/103327
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56)
Related Items
Inexact restoration for derivative-free expensive function minimization and applications ⋮ A progressive barrier derivative-free trust-region algorithm for constrained optimization ⋮ Inexact restoration for minimization with inexact evaluation both of the objective function and the constraints ⋮ Global convergence of a derivative-free inexact restoration filter algorithm for nonlinear programming ⋮ DEFT-FUNNEL: an open-source global optimization solver for constrained grey-box and black-box problems ⋮ Derivative-free optimization methods ⋮ The New Approach for Dynamic Optimization with Variability Constraints ⋮ Filter-based stochastic algorithm for global optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Derivative-free methods for nonlinear programming with general lower-level constraints
- Active-set strategy in Powell's method for optimization without derivatives
- Test examples for nonlinear programming codes
- Recent progress in unconstrained nonlinear optimization without derivatives
- A practical optimality condition without constraint qualifications for nonlinear programming
- Inexact-restoration algorithm for constrained optimization
- A derivative-free method for solving box-constrained underdetermined nonlinear systems of equations
- Inexact Restoration Method for Derivative-Free Optimization with Smooth Constraints
- An active-set trust-region method for derivative-free nonlinear bound-constrained optimization
- Using Sampling and Simplex Derivatives in Pattern Search Methods
- Introduction to Derivative-Free Optimization
- A derivative-free line search and global convergence of Broyden-like method for nonlinear equations
- Pattern Search Methods for Linearly Constrained Minimization
- A Globally Convergent Filter Method for Nonlinear Programming
- Pattern Search Algorithms for Bound Constrained Minimization
- A Nonmonotone Line Search Technique for Newton’s Method
- A Globally Convergent Augmented Lagrangian Pattern Search Algorithm for Optimization with General Constraints and Simple Bounds
- Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming
- Benchmarking Derivative-Free Optimization Algorithms
- Stationarity Results for Generating Set Search for Linearly Constrained Optimization
- Benchmarking optimization software with performance profiles.
- Nonlinear programming without a penalty function.
- Inexact-restoration method with Lagrangian tangent decrease and new merit function for nonlinear programming.
