Optimality conditions for optimistic bilevel programming problem using convexifactors (Q415386): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10957-011-9941-0 / 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.1007/s10957-011-9941-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2053072311 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical bilevel optimization. Algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of bilevel programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality conditions for the bilevel programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some properties of the bilevel programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A necessary and a sufficient optimality condition for bilevel programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: First-order necessary optimality conditions for general bilevel programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Necessary optimality conditions for Stackelberg problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Necessary Optimality Conditions for Optimization Problems with Variational Inequality Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality conditions for bilevel programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: First-order necessary optimality conditions for general bilevel programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Necessary optimality conditions for bilevel optimization problems using convexificators / rank
 
Normal rank
Property / cites work
 
Property / cites work: New necessary optimality conditions in optimistic bilevel programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondifferentiable Multiplier Rules for Optimization and Bilevel Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint Qualifications and KKT Conditions for Bilevel Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Necessary optimality conditions in terms of convexificators in Lipschitz optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5574526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hunting for a smaller convex subdifferential / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonsmooth calculus, minimality, and monotonicity of convexificators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convexifactors, generalized convexity, and optimality conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convexifactors, generalized convexity and vector optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and nonsmooth analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variational Stability and Marginal Functions via Generalized Differentiation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgradients of marginal functions in parametric mathematical programming / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10957-011-9941-0 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:50, 9 December 2024

scientific article
Language Label Description Also known as
English
Optimality conditions for optimistic bilevel programming problem using convexifactors
scientific article

    Statements

    Optimality conditions for optimistic bilevel programming problem using convexifactors (English)
    0 references
    0 references
    8 May 2012
    0 references
    A bilevel mathematical programming problem is considered with a convex lower-level problem. New Karush-Kuhn-Tucker type necessary optimality conditions are established. The proof is based on the concept of convexification, and on an upper estimate of the Clark subdifferential of the value function.
    0 references
    bilevel programming
    0 references
    convexification
    0 references
    constraint qualification
    0 references
    0 references

    Identifiers