Descent approaches for quadratic bilevel programming (Q1331096): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q58040694, #quickstatements; #temporary_batch_1710879948957
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Hierarchical optimization: An introduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch and Bound Algorithm for the Bilevel Programming Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Branch-and-Bound Rules for Linear Bilevel Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sequential LCP method for bilevel linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization of concave functions subject to quadratic constraints: An application in nonlinear bilevel programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex two-level optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A solution method for the static constrained Stackelberg problem via penalty method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Double penalty method for bilevel optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derivative evaluation and computational experience with large bilevel mathematical programs / 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: A note on the optimality conditions for 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: The steepest descent direction for the nonlinear bilevel programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Linear-Quadratic Bilevel Programming Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An implicit enumeration procedure for the general linear complementarity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3671749 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Finding Primal- and Dual-Optimal Bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Checking local optimality in constrained quadratic programming is NP- hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Higher-Order Predictor-Corrector Interior Point Methods with Application to Quadratic Objectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02191670 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2005629858 / rank
 
Normal rank

Latest revision as of 10:39, 30 July 2024

scientific article
Language Label Description Also known as
English
Descent approaches for quadratic bilevel programming
scientific article

    Statements

    Descent approaches for quadratic bilevel programming (English)
    0 references
    5 September 1995
    0 references
    bilevel programming
    0 references
    modified steepest descent
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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