Constrained derivative-free optimization on thin domains
From MaRDI portal
Publication:2392122
DOI10.1007/s10898-012-9944-xzbMath1272.90091OpenAlexW2064215934MaRDI QIDQ2392122
F. N. C. Sobral, José Mario Martínez
Publication date: 1 August 2013
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-012-9944-x
Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56)
Related Items
Dynamic scaling in the mesh adaptive direct search algorithm for blackbox optimization, Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, Black-box optimization on hyper-rectangle using recursive modified pattern search and application to ROC-based classification problem, A merit function approach for evolution strategies, A derivative-free algorithm for non-linear optimization with linear equality constraints, Global convergence of a derivative-free inexact restoration filter algorithm for nonlinear programming, A derivative-free trust-region algorithm for composite nonsmooth optimization, Recursive modified pattern search on high-dimensional simplex: a blackbox optimization technique, Derivative-free optimization methods, Linear equalities in blackbox optimization
Uses Software
Cites Work
- Unnamed Item
- Analysis of direct searches for discontinuous functions
- Derivative-free methods for nonlinear programming with general lower-level constraints
- Nonlinear programming without a penalty function or a filter
- Local convergence of an inexact-restoration method and numerical experiments
- Globalization strategies for mesh adaptive direct search
- Test examples for nonlinear programming codes
- Recent progress in unconstrained nonlinear optimization without derivatives
- Global minimization using an augmented Lagrangian method with variable lower-level constraints
- Inexact-restoration algorithm for constrained optimization
- Algorithm 909
- On the Convergence of Pattern Search Algorithms
- A note on a method for generating points uniformly on n -dimensional spheres
- Dynamic Control of Infeasibility in Equality Constrained Optimization
- Using Sampling and Simplex Derivatives in Pattern Search Methods
- On Augmented Lagrangian Methods with General Lower-Level Constraints
- Nonlinearly Constrained Optimization Using Heuristic Penalty Methods and Asynchronous Parallel Generating Set Search
- Introduction to Derivative-Free Optimization
- A More Portable Fortran Random Number Generator
- Pattern Search Methods for Linearly Constrained Minimization
- Pattern Search Algorithms for Bound Constrained Minimization
- A Globally Convergent Augmented Lagrangian Pattern Search Algorithm for Optimization with General Constraints and Simple Bounds
- Benchmarking Derivative-Free Optimization Algorithms
- A Progressive Barrier for Derivative-Free Nonlinear Programming
- Stationarity Results for Generating Set Search for Linearly Constrained Optimization
- Mesh Adaptive Direct Search Algorithms for Constrained Optimization
- Constrained Nonlinear Optimization by Heuristic Programming
- A Simplex Method for Function Minimization
- A new algorithm for optimization
- Benchmarking optimization software with performance profiles.
- Inexact-restoration method with Lagrangian tangent decrease and new merit function for nonlinear programming.
