On linear programs with linear complementarity constraints
From MaRDI portal
Publication:452341
DOI10.1007/s10898-010-9644-3zbMath1254.90111OpenAlexW2131524354MaRDI QIDQ452341
Jing Hu, Jong-Shi Pang, Bin Yu, John E. Mitchell
Publication date: 20 September 2012
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-010-9644-3
cross-validated support vector regressionhierarchical programminginverse programminglinear programs with linear complementarity constraintspiecewise linear programmingquantile minimization
Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
Optimization-free robust MPC around the terminal region, On convex quadratic programs with linear complementarity constraints, Obtaining Tighter Relaxations of Mathematical Programs with Complementarity Constraints, Enhanced models and improved solution for competitive biofuel supply chain design under land use constraints, Branch-and-cut for linear programs with overlapping SOS1 constraints, Three modeling paradigms in mathematical programming, The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints, A Computational Algorithm for Equilibrium Asset Pricing Under Heterogeneous Information and Short-Sale Constraints, On solving difference of convex functions programs with linear complementarity constraints, An LPCC approach to nonconvex quadratic programs, Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints, Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques, A new mixed integer programming approach for optimization over the efficient set of a multiobjective linear programming problem, A projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs, Convexification Techniques for Linear Complementarity Constraints, A study of the difference-of-convex approach for solving linear programs with complementarity constraints, Computing equilibrium prices for a capital asset pricing model with heterogeneous beliefs and margin-requirement constraints, A linear complementarity based characterization of the weighted independence number and the independent domination number in graphs, Convex quadratic relaxations of nonconvex quadratically constrained quadratic programs, Nonconvex robust programming via value-function optimization, Solving linear programs with complementarity constraints using branch-and-cut, A non-probabilistic methodology for reliable sustainability planning: an application to the Iraqi national irrigation system, Convexification techniques for linear complementarity constraints, Risk-Averse Models in Bilevel Stochastic Linear Programming, An enhanced logical benders approach for linear programs with complementarity constraints, On independent cliques and linear complementarity problems, MPEC Methods for Bilevel Optimization Problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An LPCC approach to nonconvex quadratic programs
- Enhancing RLT relaxations via a new class of semidefinite cuts
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
- Is bilevel programming a special case of a mathematical program with complementarity constraints?
- Lift-and-project for mixed 0-1 programming: recent progress
- Positive definite completions of partial Hermitian matrices
- Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound
- Nonconvex, lower semicontinuous piecewise linear optimization
- A smoothing Newton method for a type of inverse semi-definite quadratic programming problem
- An augmented Lagrangian method for a class of Inverse quadratic programming problems
- Hierarchical optimization: An introduction
- A collection of test problems for constrained global optimization algorithms
- Complementarity constraint qualifications and simplified \(B\)-stationary conditions for mathematical programs with equilibrium constraints
- Handbook of test problems in local and global optimization
- A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming
- Models for representing piecewise linear cost functions
- Foundations of bilevel programming
- A polyhedral study of nonconvex quadratic programs with box constraints
- A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
- Inverse conic programming with applications
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- New branch-and-Cut algorithm for bilevel linear programming
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- An overview of bilevel optimization
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
- Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity
- Linear Programming Relaxations of Quadratically Constrained Quadratic Programs
- Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- A unifying framework for several cutting plane methods for semidefinite programming
- A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization
- On the Global Solution of Linear Programs with Linear Complementarity Constraints
- Inverse Optimization
- Matrix Analysis
- Cones of Matrices and Set-Functions and 0–1 Optimization
- On the global minimization of the value-at-risk
- Leave-One-Out Bounds for Support Vector Regression Model Selection
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Radius Margin Bounds for Support Vector Machines with the RBF Kernel
- Classification model selection via bilevel programming
- Intersection Cuts—A New Type of Cutting Planes for Integer Programming
- Introduction to global optimization.
- Choosing multiple parameters for support vector machines
