Convergence of derivative-free nonmonotone direct search methods for unconstrained and box-constrained mixed-integer optimization

DOI10.1007/s10589-023-00469-0OpenAlexW4366982240MaRDI QIDQ6175470

Ubaldo M. García-Palomares

Publication date: 24 July 2023

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-023-00469-0

zbMATH Keywords

direct search methodsbox constraintsderivative freenon monotonemixed-integer variablesquasi descent direction

Mathematics Subject Classification ID

Mixed integer programming (90C11) Derivative-free methods and methods using generalized derivatives (90C56)

Cites Work

• Unnamed Item
• A derivative-free algorithm for linearly constrained optimization problems
• A critical review of discrete filled function methods in solving nonlinear discrete optimization problems
• Non-monotone derivative-free algorithm for solving optimization models with linear constraints: extensions for solving nonlinearly constrained models via exact penalty methods
• Discrete global descent method for discrete global optimization and nonlinear integer programming
• Outdoor WLAN planning via non-monotone derivative-free optimization: Algorithm adaptation and case study
• Mesh adaptive direct search algorithms for mixed variable optimization
• Nonmonotone line search for minimax problems
• Robust optimization of noisy blackbox problems using the mesh adaptive direct search algorithm
• Unified approach for solving box-constrained models with continuous or discrete variables by non monotone direct search methods
• Positive bases with maximal cosine measure
• Derivative-free methods for mixed-integer constrained optimization problems
• Direct search based on probabilistic feasible descent for bound and linearly constrained problems
• Incorporating nonmonotone strategies into the trust region method for unconstrained optimization
• Discrete filled function method for discrete global optimization
• A combined global \& local search (CGLS) approach to global optimization
• A trust-region-based derivative free algorithm for mixed integer programming
• Experimental testing of advanced scatter search designs for global optimization of multimodal functions
• On sequential and parallel non-monotone derivative-free algorithms for box constrained optimization
• A Linesearch-Based Derivative-Free Approach for Nonsmooth Constrained Optimization
• Non Monotone Algorithms for Unconstrained Minimization: Upper Bounds on Function Values
• On the Convergence of Pattern Search Algorithms
• Reducing the Number of Function Evaluations in Mesh Adaptive Direct Search Algorithms
• Parallel Space Decomposition of the Mesh Adaptive Direct Search Algorithm
• OrthoMADS: A Deterministic MADS Instance with Orthogonal Directions
• The Mesh Adaptive Direct Search Algorithm for Granular and Discrete Variables
• A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
• A Nonmonotone Line Search Technique for Newton’s Method
• A Globally Convergent Augmented Lagrangian Pattern Search Algorithm for Optimization with General Constraints and Simple Bounds
• New Sequential and Parallel Derivative-Free Algorithms for Unconstrained Minimization
• A derivative-free algorithm for non-linear optimization with linear equality constraints
• Mixed-integer nonlinear optimization
• GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization
• Mesh Adaptive Direct Search Algorithms for Constrained Optimization
• Integrating SQP and branch-and-bound for mixed integer nonlinear programming
• On the nonmonotone line search

This page was built for publication: Convergence of derivative-free nonmonotone direct search methods for unconstrained and box-constrained mixed-integer optimization