An LPCC approach to nonconvex quadratic programs
From MaRDI portal
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
Cites work
- scientific article; zbMATH DE number 1114003 (Why is no real title available?)
- scientific article; zbMATH DE number 1550909 (Why is no real title available?)
- scientific article; zbMATH DE number 221928 (Why is no real title available?)
- scientific article; zbMATH DE number 757677 (Why is no real title available?)
- scientific article; zbMATH DE number 3431982 (Why is no real title available?)
- A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- A polyhedral study of nonconvex quadratic programs with box constraints
- A symmetrical linear maxmin approach to disjoint bilinear programming
- A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems
- Active constraints, indefinite quadratic test problems, and complexity
- An integrated method for planning and scheduling to minimize tardiness
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Disjunctive Programming
- Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem
- Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound
- Logic-based Benders decomposition
- MINTO, a Mixed INTeger Optimizer
- On Quadratic Programming
- On linear programs with linear complementarity constraints
- On the Global Solution of Linear Programs with Linear Complementarity Constraints
- On the global minimization of the value-at-risk
- Optimality conditions for quadratic programming
- Quadratic programming with one negative eigenvalue is NP-hard
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
- Convexification techniques for linear complementarity constraints
- On linear programs with linear complementarity constraints
- Convex quadratic relaxations of nonconvex quadratically constrained quadratic programs
- 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
- Bounds tightening based on optimality conditions for nonconvex box-constrained optimization
- Domain reduction techniques for global NLP and MINLP 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
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)
