Bilevel Polynomial Programs and Semidefinite Relaxation Methods (Q5348472): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: GAMS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: BARON / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SeDuMi / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SDPT3 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1508.06985 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving bilevel programs with the KKT-approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3968042 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex two-level optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Difficulties of Bilevel Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of optimality in convex programming without a constraint qualification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3151174 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinitely constrained optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and nonsmooth analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of bilevel programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Is bilevel programming a special case of a mathematical program with complementarity constraints? / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the solution of convex bilevel optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bilevel Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing rational functions by exact Jacobian SDP relaxation applicable to finite singularities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sensitivity Analysis of the Value Function for Parametric Mathematical Programs with Equilibrium Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: GloptiPoly 3: moments, optimization and semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-Infinite Programming: Theory, Methods, and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergent Semidefinite Programming Relaxations for Global Bilevel Polynomial Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Optimization with Polynomials and the Problem of Moments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4589032 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On solving simple bilevel programs with a nonconvex lower level program / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Theory of Moral Hazard and Unobservable Behaviour: Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global solution of bilevel programs with a nonconvex inner program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certifying convergence of Lasserre's hierarchy via flat truncation / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact Jacobian SDP relaxation for polynomial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality conditions and finite convergence of Lasserre's hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the numerical solution of a class of Stackelberg problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4285035 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: SDPT3 — A Matlab software package for semidefinite programming, Version 1.3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite relaxations for semi-infinite polynomial programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A smoothing augmented Lagrangian method for solving simple bilevel programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smoothing augmented Lagrangian method for nonsmooth constrained optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smoothing SQP Methods for Solving Degenerate Nonsmooth Constrained Optimization Problems with Applications to Bilevel Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality conditions for bilevel programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Necessary Optimality Conditions for Bilevel Programs by Combining the MPEC and Value Function Approaches / rank
 
Normal rank

Latest revision as of 07:27, 14 July 2024

scientific article; zbMATH DE number 6762074
Language Label Description Also known as
English
Bilevel Polynomial Programs and Semidefinite Relaxation Methods
scientific article; zbMATH DE number 6762074

    Statements

    Bilevel Polynomial Programs and Semidefinite Relaxation Methods (English)
    0 references
    0 references
    0 references
    0 references
    18 August 2017
    0 references
    bilevel polynomial program
    0 references
    Lasserre relaxation
    0 references
    Fritz John condition
    0 references
    Jacobian representation
    0 references
    exchange method
    0 references
    semi-infinite programming
    0 references
    semidefinite
    0 references
    convergence
    0 references
    numerical experiment
    0 references
    0 references
    0 references
    0 references
    0 references
    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