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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
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

Revision as of 11:14, 14 June 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