An interior point method for nonlinear constrained derivative-free optimization
From MaRDI portal
Cites work
- A derivative-free algorithm for inequality constrained nonlinear programming via smoothing of an _ penalty function
- A Derivative-Free Method for Structured Optimization Problems
- A Globally Convergent Augmented Lagrangian Pattern Search Algorithm for Optimization with General Constraints and Simple Bounds
- A penalty-interior-point algorithm for nonlinear constrained optimization
- A taxonomy of constraints in black-box simulation-based optimization
- Benchmarking Derivative-Free Optimization Algorithms
- Benchmarking optimization software with performance profiles.
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- Decomposition algorithm model for singly linearly-constrained problems subject to lower and Upper bounds
- Derivative-free and blackbox optimization
- Derivative-free optimization methods
- scientific article; zbMATH DE number 46305 (Why is no real title available?)
- scientific article; zbMATH DE number 2002582 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- Interior Methods for Nonlinear Optimization
- Introduction to Derivative-Free Optimization
- Mesh Adaptive Direct Search Algorithms for Constrained Optimization
- New global optimization methods for ship design problems
- Nonlinear programming
- On the Global Convergence of Derivative-Free Methods for Unconstrained Optimization
- Sequential penalty derivative-free methods for nonlinear constrained optimization
- The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
This page was built for publication: An interior point method for nonlinear constrained derivative-free optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6950990)
