On standard quadratic optimization problems
From MaRDI portal
Publication:1281478
DOI10.1023/A:1008369322970zbMath0916.90214OpenAlexW1481481825MaRDI QIDQ1281478
Publication date: 22 March 1999
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1008369322970
optimality conditionsquadratic optimizationportfolio selectionundirected graphsmaximum weight clique problemcontinuous reformulation
Related Items (68)
On the accuracy of uniform polyhedral approximations of the copositive cone ⋮ On standard quadratic programs with exact and inexact doubly nonnegative relaxations ⋮ New Analysis on Sparse Solutions to Random Standard Quadratic Optimization Problems and Extensions ⋮ Using SVM to combine global heuristics for the standard quadratic problem ⋮ Tightening a copositive relaxation for standard quadratic optimization problems ⋮ Multi-standard quadratic optimization: Interior point methods and cone programming reformulation ⋮ Fast Cluster Detection in Networks by First Order Optimization ⋮ Binary classification posed as a quadratically constrained quadratic programming and solved using particle swarm optimization ⋮ Fixed interval scheduling: models, applications, computational complexity and algorithms ⋮ A copositive formulation for the stability number of infinite graphs ⋮ A new method for mean-variance portfolio optimization with cardinality constraints ⋮ Solving cardinality constrained mean-variance portfolio problems via MILP ⋮ Generating irreducible copositive matrices using the stable set problem ⋮ Sparse solutions to random standard quadratic optimization problems ⋮ Strong duality and KKT conditions in nonconvex optimization with a single equality constraint and geometric constraint ⋮ Solidity indices for convex cones ⋮ Complex portfolio selection via convex mixed‐integer quadratic programming: a survey ⋮ Maximization of homogeneous polynomials over the simplex and the sphere: structure, stability, and generic behavior ⋮ Unconstrained formulation of standard quadratic optimization problems ⋮ Convex Envelopes of Some Quadratic Functions over the n-Dimensional Unit Simplex ⋮ Properties of two DC algorithms in quadratic programming ⋮ Copositive optimization -- recent developments and applications ⋮ A reformulation-linearization technique for optimization over simplices ⋮ New bounds for nonconvex quadratically constrained quadratic programming ⋮ On a solution method in indefinite quadratic programming under linear constraints ⋮ Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization ⋮ An improved algorithm to test copositivity ⋮ Standard bi-quadratic optimization problems and unconstrained polynomial reformulations ⋮ Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision ⋮ Linear convergence of a type of iterative sequences in nonconvex quadratic programming ⋮ New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability ⋮ 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 ⋮ Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017 ⋮ Solving Quadratic Programming by Cutting Planes ⋮ Two methods for the maximization of homogeneous polynomials over the simplex ⋮ Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations ⋮ A class of differential quadratic programming problems ⋮ Analysis of copositive optimization based linear programming bounds on standard quadratic optimization ⋮ Extensions of the standard quadratic optimization problem: strong duality, optimality, hidden convexity and S-lemma ⋮ A new branch-and-bound algorithm for standard quadratic programming problems ⋮ A clique algorithm for standard quadratic programming ⋮ Dominant-set clustering: a review ⋮ A first-order interior-point method for linearly constrained smooth optimization ⋮ On admissible efficient portfolio selection problem ⋮ Improving an upper bound on the stability number of a graph ⋮ Simple complexity from imitation games ⋮ Characterizing existence of minimizers and optimality to nonconvex quadratic integrals ⋮ A simplex like approach based on star sets for recognizing convex-\(QP\) adverse graphs ⋮ Copositivity tests based on the linear complementarity problem ⋮ A survey on graphs with convex quadratic stability number ⋮ Nonconvex homogeneous optimization: a general framework and optimality conditions of first and second-order ⋮ Game-theoretic models of moral and other-regarding agents (extended abstract) ⋮ Polyhedral properties of RLT relaxations of nonconvex quadratic programs and their implications on exact relaxations ⋮ The Complexity of Simple Models—A Study of Worst and Typical Hard Cases for the Standard Quadratic Optimization Problem ⋮ Unnamed Item ⋮ Globally Convergent Primal-Dual Active-Set Methods with Inexact Subproblem Solves ⋮ Trust Your Data or Not—StQP Remains StQP: Community Detection via Robust Standard Quadratic Optimization ⋮ Two-stage stochastic standard quadratic optimization ⋮ Optimal algorithms and intuitive explanations for Markowitz's portfolio selection model and Sharpe's ratio with no short-selling ⋮ On admissible efficient portfolio selection policy ⋮ A study on sequential minimal optimization methods for standard quadratic problems ⋮ Quartic formulation of standard quadratic optimization problems ⋮ Continuous cubic formulations for cluster detection problems in networks ⋮ Connections between continuous and combinatorial optimization problems through an extension of the fundamental theorem of Linear Programming ⋮ A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem ⋮ Linear vs. quadratic portfolio selection models with hard real-world constraints
This page was built for publication: On standard quadratic optimization problems
