A second-order globally convergent direct-search method and its worst-case complexity (Q2810113): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q58040477, #quickstatements; #temporary_batch_1705868726170
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Q245491 / rank
Normal rank
 
Property / author
 
Property / author: Luis Nunes Vicente / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2336146308 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Second-Order Behavior of Pattern Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of Mesh Adaptive Direct Search to Second‐Order Stationary Points / rank
 
Normal rank
Property / cites work
 
Property / cites work: A subclass of generating set search with convergence to second-order stationary points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mesh Adaptive Direct Search Algorithms for Constrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining and scaling descent and negative curvature directions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation of sparse low degree interpolating polynomials and their application to derivative-free optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mesh adaptive direct search with second directional derivative-based Hessian update / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity bounds for second-order optimality in unconstrained optimization / 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: Global Convergence of General Derivative-Free Trust-Region Algorithms to First- and Second-Order Critical Points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Derivative-Free Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Positive Linear Dependence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coordinate search algorithms in multilevel optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generating set search method using curvature information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smoothing and worst-case complexity for direct-search methods in nonsmooth 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: Exploiting negative curvature directions in linesearch methods for unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive Trust-Region Methods for Multiscale Nonlinear 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: Curvilinear Stabilization Techniques for Truncated Newton Methods in Large Scale Unconstrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A superlinearly convergent algorithm for minimization without evaluating derivatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the use of directions of negative curvature in a modified newton method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking Derivative-Free Optimization Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonconvex optimization using negative curvature within a modified linesearch / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Convergence of Pattern Search Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst case complexity of direct search / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 01:45, 12 July 2024

scientific article
Language Label Description Also known as
English
A second-order globally convergent direct-search method and its worst-case complexity
scientific article

    Statements

    A second-order globally convergent direct-search method and its worst-case complexity (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    31 May 2016
    0 references
    derivative-free optimization
    0 references
    direct-search
    0 references
    negative curvature
    0 references
    worst-case complexity
    0 references

    Identifiers