Solving constrained global optimization problems without penalty parameters
From MaRDI portal
Recommendations
- A derivative-free algorithm for constrained global optimization based on exact penalty functions
- Constrained global optimization using a new exact penalty function
- An approach to constrained global optimization based on exact penalty functions
- Univariate global optimization with multiextremal non-differentiable constraints without penalty functions
- scientific article; zbMATH DE number 4114401
- A method without a penalty function or a filter for nonlinear constrained optimization
- An algorithm for solving global optimization problems with nonlinear constraints
- A penalty derivative-free algorithm for nonlinear constrained optimization
- Globally convergent algorithms for solving unconstrained optimization problems
- A penalty-free method for equality constrained optimization
Cites work
- A global optimization method for a large number of variables (variant of Alienor method)
- A hybrid global optimization method: The multi-dimensional case
- A hybrid global optimization method: The one-dimensional case
- Global optimization: the Alienor mixed method with Piyavskii‐Shubert technique
- Global optimization‐preserving operators
- Trust Region Methods
Cited in
(5)- Theoretical and practical convergence of a self-adaptive penalty algorithm for constrained global optimization
- Alienor method to solve multi-objective linear programming (MOLP)
- Alienor method applied to operational research
- A filter-genetic algorithm for constrained optimization problems
- A trajectory-based method for constrained nonlinear optimization problems
This page was built for publication: Solving constrained global optimization problems without penalty parameters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5695215)
