The nonlinear bilevel programming problem:formulations,regularity and optimality conditions
From MaRDI portal
Publication:4764597
Recommendations
Cites work
- scientific article; zbMATH DE number 3067835 (Why is no real title available?)
- A note on the optimality conditions for the bilevel programming problem
- A sequential LCP method for bilevel linear programming
- A solution method for the linear static Stackelberg problem using penalty functions
- An Algorithm for Solving the General Bilevel Programming Problem
- Constraint qualifications in maximization problems
- Convex Analysis
- Directional differentiability of the optimal value function in a nonlinear programming problem
- New Branch-and-Bound Rules for Linear Bilevel Programming
- On the structure and properties of a linear multilevel programming problem
- On two-level optimization
- Optimality conditions for the bilevel programming problem
- Optimization and nonsmooth analysis
- The steepest descent direction for the nonlinear bilevel programming problem
- Two-Level Linear Programming
Cited in
(28)- Exact penalization and necessary optimality conditions for multiobjective optimization problems with equilibrium constraints
- On M-stationary points for mathematical programs with equilibrium constraints
- Bilevel Optimization as a Regularization Approach to Pseudomonotone Equilibrium Problems
- Combined Monte Carlo sampling and penalty method for stochastic nonlinear complementarity problems
- Stochastic mathematical programs with hybrid equilibrium constraints
- KKT transformation approach for multi-objective multi-level linear programming problems
- Numerical methods for diagnosis and therapy design of cerebral palsy by bilevel optimal control of constrained biomechanical multi-body systems
- Model order reduction techniques with a posteriori error control for nonlinear robust optimization governed by partial differential equations
- An MPEC formulation and its cutting constraint algorithm for continuous network design problem with multi-user classes
- Bilevel and multilevel programming: A bibliography review
- Multilevel (Hierarchical) Optimization: Complexity Issues, Optimality Conditions, Algorithms
- Asymptotic regularity for Lipschitzian nonlinear optimization problems with applications to complementarity constrained and bilevel programming
- Smoothing and regularization strategies for optimization of hybrid dynamic systems
- Optimization problems for machine learning: a survey
- Necessary optimality conditions for mathematical programs with second-order cone complementarity constraints
- The quasiparticle lifetime in a doped graphene sheet
- A smoothing heuristic for a bilevel pricing problem
- Models and a relaxation algorithm for continuous network design problem with a tradable credit scheme and equity constraints
- A class of smoothing methods for mathematical programs with complementarity constraints
- On the Karush-Kuhn-Tucker reformulation of the bilevel optimization problem
- Expected residual minimization formulation for a class of stochastic linear second-order cone complementarity problems
- Regularization method for stochastic mathematical programs with complementarity constraints
- New relaxation method for mathematical programs with complementarity constraints
- Models and Software for Urban and Regional Transportation Planning: The Contributions of the Center for Research on Transportation
- Bilevel optimization: theory, algorithms, applications and a bibliography
- A projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs
- Newton-type method for a class of mathematical programs with complementarity constraints
- Two approaches for solving mathematical programs with second-order cone complementarity constraints
This page was built for publication: The nonlinear bilevel programming problem:formulations,regularity and optimality conditions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4764597)
