Derivative-free algorithm for nonlinear optimization problems with partial-bounded constraints
From MaRDI portal
Publication:2994066
Recommendations
- A penalty derivative-free algorithm for nonlinear constrained optimization
- A derivative-free algorithm for bound constrained optimization
- Sequential penalty derivative-free methods for nonlinear constrained optimization
- A decomposition algorithm for unconstrained optimization problems with partial derivative information
- A derivative-free algorithm for constrained global optimization based on exact penalty functions
Cited in
(11)- Derivative-Free Feasible Backtracking Search Methods for Nonlinear Multiobjective Optimization with Simple Boundary Constraint
- A decomposition algorithm for unconstrained optimization problems with partial derivative information
- Derivative-free methods for mixed-integer constrained optimization problems
- Random derivative-free algorithm for solving unconstrained or bound constrained continuously differentiable non-linear problems
- A Linesearch-Based Derivative-Free Approach for Nonsmooth Constrained Optimization
- Derivative-free optimization and filter methods to solve nonlinear constrained problems
- A derivative-free algorithm for bound constrained optimization
- A Derivative-Free Algorithm for Linearly Constrained Finite Minimax Problems
- A penalty derivative-free algorithm for nonlinear constrained optimization
- Recent progress in unconstrained nonlinear optimization without derivatives
- A derivative-based algorithm for a particular class of mixed variable optimization problems
This page was built for publication: Derivative-free algorithm for nonlinear optimization problems with partial-bounded constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2994066)