A complementarity-based partitioning and disjunctive cut algorithm for mathematical programming problems with equilibrium constraints

DOI10.1007/s10898-006-9001-8zbMath1131.90061OpenAlexW2079384027MaRDI QIDQ857798

Hanif D. Sherali, Ana M. Faustino, Joaquim Joao 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

zbMATH Keywords

global optimizationcomplementaritybranch-and-bound methoddisjunctive cutsactive-set algorithm

Mathematics Subject Classification ID

Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items

A pivoting algorithm for linear programming with linear complementarity constraints, Disjunctive Cuts for Nonconvex MINLP, Obtaining Tighter Relaxations of Mathematical Programs with Complementarity Constraints, A Conic Representation of the Convex Hull of Disjunctive Sets and Conic Cuts for Integer Second Order Cone Optimization, Branch-and-cut for linear programs with overlapping SOS1 constraints, The eigenvalue complementarity problem, SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs, Algorithms for linear programming with linear complementarity constraints, Monoidal strengthening of simple \(\mathcal{V} \)-polyhedral disjunctive cuts, Two-term disjunctions on the second-order cone, Optimal cycle for a signalized intersection using global optimization and complementarity, On solving difference of convex functions programs with linear complementarity constraints, Cutting planes from two-term disjunctions, Monoidal cut strengthening and generalized mixed-integer rounding for disjunctions and complementarity constraints, Sufficiency of cut-generating functions, How to convexify the intersection of a second order cone and a nonconvex quadratic, On Minimal Valid Inequalities for Mixed Integer Conic Programs

Uses Software

• MINOS

Cites Work

• On the solution of NP-hard linear complementarity problems
• Optimization with disjunctive constraints
• A computational analysis of LCP methods for bilinear and concave quadratic programming
• A sequential LCP method for bilevel linear programming
• A smoothing method for mathematical programs with equilibrium constraints
• A penalty function approach for solving bi-level linear programs
• On the solution and complexity of a generalized linear complementarity problem
• A globally convergent sequential quadratic programming algorithm for mathematical programs with linear complementarity constraints
• On finding global optima for the hinge fitting problem.
• Complementarity active-set algorithm for mathematical programming problems with equilibrium constraints
• Generating Linear and Linear-Quadratic Bilevel Programming Problems
• A Branch and Bound Algorithm for the Bilevel Programming Problem
• New Branch-and-Bound Rules for Linear Bilevel Programming
• Disjunctive Programming
• Numerical Optimization
• Hinging hyperplanes for regression, classification, and function approximation
• Generating quadratic bilevel programming test problems
• On the hinge-finding algorithm for hingeing hyperplanes
• Smooth SQP Methods for Mathematical Programs with Nonlinear Complementarity Constraints
• On the Global Convergence of a Filter--SQP Algorithm
• Mathematical Programs with Equilibrium Constraints