A quadratic objective penalty function for bilevel programming
From MaRDI portal
Publication:488923
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
- scientific article; zbMATH DE number 3744430 (Why is no real title available?)
- A Bilevel Programming Method for Pipe Network Optimization
- A Sequential Smooth Penalization Approach to Mathematical Programs with Complementarity Constraints
- A game theoretic perspective to flow control in telecommunication networks
- A note on the iterative algorithm for large sparse saddle point problems
- A penalty function algorithm with objective parameters for nonlinear mathematical programming
- An exact penalty on bilevel programs with linear vector optimization lower level
- An objective penalty function of bilevel programming
- Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
- Bilevel multiplicative problems: A penalty approach to optimality and a cutting plane based algorithm
- Bilevel programming: a survey
- Convex Analysis
- Exact Penalization and Necessary Optimality Conditions for Generalized Bilevel Programming Problems
- Exact Penalization of Mathematical Programs with Equilibrium Constraints
- Exact and inexact penalty methods for the generalized bilevel programming problem
- Exact penalty functions for convex bilevel programming problems.
- Foundations of bilevel programming
- Lower-order penalty methods for mathematical programs with complementarity constraints
- Manufacturer's revenue-sharing contract and retail competition
- Mathematical Programs with Equilibrium Constraints
- Optimal co-investment in supply chain infrastructure
- Partial augmented Lagrangian method and mathematical programs with complementarity constraints
- Solving quadratic convex bilevel programming problems using a smoothing method
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)