Pages that link to "Item:Q2231320"
From MaRDI portal
The following pages link to Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations (Q2231320):
Displaying 14 items.
- Global solutions to folded concave penalized nonconvex learning (Q282459) (← links)
- Nonconvex quadratic reformulations and solvable conditions for mixed integer quadratic programming problems (Q656459) (← links)
- A new algorithm for concave quadratic programming (Q2010088) (← links)
- Computing mixed strategies equilibria in presence of switching costs by the solution of nonconvex QP problems (Q2044489) (← links)
- Two-stage stochastic standard quadratic optimization (Q2077956) (← links)
- A study on sequential minimal optimization methods for standard quadratic problems (Q2095525) (← links)
- On monotonicity and search strategies in face-based copositivity detection algorithms (Q2155140) (← links)
- Linear transformation based solution methods for non-convex mixed integer quadratic programs (Q2359405) (← links)
- Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques (Q5139846) (← links)
- (Global) optimization: historical notes and recent developments (Q6114910) (← links)
- Performance comparison of two recently proposed copositivity tests (Q6114943) (← links)
- Optimization of a quadratic programming problem over an Integer efficient set (Q6145182) (← links)
- Global Solutions of Nonconvex Standard Quadratic Programs via Mixed Integer Linear Programming Reformulations (Q6307716) (← links)
- On global solvability of a class of possibly nonconvex QCQP problems in Hilbert spaces (Q6648843) (← links)
