Convergences for robust bilevel polynomial programmes with applications

DOI10.1080/10556788.2023.2189719MaRDI QIDQ6078425

No author found.

Publication date: 27 September 2023

Published in: Optimization Methods and Software (Search for Journal in Brave)

zbMATH Keywords

global optimizationdata uncertaintysum-of-squares relaxationconvergenceselectric vehicle charging systemrobust bilevel optimization

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Robustness in mathematical programming (90C17) Polynomial optimization (90C23)

Cites Work

• Unnamed Item
• Unnamed Item
• On the solution of convex bilevel optimization problems
• Solving ill-posed bilevel programs
• On polynomial optimization over non-compact semi-algebraic sets
• On representations of the feasible set in convex optimization
• Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals
• Multiobjective bilevel optimization
• Practical bilevel optimization. Algorithms and applications
• Foundations of bilevel programming
• Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness
• Constraint qualifications for convex optimization without convexity of constraints: new connections and applications to best approximation
• A bilevel Farkas lemma to characterizing global solutions of a class of bilevel polynomial programs
• Optimality conditions for nonsmooth multiobjective bilevel optimization problems
• Finding robust global optimal values of bilevel polynomial programs with uncertain linear constraints
• Bilevel optimization applied to strategic pricing in competitive electricity markets
• An overview of bilevel optimization
• A trust-region method for nonlinear bilevel programming: algorithm and computational exper\-ience
• The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
• Convergent Semidefinite Programming Relaxations for Global Bilevel Polynomial Optimization Problems
• An Introduction to Polynomial and Semi-Algebraic Optimization
• Theory and Applications of Robust Optimization
• Computational Difficulties of Bilevel Linear Programming
• SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
• Nondifferentiable Multiplier Rules for Optimization and Bilevel Optimization Problems
• Semismooth Newton-type method for bilevel optimization: global convergence and extensive numerical experiments
• Bilevel Programming Problems
• The Standard Pessimistic Bilevel Problem
• Globally convergent homotopy algorithm for solving the KKT systems to the principal-agent bilevel programming
• Pessimistic Bilevel Optimization
• Bilevel Polynomial Programs and Semidefinite Relaxation Methods
• An inertial extrapolation method for convex simple bilevel optimization
• Global optimization of nonlinear bilevel programming problems

This page was built for publication: Convergences for robust bilevel polynomial programmes with applications