On a solving bilevel d.c.-convex optimization problems

DOI10.1007/978-3-030-58657-7_16zbMATH Open1460.90146OpenAlexW3084507921MaRDI QIDQ4965111FDOQ4965111

Publication date: 25 February 2021

Published in: Mathematical Optimization Theory and Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-58657-7_16

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

zbMATH Keywords

local search bilevel optimization difference of two convex functions reduction theorem d.c. optimization global search theory optimistic solution exact penalty theory KKT-approach

Mathematics Subject Classification ID

Convex programming (90C25) Nonconvex programming, global optimization (90C26)

Cites Work

Numerical optimization. Theoretical and practical aspects. Transl. from the French
Numerical Optimization
DC programming: overview.
Title not available (Why is that?)
A global optimization method for solving convex quadratic bilevel programming problems
Global optimization with non-convex constraints. Sequential and parallel algorithms
Foundations of bilevel programming
An overview of bilevel optimization
A trust-region method for nonlinear bilevel programming: algorithm and computational exper\-ience
Title not available (Why is that?)
Mathematical Programs with Equilibrium Constraints
Solving quadratic convex bilevel programming problems using a smoothing method
Non-Euclidean restricted memory level method for large-scale convex optimization
Title not available (Why is that?)
Bilevel programming problems. Theory, algorithms and applications to energy networks
Global optimization of nonlinear bilevel programming problems
Is bilevel programming a special case of a mathematical program with complementarity constraints?
On the problem polyhedral separability: a numerical solution
On solving optimization problems with hidden nonconvex structures
Title not available (Why is that?)
Three modeling paradigms in mathematical programming
A line search exact penalty method using steering rules
On a global search in D.C. optimization problems
Title not available (Why is that?)
On a continuous approach for the maximum weighted clique problem
Steering exact penalty methods for nonlinear programming
Numerical solution of a linear bilevel problem
A computational study of global algorithms for linear bilevel programming
Title not available (Why is that?)
Bilevel Programming
Numerical solution of bilinear programming problems
Global optimality conditions and exact penalization
Global search for bilevel optimization with quadratic data
On computational search for Nash equilibrium in hexamatrix games

Cited In (12)

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
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
Title not available (Why is that?)
A DC algorithm for solving quadratic-linear bilevel optimization problems
Connection of some bilevel and nonlinear optimization problems
An online convex optimization-based framework for convex bilevel optimization
Difference of convex algorithms for bilevel programs with applications in hyperparameter selection
Title not available (Why is that?)

Uses Software

PLCP
SQPlab

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)