We are improving our search experience. To check which content you have full access to, or for advanced search, go back to the old search.

Search

Please fill in this field.
Filters applied:

Search Results

Showing 1-20 of 10,000 results
  1. Inexact direct-search methods for bilevel optimization problems

    In this work, we introduce new direct-search schemes for the solution of bilevel optimization (BO) problems. Our methods rely on a fixed accuracy...

    Youssef Diouane, Vyacheslav Kungurtsev, ... Damiano Zeffiro in Computational Optimization and Applications
    Article Open access 21 March 2024
  2. Retraction-Based Direct Search Methods for Derivative Free Riemannian Optimization

    Direct search methods represent a robust and reliable class of algorithms for solving black-box optimization problems. In this paper, the application...

    Vyacheslav Kungurtsev, Francesco Rinaldi, Damiano Zeffiro in Journal of Optimization Theory and Applications
    Article Open access 30 July 2023
  3. Bilevel Nash Equilibrium Problems: Numerical Approximation Via Direct-Search Methods

    We address the numerical approximation of bilevel problems where a Nash equilibrium has to be determined both in the upper level and in the lower...

    Francesco Caruso, Maria Carmela Ceparano, Jacqueline Morgan in Dynamic Games and Applications
    Article 25 February 2023
  4. Convergence of derivative-free nonmonotone Direct Search Methods for unconstrained and box-constrained mixed-integer optimization

    This paper presents a class of nonmonotone Direct Search Methods that converge to stationary points of unconstrained and boxed constrained...

    Ubaldo M. García Palomares in Computational Optimization and Applications
    Article Open access 25 April 2023
  5. On polling directions for randomized direct-search approaches: application to beam angle optimization in intensity-modulated proton therapy

    Deterministic direct-search methods have been successfully used to address real-world challenging optimization problems, including the beam angle...

    H. Rocha, J. Dias in Journal of Global Optimization
    Article Open access 10 May 2024
  6. Expected complexity analysis of stochastic direct-search

    This work presents the convergence rate analysis of stochastic variants of the broad class of direct-search methods of directional type. It...

    Article 27 November 2021
  7. Direct Methods for Constrained Optimization

    As we have already seen in Chap. 9 , the direct methods for unconstrained optimization do not use...
    Chapter 2022
  8. Constructive and Destructive Methods in Heuristic Search

    Constructive methods are one of the main families of heuristic approaches to combinatorial optimization problems. They usually start from an empty...
    Roberto Aringhieri, Roberto Cordone, ... Andrea Grosso in Discrete Diversity and Dispersion Maximization
    Chapter 2023
  9. Local convergence of primal–dual interior point methods for nonlinear semidefinite optimization using the Monteiro–Tsuchiya family of search directions

    The recent advance of algorithms for nonlinear semidefinite optimization problems (NSDPs) is remarkable. Yamashita et al. first proposed a...

    Article 28 February 2024
  10. Tabu Search

    Tabu search is a meta-heuristic that guides a local heuristic search procedure to explore the solution space beyond local optimality. One of the main...
    Rafael Martí, Anna Martínez-Gavara, Fred Glover in Discrete Diversity and Dispersion Maximization
    Chapter 2023
  11. Worst-Case Complexity Bounds of Directional Direct-Search Methods for Multiobjective Optimization

    Direct Multisearch is a well-established class of algorithms, suited for multiobjective derivative-free optimization. In this work, we analyze the...

    Ana Luísa Custódio, Youssef Diouane, ... Elisa Riccietti in Journal of Optimization Theory and Applications
    Article 23 November 2020
  12. Stochastic Optimization Methods

    This chapter introduces some methods aimed at solving difficult optimization problems arising in many engineering fields. By difficult optimization...
    Chapter 2024
  13. Development of DIRECT-Type Algorithms

    The deterministic derivative-free DIRECT-type algorithms have gained significant recognition in the optimization community due to their simplicity...
    Linas Stripinis, Remigijus Paulavičius in Derivative-free DIRECT-type Global Optimization
    Chapter 2023
  14. A projected-search interior-point method for nonlinearly constrained optimization

    This paper concerns the formulation and analysis of a new interior-point method for constrained optimization that combines a shifted primal-dual...

    Philip E. Gill, Minxin Zhang in Computational Optimization and Applications
    Article Open access 21 February 2024
  15. Stochastic mesh adaptive direct search for blackbox optimization using probabilistic estimates

    We present a stochastic extension of the mesh adaptive direct search (MADS) algorithm originally developed for deterministic blackbox optimization....

    Charles Audet, Kwassi Joseph Dzahini, ... Sébastien Le Digabel in Computational Optimization and Applications
    Article 11 March 2021
  16. Perfect state transfer, equitable partition and continuous-time quantum walk based search

    In this paper, we consider a continuous-time quantum walk based search algorithm. We discuss equitable partition of the graph and perfect state...

    Yusuke Ide, Akihiro Narimatsu in Quantum Studies: Mathematics and Foundations
    Article 16 February 2024
  17. On the use of polynomial models in multiobjective directional direct search

    Polynomial interpolation or regression models are an important tool in Derivative-free Optimization, acting as surrogates of the real function. In...

    C. P. Brás, A. L. Custódio in Computational Optimization and Applications
    Article 12 October 2020
  18. Analyses of Political Crisis Impact on Tourism: A Panel Counterfactual Approach with Internet Search Index

    Existing research has shown that political crisis events can directly impact the tourism industry. However, the current methods suffer from potential...

    Bai Huang, Yuying Sun, Boyu Yang in Journal of Systems Science and Complexity
    Article 11 June 2024
  19. Linewalker: line search for black box derivative-free optimization and surrogate model construction

    This paper describes a simple, but effective sampling method for optimizing and learning a discrete approximation (or surrogate) of a...

    Dimitri J. Papageorgiou, Jan Kronqvist, Krishnan Kumaran in Optimization and Engineering
    Article 21 February 2024
Did you find what you were looking for? Share feedback.