Solving quadratic convex bilevel programming problems using a smoothing method
From MaRDI portal
Publication:632921
DOI10.1016/j.amc.2011.01.066zbMath1211.65070OpenAlexW1975127552MaRDI QIDQ632921
Publication date: 28 March 2011
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2011.01.066
smoothing methodcomplementarity constraintssemismooth equationssequential quadratic programming algorithm
Related Items (12)
Interactive approach to bi-level integer multi-objective fractional programming problem ⋮ The backpropagation artificial neural network based on elite particle swam optimization algorithm for stochastic linear bilevel programming problem ⋮ A cooperative coevolution PSO technique for complex bilevel programming problems and application to watershed water trading decision making problems ⋮ A quadratic objective penalty function for bilevel programming ⋮ An Objective Penalty Function Algorithm for Bilevel Programming Based on Multi-Parameters ⋮ Quadratic Support Functions in Quadratic Bilevel Problems ⋮ On a Solving Bilevel D.C.-Convex Optimization Problems ⋮ An interactive approach based on a discrete differential evolution algorithm for a class of integer bilevel programming problems ⋮ A New Method To Solve Bi-Level Quadratic Linear Fractional 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
- An extended \(K\)th-best approach for linear bilevel programming
- Linear bilevel programming with upper level constraints depending on the lower level solution
- A note on the definition of a linear bilevel programming solution
- A continuation method for (strongly) monotone variational inequalities
- A smoothing method for mathematical programs with equilibrium constraints
- Bilevel and multilevel programming: A bibliography review
- The steepest descent direction for the nonlinear bilevel programming problem
- A global optimization method for solving convex quadratic bilevel programming problems
- An extended Kuhn-Tucker approach for linear bilevel programming
- On the definition of linear bilevel programming solution
- On bilevel programming. I: General nonlinear cases
- Solving convex quadratic bilevel programming problems using an enumeration sequential quadratic programming algorithm
- A penalty function method based on Kuhn-Tucker condition for solving linear bilevel programming
- A sequential equality constrained quadratic programming algorithm for inequality constrained optimization
- A globally convergent sequential linear programming algorithm for mathematical programs with linear complementarity constraints
- 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
- New Branch-and-Bound Rules for Linear Bilevel Programming
- A necessary and a sufficient optimality condition for bilevel programming problems
- Generating quadratic bilevel programming test problems
- Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
- Two-Level Linear Programming
- Global optimization of nonlinear bilevel programming problems
This page was built for publication: Solving quadratic convex bilevel programming problems using a smoothing method
