On a solving bilevel d.c.-convex optimization problems
From MaRDI portal
Publication:4965111
Recommendations
- Numerical solution of a linear bilevel problem
- On the solution of convex bilevel optimization problems
- On solving bilevel optimization problems with a nonconvex lower level: the case of a bimatrix game
- A DC algorithm for solving quadratic-linear bilevel optimization problems
- Connection of some bilevel and nonlinear optimization problems
Cites work
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 4041643 (Why is no real title available?)
- scientific article; zbMATH DE number 3748742 (Why is no real title available?)
- scientific article; zbMATH DE number 1266748 (Why is no real title available?)
- scientific article; zbMATH DE number 2068075 (Why is no real title available?)
- scientific article; zbMATH DE number 914364 (Why is no real title available?)
- A computational study of global algorithms for linear bilevel programming
- A global optimization method for solving convex quadratic bilevel programming problems
- A line search exact penalty method using steering rules
- A trust-region method for nonlinear bilevel programming: algorithm and computational exper\-ience
- An overview of bilevel optimization
- Bilevel Programming
- Bilevel programming problems. Theory, algorithms and applications to energy networks
- DC programming: overview.
- Foundations of bilevel programming
- Global optimality conditions and exact penalization
- Global optimization of nonlinear bilevel programming problems
- Global optimization with non-convex constraints. Sequential and parallel algorithms
- Global search for bilevel optimization with quadratic data
- Is bilevel programming a special case of a mathematical program with complementarity constraints?
- Mathematical Programs with Equilibrium Constraints
- Non-Euclidean restricted memory level method for large-scale convex optimization
- Numerical Optimization
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
- Numerical solution of a linear bilevel problem
- Numerical solution of bilinear programming problems
- On a continuous approach for the maximum weighted clique problem
- On a global search in D.C. optimization problems
- On computational search for Nash equilibrium in hexamatrix games
- On solving optimization problems with hidden nonconvex structures
- On the problem polyhedral separability: a numerical solution
- Solving quadratic convex bilevel programming problems using a smoothing method
- Steering exact penalty methods for nonlinear programming
- Three modeling paradigms in mathematical programming
Cited in
(12)- On the solution of convex bilevel optimization problems
- Numerical solution of a linear bilevel problem
- On solving bilevel optimization problems with a nonconvex lower level: the case of a bimatrix game
- The local and global searches in bilevel problems with a matrix game at the lower level
- Codifferentials and Quasidifferentials of the Expectation of Nonsmooth Random Integrands and Two-Stage Stochastic Programming
- A DC programming approach for a class of bilevel programming problems and its application in portfolio selection
- Connection of some bilevel and nonlinear optimization problems
- scientific article; zbMATH DE number 5176444 (Why is no real title available?)
- A DC algorithm for solving quadratic-linear bilevel optimization problems
- An online convex optimization-based framework for convex bilevel optimization
- Difference of convex algorithms for bilevel programs with applications in hyperparameter selection
- scientific article; zbMATH DE number 1375371 (Why is no real title available?)
This page was built for publication: On a solving bilevel d.c.-convex optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4965111)
