Algorithms for linear programming with linear complementarity constraints
From MaRDI portal
Publication:1935876
Recommendations
- On linear programs with linear complementarity constraints
- On the Global Solution of Linear Programs with Linear Complementarity Constraints
- Solving linear programs with complementarity constraints using branch-and-cut
- scientific article; zbMATH DE number 778140
- A study of the difference-of-convex approach for solving linear programs with complementarity constraints
Cites work
- A Branch and Bound Algorithm for the Bilevel Programming Problem
- A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
- A complementarity-based partitioning and disjunctive cut algorithm for mathematical programming problems with equilibrium constraints
- A computational analysis of LCP methods for bilinear and concave quadratic programming
- A computational study of global algorithms for linear bilevel programming
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- A Fully Polynomial-Time Approximation Algorithm for Computing a Stationary Point of the General Linear Complementarity Problem
- A globally convergent sequential quadratic programming algorithm for mathematical programs with linear complementarity constraints
- A pivoting algorithm for linear programming with linear complementarity constraints
- A sequential LCP method for bilevel linear programming
- A smoothing method for mathematical programs with equilibrium constraints
- A symmetrical linear maxmin approach to disjoint bilinear programming
- Absolute value programming
- An experimental investigation of enumerative methods for the linear complementarity problem
- An implementable active-set algorithm for computing a B-stationary point of a mathematical program with linear complementarity constraints
- An implicit enumeration procedure for the general linear complementarity problem
- An LPCC approach to nonconvex quadratic programs
- Bilevel programming: a survey
- Complementarity active-set algorithm for mathematical programming problems with equilibrium constraints
- Complementarity constraint qualifications and simplified \(B\)-stationary conditions for mathematical programs with equilibrium constraints
- Convergence properties of a regularization scheme for mathematical programs with complementarity constraints
- Cutting-Planes for Complementarity Constraints
- Elastic-mode algorithms for mathematical programs with equilibrium constraints: global convergence and stationarity properties
- Enumeration approach for linear complementarity problems based on a reformulation-linearization technique
- Extension of quasi-Newton methods to mathematical programs with complementarity con\-straints
- Foundations of bilevel programming
- Global optimization of mixed-integer bilevel programming problems
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- scientific article; zbMATH DE number 53115 (Why is no real title available?)
- scientific article; zbMATH DE number 192986 (Why is no real title available?)
- scientific article; zbMATH DE number 3523317 (Why is no real title available?)
- scientific article; zbMATH DE number 3793774 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- Interior Methods for Mathematical Programs with Complementarity Constraints
- Interior-point algorithms, penalty methods and equilibrium problems
- Local Convergence of SQP Methods for Mathematical Programs with Equilibrium Constraints
- Mathematical programs with complementarity constraints: stationarity, optimality, and sensi\-tivity.
- Mathematical Programs with Equilibrium Constraints
- Mathematical programs with equilibrium constraints: automatic reformulation and solution via constrained optimization
- Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints
- New Branch-and-Bound Rules for Linear Bilevel Programming
- New branch-and-Cut algorithm for bilevel linear programming
- Nonlinear Programming
- Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
- On solving linear complementarity problems by DC programming and DCA
- On the Global Solution of Linear Programs with Linear Complementarity Constraints
- On the solution and complexity of a generalized linear complementarity problem
- On Using the Elastic Mode in Nonlinear Programming Approaches to Mathematical Programs with Complementarity Constraints
- Optimality Conditions for Optimization Problems with Complementarity Constraints
- Practical bilevel optimization. Algorithms and applications
- Smooth SQP Methods for Mathematical Programs with Nonlinear Complementarity Constraints
- Solution of a general linear complementarity problem using smooth optimization and its application to bilinear programming and LCP
- Solving mathematical programs with complementarity constraints as nonlinear programs
- Technical Note—Complementary Programming
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- The linear complementarity problem as a separable bilinear program
- The Linear-Quadratic Bilevel Programming Problem
Cited in
(19)- Linear programs for constraint satisfaction problems
- A study of the difference-of-convex approach for solving linear programs with complementarity constraints
- Comments on: Algorithms for linear programming with linear complementarity constraints
- New characterizations of Hoffman constants for systems of linear constraints
- Bilevel hyperparameter optimization for support vector classification: theoretical analysis and a solution method
- Solving linear programs with complementarity constraints using branch-and-cut
- An algorithm for global solution to bi-parametric linear complementarity constrained linear programs
- Conic approximation to quadratic optimization with linear complementarity constraints
- Computer-based algorithms for multiple criteria and multiple constraint level integer linear programming
- A pivoting algorithm for linear programming with linear complementarity constraints
- A computational study for bilevel quadratic programs using semidefinite relaxations
- On the Global Solution of Linear Programs with Linear Complementarity Constraints
- scientific article; zbMATH DE number 3918118 (Why is no real title available?)
- scientific article; zbMATH DE number 3987051 (Why is no real title available?)
- ALPO: Another Linear Program Optimizer
- On linear programs with linear complementarity constraints
- A Finite Algorithm for Almost Linear Complementarity Problems
- Comments on: Algorithms for linear programming with linear complementarity constraints
- Enumeration-based approach to solving parametric linear complementarity problems
This page was built for publication: Algorithms for linear programming with linear complementarity constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1935876)
