Convergent Semidefinite Programming Relaxations for Global Bilevel Polynomial Optimization Problems (Q2796798): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q59241432 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1506.02099 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Links between linear bilevel and mixed 0-1 programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4606219 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical bilevel optimization. Algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semianalytic and subanalytic sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4210476 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and nonsmooth analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: An overview of bilevel optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of bilevel programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints / 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: Q4539336 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Farkas' lemma: three decades of generalizations for mathematical optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric categories and o-minimal structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of test problems in local and global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization of nonlinear bilevel programming problems / 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: Alternative Theorems for Quadratic Inequality Systems and Global Quadratic Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On polynomial optimization over non-compact semi-algebraic sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 920 / 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: A “Joint+Marginal” Approach to Parametric Polynomial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On representations of the feasible set in convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Min-max and robust polynomial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: New fractional error bounds for polynomial systems with applications to Hölderian stability in optimization and spectral theory of tensors / 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: New results on approximate solution in two-level optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existence theorems of equilibrium points in stackelberg / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Fritz John necessary optimality conditions in the presence of equality and inequality constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponentiation is Hard to Avoid / 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: Semidefinite programming relaxations and algebraic optimization in control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4285035 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization of Polynomials on Compact Semialgebraic Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized equations and their solutions, part II: Applications to nonlinear programming / 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: Bilevel and multilevel programming: A bibliography review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pessimistic Bilevel Optimization / 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 16:15, 11 July 2024

scientific article
Language Label Description Also known as
English
Convergent Semidefinite Programming Relaxations for Global Bilevel Polynomial Optimization Problems
scientific article

    Statements

    Convergent Semidefinite Programming Relaxations for Global Bilevel Polynomial Optimization Problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    30 March 2016
    0 references
    bilevel programming
    0 references
    global optimization
    0 references
    polynomial optimization
    0 references
    semidefinite programming hierarchies
    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
    0 references