A clique algorithm for standard quadratic programming
From MaRDI portal
Publication:955308
DOI10.1016/j.dam.2007.09.020zbMath1163.90691OpenAlexW2012886081MaRDI QIDQ955308
Andrea Scozzari, Fabio Tardella
Publication date: 19 November 2008
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2007.09.020
Extremal problems in graph theory (05C35) Quadratic programming (90C20) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
New Analysis on Sparse Solutions to Random Standard Quadratic Optimization Problems and Extensions, Using SVM to combine global heuristics for the standard quadratic problem, Convex envelopes of separable functions over regions defined by separable functions of the same type, Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, On monotonicity and search strategies in face-based copositivity detection algorithms, A new method for mean-variance portfolio optimization with cardinality constraints, Sparse solutions to random standard quadratic optimization problems, On solving a non-convex quadratic programming problem involving resistance distances in graphs, Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2, Complex portfolio selection via convex mixed‐integer quadratic programming: a survey, Convex Envelopes of Some Quadratic Functions over the n-Dimensional Unit Simplex, Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques, On sparsity of the solution to a random quadratic optimization problem, The fundamental theorem of linear programming: extensions and applications, Solving Quadratic Programming by Cutting Planes, Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations, A new branch-and-bound algorithm for standard quadratic programming problems, ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations, Two-stage stochastic standard quadratic optimization, A study on sequential minimal optimization methods for standard quadratic problems, Linear vs. quadratic portfolio selection models with hard real-world constraints
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability
- On standard quadratic optimization problems
- A new semidefinite programming bound for indefinite quadratic forms over a simplex
- Global escape strategies for maximizing quadratic forms over a simplex
- A fast algorithm for the maximum clique problem
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- Improved SDP bounds for minimizing quadratic functions over the \(\ell^{1}\)-ball
- Quartic formulation of standard quadratic optimization problems
- On the equivalence between some discrete and continuous optimization problems
- Connections between continuous and combinatorial optimization problems through an extension of the fundamental theorem of Linear Programming
- Continuous Characterizations of the Maximum Clique Problem
- A Reflective Newton Method for Minimizing a Quadratic Function Subject to Bounds on Some of the Variables
- Maxima for Graphs and a New Proof of a Theorem of Turán
- On copositive programming and standard quadratic optimization problems
