Algorithms for linear programming with linear complementarity constraints
From MaRDI portal
Publication:1935876
DOI10.1007/s11750-011-0228-2zbMath1267.90108OpenAlexW2043610587MaRDI QIDQ1935876
Publication date: 20 February 2013
Published in: Top (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11750-011-0228-2
global optimizationnonlinear programmingcomplementarity problemsmathematical programming with linear complementarity constraints
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
A computational study for bilevel quadratic programs using semidefinite relaxations, Conic approximation to quadratic optimization with linear complementarity constraints, Enumeration-based approach to solving parametric linear complementarity problems, A study of the difference-of-convex approach for solving linear programs with complementarity constraints, New characterizations of Hoffman constants for systems of linear constraints, Solving linear programs with complementarity constraints using branch-and-cut, Bilevel hyperparameter optimization for support vector classification: theoretical analysis and a solution method
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On solving linear complementarity problems by DC programming and DCA
- An LPCC approach to nonconvex quadratic programs
- Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints
- A computational study of global algorithms for linear bilevel programming
- Bilevel programming: a survey
- 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
- Absolute value programming
- An experimental investigation of enumerative methods for the linear complementarity problem
- A computational analysis of LCP methods for bilinear and concave quadratic programming
- A sequential LCP method for bilevel linear programming
- Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
- Enumeration approach for linear complementarity problems based on a reformulation-linearization technique
- Complementarity constraint qualifications and simplified \(B\)-stationary conditions for mathematical programs with equilibrium constraints
- A smoothing method for mathematical programs with equilibrium constraints
- Practical bilevel optimization. Algorithms and applications
- 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
- A symmetrical linear maxmin approach to disjoint bilinear programming
- Foundations of bilevel programming
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
- The linear complementarity problem as a separable bilinear program
- Extension of quasi-Newton methods to mathematical programs with complementarity con\-straints
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- New branch-and-Cut algorithm for bilevel linear programming
- Complementarity active-set algorithm for mathematical programming problems with equilibrium constraints
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- Global optimization of mixed-integer bilevel programming problems
- 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
- A pivoting algorithm for linear programming with linear complementarity constraints
- A Branch and Bound Algorithm for the Bilevel Programming Problem
- On the Global Solution of Linear Programs with Linear Complementarity Constraints
- An implicit enumeration procedure for the general linear complementarity problem
- New Branch-and-Bound Rules for Linear Bilevel Programming
- Cutting-Planes for Complementarity Constraints
- The Linear-Quadratic Bilevel Programming Problem
- 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
- A Fully Polynomial-Time Approximation Algorithm for Computing a Stationary Point of the General Linear Complementarity Problem
- On Using the Elastic Mode in Nonlinear Programming Approaches to Mathematical Programs with Complementarity Constraints
- Interior Methods for Mathematical Programs with Complementarity Constraints
- Local Convergence of SQP Methods for Mathematical Programs with Equilibrium Constraints
- Nonlinear Programming
- Technical Note—Complementary Programming
- Mathematical Programs with Equilibrium Constraints
- Solution of a general linear complementarity problem using smooth optimization and its application to bilinear programming and LCP
