• Home
  • Search
  • Direct Search Based on Probabilistic Descent
  • Open Access IconOpen Access
  • Cite Icon94
  • https://doi.org/10.1137/140961602Copy DOI Icon

Direct Search Based on Probabilistic Descent

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

Direct-search methods are a class of popular derivative-free algorithms characterized by evaluating the objective function using a step size and a number of (polling) directions. When applied to the minimization of smooth functions, the polling directions are typically taken from positive spanning sets, which in turn must have at least n+1 vectors in an $n$-dimensional variable space. In addition, to ensure the global convergence of these algorithms, the positive spanning sets used throughout the iterations are required to be uniformly nondegenerate in the sense of having a positive (cosine) measure bounded away from zero. However, recent numerical results indicated that randomly generating the polling directions without imposing the positive spanning property can improve the performance of these methods, especially when the number of directions is chosen as considerably less than n+1. In this paper, we analyze direct-search algorithms when the polling directions are probabilistic descent, meaning that with a certain probability at least one of them is of descent type. Such a framework enjoys almost-sure global convergence. More interestingly, we will show a global decaying rate of $1/\sqrt{k}$ for the gradient size, with overwhelmingly high probability, matching the corresponding rate for the deterministic versions of the gradient method or of direct search. Our analysis helps us understand numerical behavior and the choice of the number of polling directions.

Similar Papers
  • Research Article
  • Citations7

Pareto 최적점 기반 다목적함수 기법 개발에 관한 연구

  • Apr 01, 2005
  • Journal of the Society of Naval Architects of Korea
  • Seung-Soo Na
  • Book Chapter
  • Citations1

Chapter 10 - Numerical Methods for Unconstrained Optimum Design

  • Apr 08, 2016
  • Introduction to Optimum Design
  • Jasbir S Arora
  • Conference Article
  • Citations11

Antenna Array Synthesis Using Derivative, Non-Derivative and Random Search Optimization

  • Apr 01, 2008
  • Stephen J Blank +1
  • Research Article
  • Citations7

A second-order globally convergent direct-search method and its worst-case complexity

  • Dec 29, 2015
  • Optimization
  • S Gratton +2
  • Research Article
  • Citations6

The numerical computation of kinetic parameters for contracting interface reactions

  • Jun 01, 1976
  • Journal of Thermal Analysis
  • A C Norris +2
  • Conference Article
  • Citations2

Mixed Discrete and Continuous Variable Optimization Based on Constraint Aggregation and Relative Sensitivity

  • Aug 04, 2013
  • Zhansi Jiang +2
  • Research Article
  • Citations4

Global and local convergence of a nonmonotone SQP method for constrained nonlinear optimization

  • Jul 16, 2014
  • Computational Optimization and Applications
  • Chungen Shen +3
  • Research Article
  • Citations256

A globally convergent version of the Polak-Ribière conjugate gradient method

  • Sep 01, 1997
  • Mathematical Programming
  • L Grippo +1
  • Research Article
  • Citations82

Low-mass right-handed sneutrino dark matter: SuperCDMS and LUX constraints and the Galactic Centre gamma-ray excess

  • Aug 01, 2014
  • Journal of Cosmology and Astroparticle Physics
  • D.G Cerdeño +2
  • Research Article
  • Citations19

Robust and efficient nonlinear regression of kinetic systems using a direct search method

  • Feb 01, 1991
  • Computers and Chemical Engineering
  • L.S Lobo +1
  • Research Article
  • Citations7

Accelerated Directional Search with Non-Euclidean Prox-Structure

  • Apr 01, 2019
  • Automation and Remote Control
  • E A Vorontsova +2
  • Research Article
  • Citations52

Iterated local search with Powell’s method: a memetic algorithm for continuous global optimization

  • Feb 24, 2010
  • Memetic Computing
  • Oliver Kramer
  • PDF
  • Preprint Article

Keyword Co-Occurrence Analysis Using the FPGrowth Algorithm. An Example of Energies Journal Bibliometric Data for 2023-2024

  • Jun 20, 2024
  • Preprints.org
  • Boris Chigarev
  • Research Article
  • Citations54

Thermal design improvement of a double-layered microchannel heat sink by using multi-walled carbon nanotube (MWCNT) nanofluids with non-Newtonian viscosity

  • Oct 19, 2018
  • Applied Thermal Engineering
  • A Sarlak +2
  • Research Article
  • Citations6

Nonsmooth spectral gradient methods for unconstrained optimization

  • Jan 30, 2017
  • EURO Journal on Computational Optimization
  • Milagros Loreto +3
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.