Smoothing and worst-case complexity for direct-search methods in nonsmooth optimization (Q2841063): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q58040543, #quickstatements; #temporary_batch_1706974288397
Set OpenAlex properties.
 
(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 / describes a project that uses
 
Property / describes a project that uses: GradSamp / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1093/imanum/drs027 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1995126983 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:46, 20 March 2024

scientific article
Language Label Description Also known as
English
Smoothing and worst-case complexity for direct-search methods in nonsmooth optimization
scientific article

    Statements

    Smoothing and worst-case complexity for direct-search methods in nonsmooth optimization (English)
    0 references
    0 references
    0 references
    24 July 2013
    0 references
    derivative-free optimization
    0 references
    direct search
    0 references
    smoothing function
    0 references
    worst-case complexity
    0 references
    nonsmoothness
    0 references
    nonconvexity
    0 references
    algorithm
    0 references
    convergence
    0 references
    numerical experiments
    0 references

    Identifiers

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