Optimization of upper semidifferentiable functions (Q790713): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4132264 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5566712 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence Conditions for Ascent Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for some minimax problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Constrained Optimization with Semismooth Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the variational principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Gradients and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Approach to Lagrange Multipliers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization of lipschitz continuous functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf00938396 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1980252045 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:57, 30 July 2024

scientific article
Language Label Description Also known as
English
Optimization of upper semidifferentiable functions
scientific article

    Statements

    Optimization of upper semidifferentiable functions (English)
    0 references
    0 references
    1984
    0 references
    In this paper, we present an implementable algorithm to minimize a nonconvex, nondifferentiable function in \({\mathbb{R}}^ m\). The method generalizes Wolfe's algorithm for convex functions and Mifflin's algorithm for semismooth functions to a broader class of functions, so- called upper semidifferentiable. With this objective, we define a new enlargement of Clarke's generalized gradient that recovers, in a special case, the enlargement proposed by Goldstein. We analyze the convergence of the method and discuss some numerical experiments.
    0 references
    upper semidifferentiable functions
    0 references
    convergence analysis
    0 references
    generalized Wolfe's algorithm
    0 references
    nonconvex, nondifferentiable function
    0 references
    Mifflin's algorithm
    0 references
    generalized gradient
    0 references

    Identifiers

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