Lipschitz B-vex functions and nonsmooth programming (Q1357526): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: On sufficiency of the Kuhn-Tucker conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: What is invexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: B-vex functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized B-vex functions and generalized B-vex programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalization of preinvex and B-vex functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of nonsmooth functions through their generalized gradients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasimonotone Multifunctions; Applications to Optimality Conditions in Quasiconvex Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and nonsmooth analysis / 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.1023/a:1022643129733 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1583981470 / rank
 
Normal rank

Latest revision as of 10:14, 30 July 2024

scientific article
Language Label Description Also known as
English
Lipschitz B-vex functions and nonsmooth programming
scientific article

    Statements

    Lipschitz B-vex functions and nonsmooth programming (English)
    0 references
    0 references
    10 May 1998
    0 references
    0 references
    0 references
    0 references
    0 references
    B-vex functions
    0 references
    quasiconvex functions
    0 references
    Clarke subdifferential
    0 references
    necessary optimality condition
    0 references
    sufficient optimality condition
    0 references
    nonsmooth programming
    0 references
    0 references