A complementarity-based partitioning and disjunctive cut algorithm for mathematical programming problems with equilibrium constraints
DOI10.1007/S10898-006-9001-8zbMATH Open1131.90061OpenAlexW2079384027MaRDI QIDQ857798FDOQ857798
Hanif D. Sherali, Ana M. Faustino, Joaquim J. Júdice, Isabel Martins Ribeiro
Publication date: 5 January 2007
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-006-9001-8
Recommendations
- Complementarity active-set algorithm for mathematical programming problems with equilibrium constraints
- A branch-and-bound method for discretely-constrained mathematical programs with equilibrium constraints
- A conjugate gradient projection algorithm for mathematical programs with equilibrium constraints
- Solving linear programs with complementarity constraints using branch-and-cut
- Methods for finding global optimal solutions to linear programs with equilibrium constraints
Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- Numerical Optimization
- A globally convergent sequential quadratic programming algorithm for mathematical programs with linear complementarity constraints
- New Branch-and-Bound Rules for Linear Bilevel Programming
- Mathematical Programs with Equilibrium Constraints
- A smoothing method for mathematical programs with equilibrium constraints
- A penalty function approach for solving bi-level linear programs
- A Branch and Bound Algorithm for the Bilevel Programming Problem
- On the Global Convergence of a Filter--SQP Algorithm
- Generating quadratic bilevel programming test problems
- Disjunctive Programming
- Hinging hyperplanes for regression, classification, and function approximation
- Complementarity active-set algorithm for mathematical programming problems with equilibrium constraints
- A sequential LCP method for bilevel linear programming
- On the solution of NP-hard linear complementarity problems
- Optimization with disjunctive constraints
- Smooth SQP Methods for Mathematical Programs with Nonlinear Complementarity Constraints
- On the hinge-finding algorithm for hingeing hyperplanes
- A computational analysis of LCP methods for bilinear and concave quadratic programming
- On the solution and complexity of a generalized linear complementarity problem
- Generating Linear and Linear-Quadratic Bilevel Programming Problems
- On finding global optima for the hinge fitting problem.
Cited In (19)
- On minimal valid inequalities for mixed integer conic programs
- Monoidal cut strengthening and generalized mixed-integer rounding for disjunctions and complementarity constraints
- A pivoting algorithm for linear programming with linear complementarity constraints
- A Conic Representation of the Convex Hull of Disjunctive Sets and Conic Cuts for Integer Second Order Cone Optimization
- Obtaining Tighter Relaxations of Mathematical Programs with Complementarity Constraints
- On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs
- On solving difference of convex functions programs with linear complementarity constraints
- Disjunctive Cuts for Nonconvex MINLP
- Sufficiency of cut-generating functions
- How to convexify the intersection of a second order cone and a nonconvex quadratic
- Optimal cycle for a signalized intersection using global optimization and complementarity
- Two-term disjunctions on the second-order cone
- SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs
- Monoidal strengthening of simple \(\mathcal{V} \)-polyhedral disjunctive cuts
- The eigenvalue complementarity problem
- Algorithms for linear programming with linear complementarity constraints
- Branch-and-cut for linear programs with overlapping SOS1 constraints
- Cutting planes from two-term disjunctions
- Methods for finding global optimal solutions to linear programs with equilibrium constraints
Uses Software
This page was built for publication: A complementarity-based partitioning and disjunctive cut algorithm for mathematical programming problems with equilibrium constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q857798)
