A branch-and-bound algorithm for instrumental variable quantile regression
From MaRDI portal
Publication:1697970
DOI10.1007/s12532-017-0117-2zbMath1387.90178OpenAlexW2570245413MaRDI QIDQ1697970
Publication date: 21 February 2018
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12532-017-0117-2
Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Instrumental variable quantile regression: a robust inference approach
- A new branch and bound algorithm for solving quadratic programs with linear complementarity constraints
- Inverse sorting problem by minimizing the total weighted number of changes and partial inverse sorting problems
- A new reformulation-linearization technique for bilinear programming problems
- A polyhedral study of nonconvex quadratic programs with box constraints
- Inverse combinatorial optimization: a survey on problems, methods, and results
- Boundary value problems for second order integro-differential equations of Fredholm type
- An algorithm for global solution to bi-parametric linear complementarity constrained linear programs
- On convex quadratic programs with linear complementarity constraints
- The partial inverse minimum spanning tree problem when weight increase is forbidden
- New branch-and-Cut algorithm for bilevel linear programming
- Partial inverse assignment problems under \(l_{1}\) norm
- Complexity of Partial Inverse Assignment Problem and Partial Inverse Cut Problem
- Sparse Models and Methods for Optimal Instruments With an Application to Eminent Domain
- A practical approach to approximate bilinear functions in mathematical programming problems by using Schur's decomposition and SOS type 2 variables
- Obtaining Tighter Relaxations of Mathematical Programs with Complementarity Constraints
- On the Global Solution of Linear Programs with Linear Complementarity Constraints
- Inverse Optimization
- Practical Solution of Large Mixed Integer Programming Problems with Umpire
- Parallel Branch-and-Bound Algorithms for General Mixed Integer Programming on the CM-5
- Nonparametric Instrumental Variables Estimation of a Quantile Regression Model
- THE BEST LEAST ABSOLUTE DEVIATIONS LINE – PROPERTIES AND TWO EFFICIENT METHODS FOR ITS DERIVATION
