Matrix analysis
A hierarchy of relaxation between the continuous and convex hull representations
SIAM Journal on Discrete Mathematics
A collection of test problems for constrained global optimization algorithms
A collection of test problems for constrained global optimization algorithms
Hierarchical optimization: an introduction
Annals of Operations Research - Special issue on hierarchical optimization
A lift-and-project cutting plane algorithm for mixed 0-1 programs
Mathematical Programming: Series A and B
Computational Optimization and Applications - Special issue on computational optimization—a tribute to Olvi Mangasarian, part II
Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity
Mathematics of Operations Research
Enhancing RLT relaxations via a new class of semidefinite cuts
Journal of Global Optimization
Choosing Multiple Parameters for Support Vector Machines
Machine Learning
Nonconvex Quadratic Programs, Linear Complementarity Problems, and Integer Linear Programs
5th Conference on Optimization Techniques, Part 1
Operations Research
Lift-and-project for mixed 0-1 programming: recent progress
Discrete Applied Mathematics
Radius margin bounds for support vector machines with the RBF kernel
Neural Computation
A polyhedral study of nonconvex quadratic programs with box constraints
Mathematical Programming: Series A and B
A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
Mathematical Programming: Series A and B
Leave-One-Out Bounds for Support Vector Regression Model Selection
Neural Computation
A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
Mathematical Programming: Series A and B
On the Global Solution of Linear Programs with Linear Complementarity Constraints
SIAM Journal on Optimization
Classification model selection via bilevel programming
Optimization Methods & Software - Mathematical programming in data mining and machine learning
A smoothing Newton method for a type of inverse semi-definite quadratic programming problem
Journal of Computational and Applied Mathematics
Computational Optimization and Applications
Mathematical Programming: Series A and B - Series B - Special Issue: Combinatorial Optimization and Integer Programming
Is bilevel programming a special case of a mathematical program with complementarity constraints?
Mathematical Programming: Series A and B
Nonconvex, lower semicontinuous piecewise linear optimization
Discrete Optimization
Models for representing piecewise linear cost functions
Operations Research Letters
Inverse conic programming with applications
Operations Research Letters
Convexification techniques for linear complementarity constraints
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
On convex quadratic programs with linear complementarity constraints
Computational Optimization and Applications
| Hi-index | 0.00 |
The paper is a manifestation of the fundamental importance of the linear program with linear complementarity constraints (LPCC) in disjunctive and hierarchical programming as well as in some novel paradigms of mathematical programming. In addition to providing a unified framework for bilevel and inverse linear optimization, nonconvex piecewise linear programming, indefinite quadratic programs, quantile minimization, and 驴 0 minimization, the LPCC provides a gateway to a mathematical program with equilibrium constraints, which itself is an important class of constrained optimization problems that has broad applications. We describe several approaches for the global resolution of the LPCC, including a logical Benders approach that can be applied to problems that may be infeasible or unbounded.