A pivoting algorithm for linear programming with linear complementarity constraints
From MaRDI portal
Publication:2885465
DOI10.1080/10556788.2010.512956zbMath1311.90152OpenAlexW2091988699MaRDI QIDQ2885465
Sven Leyffer, Haw-Ren Fang, Todd S. Munson
Publication date: 23 May 2012
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2010.512956
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Extreme-point and pivoting methods (90C49) Numerical methods for variational inequalities and related problems (65K15)
Related Items
Computational approaches for mixed integer optimal control problems with indicator constraints, Feasibility problems with complementarity constraints, Algorithms for linear programming with linear complementarity constraints, A study of the difference-of-convex approach for solving linear programs with complementarity constraints, Solving linear programs with complementarity constraints using branch-and-cut, Solutions of fuzzy LR algebraic linear systems using linear programs, MPEC Methods for Bilevel Optimization Problems, Sequential Linearization Method for Bound-Constrained Mathematical Programs with Complementarity Constraints
Uses Software
Cites Work
- Unnamed Item
- Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints
- Interior-point algorithms, penalty methods and equilibrium problems
- A complementarity-based partitioning and disjunctive cut algorithm for mathematical programming problems with equilibrium constraints
- Elastic-mode algorithms for mathematical programs with equilibrium constraints: global convergence and stationarity properties
- A sequential LCP method for bilevel linear programming
- A modified simplex approach for solving bilevel linear programming problems
- Complementarity constraint qualifications and simplified \(B\)-stationary conditions for mathematical programs with equilibrium constraints
- A smoothing method for mathematical programs with equilibrium constraints
- Links between linear bilevel and mixed 0-1 programming problems
- A note on a modified simplex approach for solving bilevel linear programming problems
- New branch-and-Cut algorithm for bilevel linear programming
- Complementarity active-set algorithm for mathematical programming problems with equilibrium constraints
- Convergence Properties of a Regularization Scheme for Mathematical Programs with Complementarity Constraints
- Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity
- An Implementable Active-Set Algorithm for Computing a B-Stationary Point of a Mathematical Program with Linear Complementarity Constraints
- Complementarity constraints as nonlinear equations: Theory and numerical experience
- A Branch and Bound Algorithm for the Bilevel Programming Problem
- On the Global Solution of Linear Programs with Linear Complementarity Constraints
- On the Abadie and Guignard constraint qualifications for Mathematical Programmes with Vanishing Constraints
- Stable modification of explicitLU factors for simplex updates
- A practicable steepest-edge simplex algorithm
- New Branch-and-Bound Rules for Linear Bilevel Programming
- Smooth SQP Methods for Mathematical Programs with Nonlinear Complementarity Constraints
- Solving mathematical programs with complementarity constraints as nonlinear programs
- Optimality Conditions for Optimization Problems with Complementarity Constraints
- Expressing Complementarity Problems in an Algebraic Modeling Language and Communicating Them to Solvers
- Technical Note—The Use of Cuts in Complementary Programming
- On Using the Elastic Mode in Nonlinear Programming Approaches to Mathematical Programs with Complementarity Constraints
- Optimality Measures for Performance Profiles
- Interior Methods for Mathematical Programs with Complementarity Constraints
- Local Convergence of SQP Methods for Mathematical Programs with Equilibrium Constraints
- The simplex method of linear programming using LU decomposition
- Technical Note—Complementary Programming
- The penalty interior-point method fails to converge
- Benchmarking optimization software with performance profiles.
