Semismooth Newton-type method for bilevel optimization: global convergence and extensive numerical experiments
From MaRDI portal
(Redirected from Publication:5058394)
Recommendations
- A primal nonsmooth reformulation for bilevel optimization problems
- A penalty method with trust-region mechanism for nonlinear bilevel optimization problem
- Optimality conditions for special semidefinite bilevel optimization problems
- Double penalty method for bilevel optimization problems
- On the solution of convex bilevel optimization problems
Cites work
- A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation
- A bridge between bilevel programs and Nash games
- A family of Newton methods for nonsmooth constrained systems with nonisolated solutions
- A globally convergent LP-Newton method
- A globally convergent LP-Newton method for piecewise smooth constrained equations: escaping nonstationary accumulation points
- A necessary and a sufficient optimality condition for bilevel programming problems
- A new general-purpose algorithm for mixed-integer bilevel linear programs
- A nonsmooth version of Newton's method
- A semismooth equation approach to the solution of nonlinear complementarity problems
- A smoothing augmented Lagrangian method for solving simple bilevel programs
- A special newton-type optimization method
- A superlinearly convergent QP-free algorithm for mathematical programs with equilibrium constraints
- A value-function-based exact approach for the bilevel mixed-integer programming problem
- An algorithm for solving two-level convex optimization problems
- BOLIB: bilevel Optimization LIBrary of test problems
- Continuous deformation of nonlinear programs
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- Differential properties of the marginal function in mathematical programming
- Directional differentiability of the optimal value function in a nonlinear programming problem
- Estimates of generalized hessians for optimal value functions in mathematical programming
- Exact Penalization and Necessary Optimality Conditions for Generalized Bilevel Programming Problems
- Foundations of bilevel programming
- Generalized equations and their solutions, part II: Applications to nonlinear programming
- scientific article; zbMATH DE number 4082855 (Why is no real title available?)
- scientific article; zbMATH DE number 46303 (Why is no real title available?)
- scientific article; zbMATH DE number 1502618 (Why is no real title available?)
- scientific article; zbMATH DE number 1421091 (Why is no real title available?)
- scientific article; zbMATH DE number 3365044 (Why is no real title available?)
- Introduction to sensitivity and stability analysis in nonlinear programming
- Is bilevel programming a special case of a mathematical program with complementarity constraints?
- Merit functions for complementarity and related problems: a survey
- Necessary and sufficient optimality conditions for a class of nonsmooth minimization problems
- New necessary optimality conditions in optimistic bilevel programming
- Newton-type methods for nonlinearly constrained programming problems-algorithms and theory
- On NCP-functions
- On regularity conditions for complementarity problems
- On solving simple bilevel programs with a nonconvex lower level program
- On the numerical solution of a class of Stackelberg problems
- On the resolution of monotone complementarity problems
- On the solution of convex bilevel optimization problems
- Optimality conditions for bilevel programming problems
- Perturbation theory of nonlinear programs when the set of optimal solutions is not a singleton
- Regularity Properties of a Semismooth Reformulation of Variational Inequalities
- Second order optimality conditions for bilevel set optimization problems
- Second order sensitivity analysis and asymptotic theory of parametrized nonlinear programs
- Semi-Infinite Programming: Theory, Methods, and Applications
- Semismooth and Semiconvex Functions in Constrained Optimization
- Semismooth Karush-Kuhn-Tucker Equations and Convergence Analysis of Newton and Quasi-Newton Methods for Solving these Equations
- Semismooth Newton method for the lifted reformulation of mathematical programs with complementarity constraints
- Semismooth Newton-type method for bilevel optimization: global convergence and extensive numerical experiments
- Smoothing SQP Methods for Solving Degenerate Nonsmooth Constrained Optimization Problems with Applications to Bilevel Programs
- Solution algorithm for an optimistic linear Stackelberg problem
- The bilevel programming problem: reformulations, constraint qualifications and optimality conditions
- The generalized Mangasarian-Fromowitz constraint qualification and optimality conditions for bilevel programs
- The semismooth algorithm for large scale complementarity problems
Cited in
(16)- Gauss-Newton-type methods for bilevel optimization
- Semismooth Newton-type method for bilevel optimization: global convergence and extensive numerical experiments
- Convergences for robust bilevel polynomial programmes with applications
- scientific article; zbMATH DE number 7774549 (Why is no real title available?)
- Extension of the value function reformulation to multiobjective bilevel optimization
- Levenberg-Marquardt method and partial exact penalty parameter selection in bilevel optimization
- Semismooth Newton-type method for bilevel optimization: Global convergence and extensive numerical experiments
- Nonconvex quasi-variational inequalities: stability analysis and application to numerical optimization
- Necessary optimality conditions for nonsmooth multiobjective bilevel programs using the Drummond-Svaiter functional
- A fresh look at nonsmooth Levenberg–Marquardt methods with applications to bilevel optimization
- Optimality conditions for bilevel programmes via Moreau envelope reformulation*
- A neurodynamic approach for a class of pseudoconvex semivectorial bilevel optimization problems
- Scholtes relaxation method for pessimistic bilevel optimization
- Bilevel optimization with sustainability perspective: a survey on applications
- Neurodynamic optimization model for bilevel programming with pseudoconvex upper-level optimization
- A new problem qualification based on approximate KKT conditions for Lipschitzian optimization with application to bilevel programming
This page was built for publication: Semismooth Newton-type method for bilevel optimization: global convergence and extensive numerical experiments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5058394)
