A smoothing objective penalty function algorithm for bilevel programming problems
From MaRDI portal
Publication:2993669
DOI10.15960/J.CNKI.ISSN.1007-6093.2015.03.004zbMATH Open1349.65193MaRDI QIDQ2993669FDOQ2993669
Authors: Zhiqing Meng, R. Shen, Min Jiang, Xinsheng Xu
Publication date: 10 August 2016
Recommendations
- An objective penalty function algorithm for bilevel programming based on multi-parameters
- An objective penalty function of bilevel programming
- A penalty function method for solving a class of weak linear bilevel multi-objective programming problems
- A smoothing method for solving bilevel multiobjective programs with convex scalar program at the lower level
- An objective penalty method for optimistic bilevel programming problems
Cited In (8)
- Solving quadratic convex bilevel programming problems using a smoothing method
- An objective penalty function of bilevel programming
- A quadratic objective penalty function for bilevel programming
- An objective penalty method for optimistic bilevel programming problems
- A smoothing method for solving bilevel multiobjective programming problems
- Smoothing SQP Methods for Solving Degenerate Nonsmooth Constrained Optimization Problems with Applications to Bilevel Programs
- An objective penalty function algorithm for bilevel programming based on multi-parameters
- A smoothing method for solving bilevel multiobjective programs with convex scalar program at the lower level
This page was built for publication: A smoothing objective penalty function algorithm for bilevel programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2993669)