Nonlinearly Constrained Optimization Using Heuristic Penalty Methods and Asynchronous Parallel Generating Set Search
From MaRDI portal
Recommendations
- Asynchronous Parallel Generating Set Search for Linearly Constrained Optimization
- Revisiting Asynchronous Parallel Pattern Search for Nonlinear Optimization
- Global optimization with non-convex constraints. Sequential and parallel algorithms
- Asynchronous parallel pattern search for nonlinear optimization
- A parallel, asynchronous method for derivative-free nonlinear programs
- Publication:4489976
- A multipurpose parallel genetic hybrid algorithm for nonlinear nonconvex programming problems
- A penalty-interior-point algorithm for nonlinear constrained optimization
- A new heuristic approach for non-convex optimization problems
- scientific article; zbMATH DE number 3945269
Cited in
(12)- Robust Designs for Circle Coverings of a Square
- A derivative-free exact penalty algorithm: basic ideas, convergence theory and computational studies
- A taxonomy of constraints in black-box simulation-based optimization
- Kaplan's penalty operator in approximation of a diffusion-absorption problem with a one-sided constraint
- Asynchronous Parallel Generating Set Search for Linearly Constrained Optimization
- A novel hybrid PSO-based metaheuristic for costly portfolio selection problems
- A feasible method for constrained derivative-free optimization
- A quantitative metric for robustness of nonlinear algebraic equation solvers
- Black-Box Optimization: Methods and Applications
- On a smoothed penalty-based algorithm for global optimization
- A unified approach for smoothing approximations to the exact _1-penalty for inequality-constrained optimization
- Constrained derivative-free optimization on thin domains
This page was built for publication: Nonlinearly Constrained Optimization Using Heuristic Penalty Methods and Asynchronous Parallel Generating Set Search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3565158)
