An LPCC approach to nonconvex quadratic programs
From MaRDI portal
Publication:431005
DOI10.1007/S10107-010-0426-YzbMATH Open1244.90177OpenAlexW1972243042MaRDI QIDQ431005FDOQ431005
Authors: Jing Hu, John E. Mitchell, Jong-Shi Pang 
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
Recommendations
- A novel optimization method for nonconvex quadratically constrained quadratic programs
- Approximating non-convex quadratic programs by semidefinite and copositive programming
- Lagrangian approach to quasiconvex programing
- Convex quadratic relaxations of nonconvex quadratically constrained quadratic programs
- A relaxation method for nonconvex quadratically constrained quadratic programs
- New LP-based local and global algorithms for continuous and mixed-integer nonconvex quadratic programming
- A reformulation-convexification approach for solving nonconvex quadratic programming problems
- A global optimization approach for quadratic programs with nonconvex quadratic constraints
- An efficient method for non-convex QCQP problems
- scientific article; zbMATH DE number 569957
quadratic programminglinear programs with complementarity constraintslogical Benders decompositionLPECs
Quadratic programming (90C20) Nonconvex programming, global optimization (90C26) Integer programming (90C10) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- Logic-based Benders decomposition
- On the Global Solution of Linear Programs with Linear Complementarity Constraints
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Title not available (Why is that?)
- A polyhedral study of nonconvex quadratic programs with box constraints
- Disjunctive Programming
- Quadratic programming with one negative eigenvalue is NP-hard
- 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
- A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems
- Title not available (Why is that?)
- An integrated method for planning and scheduling to minimize tardiness
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem
- A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
- On linear programs with linear complementarity constraints
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
- MINTO, a Mixed INTeger Optimizer
- Active constraints, indefinite quadratic test problems, and complexity
- On the global minimization of the value-at-risk
- Optimality conditions for quadratic programming
- A symmetrical linear maxmin approach to disjoint bilinear programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On Quadratic Programming
- Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound
Cited In (24)
- Solving linear programs with complementarity constraints using branch-and-cut
- On the pervasiveness of difference-convexity in optimization and statistics
- On conic QPCCs, conic QCQPs and completely positive programs
- A study of the difference-of-convex approach for solving linear programs with complementarity constraints
- Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations
- A linear complementarity based characterization of the weighted independence number and the independent domination number in graphs
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
- Convex quadratic relaxations of nonconvex quadratically constrained quadratic programs
- Convexification techniques for linear complementarity constraints
- On linear programs with linear complementarity constraints
- Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations
- Skyport location problem for urban air mobility system
- An enhanced logical benders approach for linear programs with complementarity constraints
- Logic-based Benders decomposition for large-scale optimization
- Obtaining tighter relaxations of mathematical programs with complementarity constraints
- Algorithms for linear programming with linear complementarity constraints
- Domain reduction techniques for global NLP and MINLP optimization
- Bounds tightening based on optimality conditions for nonconvex box-constrained optimization
- Sparse solutions to random standard quadratic optimization problems
- On convex quadratic programs with linear complementarity constraints
- QPALM: a proximal augmented Lagrangian method for nonconvex quadratic programs
- Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints
- On independent cliques and linear complementarity problems
- Globally solving quadratic programs with convex objective and complementarity constraints via completely positive programming
Uses Software
This page was built for publication: An LPCC approach to nonconvex quadratic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q431005)
