The method of solving the convex two-level programming by penalty function
From MaRDI portal
Recommendations
- An objective penalty function of bilevel programming
- Convex two-level optimization problem
- On reducibility of the general convex programming problem to an unconditional extremum problem
- Double penalty method for bilevel optimization problems
- On penalty function method for a class of nonconvex constrained optimization problems.
Cited in
(2)
This page was built for publication: The method of solving the convex two-level programming by penalty function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2739169)