Non-monotone derivative-free algorithm for solving optimization models with linear constraints: extensions for solving nonlinearly constrained models via exact penalty methods
DOI10.1007/S11750-020-00549-YzbMATH Open1467.90088OpenAlexW3008119361MaRDI QIDQ828735FDOQ828735
Authors: Ubaldo M. García-Palomares 
Publication date: 5 May 2021
Published in: Top (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11750-020-00549-y
Recommendations
- A penalty derivative-free algorithm for nonlinear constrained optimization
- A derivative-free method for linearly constrained nonsmooth optimization
- A Derivative-Free Algorithm for Linearly Constrained Finite Minimax Problems
- Sequential penalty derivative-free methods for nonlinear constrained optimization
- A Linesearch-Based Derivative-Free Approach for Nonsmooth Constrained Optimization
exact penalty functions0-order stationaritylinear and nonlinear constraintsnon monotone direct search method
Computational methods for problems pertaining to operations research and mathematical programming (90-08) Derivative-free methods and methods using generalized derivatives (90C56)
Cites Work
- MinFinder: locating all the local minima of a function
- A Linesearch-Based Derivative-Free Approach for Nonsmooth Constrained Optimization
- Mixed-integer nonlinear optimization
- Stochastic global optimization: Problem classes and solution techniques
- Algorithm 909: NOMAD: nonlinear optimization with the MADS algorithm
- On the Convergence of the Multidirectional Search Algorithm
- Introduction to Derivative-Free Optimization
- Title not available (Why is that?)
- An approach to constrained global optimization based on exact penalty functions
- Pattern Search Methods for Linearly Constrained Minimization
- A combined global \& local search (CGLS) approach to global optimization
- On sequential and parallel non-monotone derivative-free algorithms for box constrained optimization
- Analysis of Generalized Pattern Searches
- On the Global Convergence of Derivative-Free Methods for Unconstrained Optimization
- Frame based methods for unconstrained optimization
- New Sequential and Parallel Derivative-Free Algorithms for Unconstrained Minimization
- Experimental testing of advanced scatter search designs for global optimization of multimodal functions
- Parallel deterministic and stochastic global minimization of functions with very many minima
- Pattern search in the presence of degenerate linear constraints
- On the absence of duality gap for Lagrange-type functions
- On the exactness of a class of nondifferentiable penalty functions
- Unified approach for solving box-constrained models with continuous or discrete variables by non monotone direct search methods
- Linear equalities in blackbox optimization
- On the Convergence of Asynchronous Parallel Pattern Search
Cited In (4)
- Strategies for solving index one DAE with non-negative constraints: Application to liquid-liquid extraction
- Unified approach for solving box-constrained models with continuous or discrete variables by non monotone direct search methods
- Convergence of derivative-free nonmonotone direct search methods for unconstrained and box-constrained mixed-integer optimization
- A penalty derivative-free algorithm for nonlinear constrained optimization
Uses Software
This page was built for publication: Non-monotone derivative-free algorithm for solving optimization models with linear constraints: extensions for solving nonlinearly constrained models via exact penalty methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q828735)
