On sequential and parallel non-monotone derivative-free algorithms for box constrained optimization

DOI10.1080/10556788.2012.693926zbMATH Open1278.65088OpenAlexW2064056506MaRDI QIDQ2867433FDOQ2867433

Authors: Ubaldo M. García-Palomares, Ildemaro J. García-Urrea, P. S. Rodríguez-Hernández 

Publication date: 19 December 2013

Published in: Optimization Methods \& Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556788.2012.693926

Recommendations

• New Sequential and Parallel Derivative-Free Algorithms for Unconstrained Minimization
• Direct Search Methods on Parallel Machines
• A General-Purpose Parallel Algorithm for Unconstrained Optimization
• scientific article; zbMATH DE number 2232726
• Sequential and parallel algorithms for global minimizing functions with Lipschitzian derivatives

zbMATH Keywords

box constraintsparallelderivative freenon-monotonespace decompositiondiscrete quasi-minimal points

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Derivative-free methods and methods using generalized derivatives (90C56)

Cites Work

• Algorithm 856
• A derivative-free algorithm for bound constrained optimization
• A Nonmonotone Line Search Technique for Newton’s Method
• Integrating SQP and branch-and-bound for mixed integer nonlinear programming
• Algorithm 909
• A progressive barrier for derivative-free nonlinear programming
• Mesh Adaptive Direct Search Algorithms for Constrained Optimization
• Nonmonotonic trust region algorithm
• Introduction to Derivative-Free Optimization
• Theory of Positive Linear Dependence
• Positive bases in numerical optimization
• Benchmarking Derivative-Free Optimization Algorithms
• Title not available (Why is that?)
• Pattern Search Methods for Linearly Constrained Minimization
• Mesh adaptive direct search algorithms for mixed variable optimization
• A combined global \& local search (CGLS) approach to global optimization
• Parallel Space Decomposition of the Mesh Adaptive Direct Search Algorithm
• Analysis of Generalized Pattern Searches
• Stationarity Results for Generating Set Search for Linearly Constrained Optimization
• Nonmonotone globalization techniques for the Barzilai-Borwein gradient method
• Revisiting Asynchronous Parallel Pattern Search for Nonlinear Optimization
• Parallel variable distribution for constrained optimization
• On the Global Convergence of Derivative-Free Methods for Unconstrained Optimization
• Frame based methods for unconstrained optimization
• Outdoor WLAN planning via non-monotone derivative-free optimization: Algorithm adaptation and case study
• Developments of NEWUOA for minimization without derivatives
• New Sequential and Parallel Derivative-Free Algorithms for Unconstrained Minimization
• A derivative-free nonmonotone line-search technique for unconstrained optimization
• Heuristic pattern search and its hybridization with simulated annealing for nonlinear global optimization
• Asynchronous parallel pattern search for nonlinear optimization
• On the Convergence of Asynchronous Parallel Pattern Search
• Asynchronous Parallel Generating Set Search for Linearly Constrained Optimization

Cited In (11)

• Parallelized hybrid optimization methods for nonsmooth problems using NOMAD and linesearch
• Title not available (Why is that?)
• Unified approach for solving box-constrained models with continuous or discrete variables by non monotone direct search methods
• Non-monotone derivative-free algorithm for solving optimization models with linear constraints: extensions for solving nonlinearly constrained models via exact penalty methods
• Decomposition in derivative-free optimization
• Projected adaptive cubic regularization algorithm with derivative-free filter technique for box constrained optimization
• Convergence of derivative-free nonmonotone direct search methods for unconstrained and box-constrained mixed-integer optimization
• Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
• Direct search based on probabilistic feasible descent for bound and linearly constrained problems
• A class of derivative-free nonmonotone optimization algorithms employing coordinate rotations and gradient approximations
• Derivative-free optimization methods

Uses Software

• NOMAD
• MINPACK-2
• BRENT

This page was built for publication: On sequential and parallel non-monotone derivative-free algorithms for box constrained optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2867433)