Pages that link to "Item:Q955308"
From MaRDI portal
The following pages link to A clique algorithm for standard quadratic programming (Q955308):
Displaying 26 items.
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
- Sparse solutions to random standard quadratic optimization problems (Q378104) (← links)
- On standard quadratic optimization problems (Q1281478) (← links)
- Convex envelopes of separable functions over regions defined by separable functions of the same type (Q1634777) (← links)
- Genetic engineering via negative fitness: Evolutionary dynamics for global optimization (Q1808159) (← links)
- Unconstrained formulation of standard quadratic optimization problems (Q1935878) (← 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)
- On solving a non-convex quadratic programming problem involving resistance distances in graphs (Q2177791) (← links)
- On sparsity of the solution to a random quadratic optimization problem (Q2227539) (← links)
- Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations (Q2231320) (← links)
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations (Q2250093) (← links)
- The clique problem for graphs with a few eigenvalues of the same sign (Q2355311) (← links)
- Linear vs. quadratic portfolio selection models with hard real-world constraints (Q2355713) (← links)
- A new method for mean-variance portfolio optimization with cardinality constraints (Q2393351) (← links)
- Quartic formulation of standard quadratic optimization problems (Q2576445) (← links)
- Using SVM to combine global heuristics for the standard quadratic problem (Q2629704) (← links)
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2 (Q2943816) (← links)
- Convex Envelopes of Some Quadratic Functions over the n-Dimensional Unit Simplex (Q2954391) (← links)
- The fundamental theorem of linear programming: extensions and applications (Q2996803) (← links)
- New Analysis on Sparse Solutions to Random Standard Quadratic Optimization Problems and Extensions (Q3449456) (← links)
- Solving Quadratic Programming by Cutting Planes (Q4634098) (← links)
- A new branch-and-bound algorithm for standard quadratic programming problems (Q4646674) (← links)
- Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques (Q5139846) (← links)
- Complex portfolio selection via convex mixed‐integer quadratic programming: a survey (Q6070970) (← links)
