On the Global Solution of Linear Programs with Linear Complementarity Constraints
From MaRDI portal
Publication:3608991
DOI10.1137/07068463XzbMATH Open1163.90031OpenAlexW2028042462MaRDI QIDQ3608991FDOQ3608991
Authors: Jing Hu, Jong-Shi Pang, Kristin P. Bennett, Gautam Kunapuli, John E. Mitchell 
Publication date: 6 March 2009
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/bc9bd2d2ceb3b8700a97ff130caca9061dcbfe2a
Recommendations
- An algorithm for global solution to bi-parametric linear complementarity constrained linear programs
- On linear programs with linear complementarity constraints
- Solving linear programs with complementarity constraints using branch-and-cut
- Algorithms for linear programming with linear complementarity constraints
- A globally convergent probability-one homotopy for linear programs with linear complementarity constraints
Nonconvex programming, global optimization (90C26) Integer programming (90C10) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cited In (43)
- Solving linear programs with complementarity constraints using branch-and-cut
- An SOS1-based approach for solving MPECs with a natural gas market application
- A pivoting algorithm for linear programming with linear complementarity constraints
- Lift-and-project for general two-term disjunctions
- Logic-Based Benders Decomposition for Large-Scale Optimization
- Branch-and-bound algorithms for the partial inverse mixed integer linear programming problem
- Conic approximation to quadratic optimization with linear complementarity constraints
- Obtaining Tighter Relaxations of Mathematical Programs with Complementarity Constraints
- A globally convergent approximately active search algorithm for solving mathematical programs with linear complementarity constraints
- Cardinality minimization, constraints, and regularization: a survey
- On conic QPCCs, conic QCQPs and completely positive programs
- Three modeling paradigms in mathematical programming
- Bilevel Linear Optimization Under Uncertainty
- A study of the difference-of-convex approach for solving linear programs with complementarity constraints
- Sequential Linearization Method for Bound-Constrained Mathematical Programs with Complementarity Constraints
- Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations
- Beyond canonical dc-optimization: the single reverse polar problem
- Solving discretely-constrained Nash-Cournot games with an application to power markets
- MPEC Methods for Bilevel Optimization Problems
- Relaxations and cutting planes for linear programs with complementarity constraints
- Implicit solution function of P\(_{0}\) and Z matrix linear complementarity constraints
- Basic theoretical foundations and insights on bilevel models and their applications to power systems
- An LPCC approach to nonconvex quadratic programs
- On linear problems with complementarity constraints
- How to convexify the intersection of a second order cone and a nonconvex quadratic
- Global resolution of the support vector machine regression parameters selection problem with LPCC
- Enhanced models and improved solution for competitive biofuel supply chain design under land use constraints
- Convexification techniques for linear complementarity constraints
- A branch-and-bound method for discretely-constrained mathematical programs with equilibrium constraints
- On linear programs with linear complementarity constraints
- A class of quadratic programs with linear complementarity constraints
- An algorithm for global solution to bi-parametric linear complementarity constrained linear programs
- Logic-based MultiObjective Optimization for Restoration Planning
- An enhanced logical benders approach for linear programs with complementarity constraints
- The Watermelon Algorithm for The Bilevel Integer Linear Programming Problem
- Algorithms for linear programming with linear complementarity constraints
- Solving linear optimization problems with max-star composition equation constraints
- A branch-and-bound algorithm for instrumental variable quantile regression
- Global optimization of mathematical programs with complementarity constraints and application to clean energy deployment
- On convex quadratic programs with linear complementarity constraints
- Branch-and-cut for linear programs with overlapping SOS1 constraints
- Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints
- Globally solving quadratic programs with convex objective and complementarity constraints via completely positive programming
This page was built for publication: On the Global Solution of Linear Programs with Linear Complementarity Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608991)
