Solving convex quadratic bilevel programming problems using an enumeration sequential quadratic programming algorithm

DOI10.1007/s10898-009-9482-3zbMath1237.90176OpenAlexW2058401669MaRDI QIDQ1959233

Jean Bosco Etoa Etoa

Publication date: 6 October 2010

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-009-9482-3

zbMATH Keywords

convex bilevel programenumeration sequential quadratic programming algorithmprimal-dual monotonicity

Mathematics Subject Classification ID

Convex programming (90C25) Quadratic programming (90C20) Methods of successive quadratic programming type (90C55)

Related Items (11)

Solving quadratic convex bilevel programming problems using a smoothing method ⋮ Linear bilevel programming with interval coefficients ⋮ An evolutionary algorithm for solving bilevel programming problems using duality conditions ⋮ Neural network for solving convex quadratic bilevel programming problems ⋮ Uncertain random multilevel programming with application to production control problem ⋮ Quadratic Support Functions in Quadratic Bilevel Problems ⋮ A Cutting Plane Approach for Solving Linear Bilevel Programming Problems ⋮ An interactive approach based on a discrete differential evolution algorithm for a class of integer bilevel programming problems ⋮ Global Search for Bilevel Optimization with Quadratic Data ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography ⋮ A genetic algorithm using a finite search space for solving nonlinear/linear fractional bilevel programming problems

Cites Work

• Unnamed Item
• Unnamed Item
• Bilevel programming: a survey
• Government-private sector relations as a Stackelberg game. A degenerate case
• Convex two-level optimization
• Derivative evaluation and computational experience with large bilevel mathematical programs
• On the quasiconcave bilevel programming problem
• Descent approaches for quadratic bilevel programming
• Bilevel and multilevel programming: A bibliography review
• The steepest descent direction for the nonlinear bilevel programming problem
• Links between linear bilevel and mixed 0-1 programming problems
• Linear bilevel problems: genericity results and an efficient method for computing local minima
• A global optimization method for solving convex quadratic bilevel programming problems
• A bilevel programming approach to determining tax credits for biofuel production
• A note on a penalty function approach for solving bilevel linear programs
• On bilevel programming. I: General nonlinear cases
• Hybrid approach with active set identification for mathematical programs with complementarity constraints
• A Bilevel Model and Solution Algorithm for a Freight Tariff-Setting Problem
• A Bilevel Model of Taxation and Its Application to Optimal Highway Pricing
• Optimality conditions for the bilevel programming problem
• A Branch and Bound Algorithm for the Bilevel Programming Problem
• Computational Difficulties of Bilevel Linear Programming
• The polynomial hierarchy and a simple model for competitive analysis
• A simple algorithm for the-linear bilevel programming problem
• A hierarchical optimization model of resource allocation
• New Branch-and-Bound Rules for Linear Bilevel Programming
• On the Accurate Identification of Active Constraints
• A necessary and a sufficient optimality condition for bilevel programming problems
• Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
• The nonlinear bilevel programming problem:formulations,regularity and optimality conditions
• Two-Level Linear Programming
• Two-Level Planning
• An Algorithm for the Traveling Salesman Problem
• Convex Analysis
• Filled functions for unconstrained global optimization.

This page was built for publication: Solving convex quadratic bilevel programming problems using an enumeration sequential quadratic programming algorithm