An LPCC approach to nonconvex quadratic programs
From MaRDI portal
Publication:431005
DOI10.1007/s10107-010-0426-yzbMath1244.90177OpenAlexW1972243042MaRDI QIDQ431005
John E. Mitchell, Jong-Shi Pang, Jing Hu
Publication date: 26 June 2012
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-010-0426-y
quadratic programminglinear programs with complementarity constraintslogical Benders decompositionLPECs
Integer programming (90C10) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
On convex quadratic programs with linear complementarity constraints, Obtaining Tighter Relaxations of Mathematical Programs with Complementarity Constraints, On conic QPCCs, conic QCQPs and completely positive programs, Sparse solutions to random standard quadratic optimization problems, Skyport location problem for urban air mobility system, Algorithms for linear programming with linear complementarity constraints, Domain reduction techniques for global NLP and MINLP optimization, Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization, On linear programs with linear complementarity constraints, Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints, Logic-Based Benders Decomposition for Large-Scale Optimization, Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations, On the pervasiveness of difference-convexity in optimization and statistics, Bounds tightening based on optimality conditions for nonconvex box-constrained optimization, A study of the difference-of-convex approach for solving linear programs with complementarity 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, Solving linear programs with complementarity constraints using branch-and-cut, Convexification techniques for linear complementarity constraints, An enhanced logical benders approach for linear programs with complementarity constraints, On independent cliques and linear complementarity problems
Uses Software
Cites Work
- On linear programs with linear complementarity constraints
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
- Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound
- An integrated method for planning and scheduling to minimize tardiness
- Active constraints, indefinite quadratic test problems, and complexity
- Quadratic programming with one negative eigenvalue is NP-hard
- A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems
- MINTO, a Mixed INTeger Optimizer
- Logic-based Benders decomposition
- A symmetrical linear maxmin approach to disjoint bilinear programming
- A polyhedral study of nonconvex quadratic programs with box constraints
- A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- On the Global Solution of Linear Programs with Linear Complementarity Constraints
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem
- Disjunctive Programming
- On the global minimization of the value-at-risk
- On Quadratic Programming
- Optimality conditions for quadratic programming
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
