DC programming techniques for solving a class of nonlinear bilevel programs
From MaRDI portal
Publication:839322
DOI10.1007/s10898-008-9325-7zbMath1180.90241OpenAlexW2112395820MaRDI QIDQ839322
Nguyen Van Thoai, Tao Pham Dinh, Hoai An Le Thi, Nam Nguyen Canh
Publication date: 2 September 2009
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-008-9325-7
DCAglobal optimizationnonconvex programmingbilevel programmingDC programmingbranch and bound techniques
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)
Related Items
Asymptotic regularity for Lipschitzian nonlinear optimization problems with applications to complementarity constrained and bilevel programming ⋮ Variations and extension of the convex-concave procedure ⋮ Unnamed Item ⋮ A DC Algorithm for Solving Quadratic-linear Bilevel Optimization Problems ⋮ On solving difference of convex functions programs with linear complementarity constraints ⋮ Open issues and recent advances in DC programming and DCA ⋮ Exact penalty and error bounds in DC programming ⋮ DC programming and DCA: thirty years of developments ⋮ BOLIB: Bilevel Optimization LIBrary of Test Problems ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
Cites Work
- Unnamed Item
- Unnamed Item
- Exact penalty and error bounds in DC programming
- Convex two-level optimization
- How to regularize a difference of convex functions
- Bilevel and multilevel programming: A bibliography review
- Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
- A global optimization method for solving convex quadratic bilevel programming problems
- Exact penalty in d. c. programming
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Global optimization method for solving mathematical programs with linear complementarity constraints
- Decomposition methods for solving a class of nonconvex programming problems dealing with bilinear and quadratic functions
- On bilevel programming. I: General nonlinear cases
- Decomposition branch and bound method for globally solving linearly constrained indefinite quadratic minimization problems
- Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints
- An algorithm for solving two-level convex optimization problems
- An Algorithm for Solving the General Bilevel Programming Problem
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- Large-Scale Molecular Optimization from Distance Matrices by a D.C. Optimization Approach
- On globally solving linearly constrained indefinite quadratic minimization problems by decomposition branch and bound method
- Convex Analysis
- Introduction to global optimization.
- Filled functions for unconstrained global optimization.
