Direct Search Based on Probabilistic Descent in Reduced Spaces (Q6071887): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Derivative-Free and Blackbox Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of Trust-Region Methods Based on Probabilistic Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp nonasymptotic bounds on the norm of random matrices with independent entries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Three Points Method for Unconstrained Smooth Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4907706 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving the Flexibility and Robustness of Model-based Derivative-free Optimization Solvers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Oracle Complexity of First-Order and Derivative-Free Algorithms for Smooth Nonconvex Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scalable subspace methods for derivative-free nonlinear least-squares optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global convergence rate analysis of unconstrained optimization methods based on probabilistic models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Derivative-Free Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the optimal order of worst case complexity of direct search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Rates for Zero-Order Convex Optimization: The Power of Two Function Evaluations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trust-Region Methods Without Using Derivatives: Worst Case Complexity and the NonSmooth Case / rank
 
Normal rank
Property / cites work
 
Property / cites work: CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Direct Search Based on Probabilistic Descent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity and global rates of trust-region methods based on probabilistic models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Direct search based on probabilistic feasible descent for bound and linearly constrained problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A deterministic algorithm to compute the cosine measure of a finite positive spanning set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparser Johnson-Lindenstrauss Transforms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4435425 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A stochastic subspace approach to gradient-free optimization in high dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zeroth-order optimization with orthogonal random directions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derivative-free optimization methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random gradient-free minimization of convex functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Stochastic Line Search Method with Expected Complexity Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smallest singular value of a random rectangular matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst case complexity of direct search / rank
 
Normal rank

Revision as of 12:34, 20 August 2024

scientific article; zbMATH DE number 7771598
Language Label Description Also known as
English
Direct Search Based on Probabilistic Descent in Reduced Spaces
scientific article; zbMATH DE number 7771598

    Statements

    Direct Search Based on Probabilistic Descent in Reduced Spaces (English)
    0 references
    0 references
    0 references
    29 November 2023
    0 references
    derivative-free optimization
    0 references
    direct-search methods
    0 references
    random subspaces
    0 references
    probabilistic properties
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references