A quadratic objective penalty function for bilevel programming
From MaRDI portal
Publication:488923
DOI10.1007/S11424-014-2128-7zbMATH Open1306.49050OpenAlexW1994921083MaRDI QIDQ488923FDOQ488923
Authors: Min Jiang, Zhiqing Meng, R. Shen, Xinsheng Xu 
Publication date: 27 January 2015
Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11424-014-2128-7
Recommendations
- An objective penalty function of bilevel programming
- scientific article; zbMATH DE number 1778145
- An objective penalty function algorithm for bilevel programming based on multi-parameters
- A penalty function method for solving nonlinear-linear bilevel programming problem
- A smoothing objective penalty function algorithm for bilevel programming problems
Cites Work
- Convex Analysis
- An exact penalty on bilevel programs with linear vector optimization lower level
- Foundations of bilevel programming
- Partial augmented Lagrangian method and mathematical programs with complementarity constraints
- Exact Penalization and Necessary Optimality Conditions for Generalized Bilevel Programming Problems
- Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
- Mathematical Programs with Equilibrium Constraints
- Solving quadratic convex bilevel programming problems using a smoothing method
- Exact Penalization of Mathematical Programs with Equilibrium Constraints
- Title not available (Why is that?)
- Manufacturer's revenue-sharing contract and retail competition
- A penalty function algorithm with objective parameters for nonlinear mathematical programming
- Bilevel programming: a survey
- Exact and inexact penalty methods for the generalized bilevel programming problem
- Exact penalty functions for convex bilevel programming problems.
- A game theoretic perspective to flow control in telecommunication networks
- An objective penalty function of bilevel programming
- A Bilevel Programming Method for Pipe Network Optimization
- A Sequential Smooth Penalization Approach to Mathematical Programs with Complementarity Constraints
- Lower-order penalty methods for mathematical programs with complementarity constraints
- Bilevel multiplicative problems: A penalty approach to optimality and a cutting plane based algorithm
- Optimal co-investment in supply chain infrastructure
- A note on the iterative algorithm for large sparse saddle point problems
Cited In (2)
This page was built for publication: A quadratic objective penalty function for bilevel programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q488923)
