An objective penalty function algorithm for bilevel programming based on multi-parameters

DOI10.1080/01630563.2012.723295MaRDI QIDQ4912749zbMATH OpenOpenAlexFDO

Authors Zhiqing Meng, R. Shen, Min Jiang, Xinsheng Xu

Publication date 5 April 2013

Published in Numerical Functional Analysis and Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/01630563.2012.723295

zbMATH Keywords

bilevel programmingconvexityobjective penalty functionsmoothing

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Recommendations

• A smoothing objective penalty function algorithm for bilevel programming problems
• An objective penalty function of bilevel programming
• Linear bilevel multiobjective optimization problem: penalty approach
• scientific article; zbMATH DE number 1778145
• A penalty function method for solving a class of weak linear bilevel multi-objective programming problems

Cites work

• A bilevel programming approach to the travelling salesman problem.
• A dual-relax penalty function approach for solving nonlinear bilevel programming with linear lower level problem
• A globally convergent algorithm for a class of bilevel nonlinear programming problem
• A penalty function algorithm with objective parameters for nonlinear mathematical programming
• A smoothing objective penalty function algorithm for inequality constrained optimization problems
• A trust-region method for nonlinear bilevel programming: algorithm and computational exper\-ience
• An exact penalty on bilevel programs with linear vector optimization lower level
• Bilevel and multilevel programming: A bibliography review
• Bilevel multiplicative problems: A penalty approach to optimality and a cutting plane based algorithm
• Bilevel programming in traffic planning: Models, methods and challenge
• Discrete linear bilevel programming problem
• Exact Penalization and Necessary Optimality Conditions for Generalized Bilevel Programming Problems
• Exact penalty functions for convex bilevel programming problems.
• Foundations of bilevel programming
• Network design problem with congestion effects: A case of bilevel programming
• Practical bilevel optimization. Algorithms and applications
• Production planning problem with sequence dependent setups as a bilevel programming problem
• Scheduling with monotonous earliness and tardiness penalties
• Solving quadratic convex bilevel programming problems using a smoothing method
• Some properties of the bilevel programming problem

Cited in

(10)

• An objective penalty function method for biconvex programming
• Penalty method-based equilibrium point approach for solving the linear bilevel multiobjective programming problem
• A barrier objective penalty function algorithm for mathematical programming
• A smoothing objective penalty function algorithm for bilevel programming problems
• An M-objective penalty function algorithm under big penalty parameters
• An objective penalty function of bilevel programming
• A quadratic objective penalty function for bilevel programming
• A smoothing method for solving bilevel multiobjective programming problems
• An exact penalty function approach for solving the linear bilevel multiobjective programming problem
• A smoothing method for solving bilevel multiobjective programs with convex scalar program at the lower level

This page was built for publication: An objective penalty function algorithm for bilevel programming based on multi-parameters

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4912749)