Direct search based on probabilistic feasible descent for bound and linearly constrained problems (Q2419520): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: Wikidata QID (P12): Q128547599, #quickstatements; #temporary_batch_1724928618437
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Pattern search in the presence of degenerate linear constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derivative-Free and Blackbox Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear equalities in blackbox optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Progressive Barrier for Derivative-Free Nonlinear Programming / 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: Evaluation Complexity for Nonlinear Constrained Optimization Using Unscaled KKT Conditions and High-Order Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptive cubic regularization algorithm for nonconvex optimization with convex constraints and its function-evaluation complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of finding first-order critical points in constrained nonlinear optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Derivative-Free Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Globally convergent evolution strategies for constrained 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: A grid algorithm for bound constrained optimization of noisy functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sequential and parallel non-monotone derivative-free algorithms for box constrained optimization / 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: A Merit Function Approach for Direct Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implicit Filtering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4435425 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stationarity Results for Generating Set Search for Linearly Constrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 909 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementing Generating Set Search Methods for Linearly Constrained Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pattern Search Algorithms for Bound Constrained Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pattern Search Methods for Linearly Constrained Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized pattern search methods for linearly equality constrained optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A derivative-free algorithm for bound constrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Objective-derivative-free methods for constrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking Derivative-Free Optimization Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3845569 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Frames and Grids in Unconstrained and Linearly Constrained Optimization: A Nonsmooth Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Measures, Integrals and Martingales / rank
 
Normal rank
Property / cites work
 
Property / cites work: A particle swarm pattern search method for bound constrained global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: PSwarm: a hybrid solver for linearly constrained global derivative-free optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst case complexity of direct search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditions for convergence of trust region algorithms for nonsmooth optimization / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128547599 / rank
 
Normal rank

Latest revision as of 11:56, 29 August 2024

scientific article
Language Label Description Also known as
English
Direct search based on probabilistic feasible descent for bound and linearly constrained problems
scientific article

    Statements

    Direct search based on probabilistic feasible descent for bound and linearly constrained problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    13 June 2019
    0 references
    derivative-free optimization
    0 references
    direct-search methods
    0 references
    bound constraints
    0 references
    linear constraints
    0 references
    feasible descent
    0 references
    probabilistic feasible descent
    0 references
    worst-case complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers