On Cones of Nonnegative Quadratic Functions
From MaRDI portal
Publication:5704124
DOI10.1287/moor.28.2.246.14485zbMath1082.90086OpenAlexW2110540077MaRDI QIDQ5704124
Publication date: 11 November 2005
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.28.2.246.14485
semidefinite programminglinear matrix inequalityS-procedurematrix decompositionquadratic functionsco-positive cones
Semidefinite programming (90C22) Quadratic programming (90C20) Set-valued and variational analysis (49J53)
Related Items
An efficient algorithm for the extended trust-region subproblem with two linear constraints, A tensor analogy of Yuan's theorem of the alternative and polynomial optimization with sign structure, On box-constrained total least squares problem, On the tightness of SDP relaxations of QCQPs, Distributionally robust mixed integer linear programs: persistency models with applications, A necessary and sufficient condition of convexity for SOC reformulation of trust-region subproblem with two intersecting cuts, A linear-time algorithm for trust region problems, Convex envelopes of separable functions over regions defined by separable functions of the same type, A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming, On conic QPCCs, conic QCQPs and completely positive programs, Exactness conditions for an SDP relaxation of the extended trust region problem, SOCP reformulation for the generalized trust region subproblem via a canonical form of two symmetric matrices, On the copositive representation of binary and continuous nonconvex quadratic programs, A note on semidefinite programming relaxations for polynomial optimization over a single sphere, Generalized S-lemma and strong duality in nonconvex quadratic programming, A fast eigenvalue approach for solving the trust region subproblem with an additional linear inequality, An efficient algorithm for solving the generalized trust region subproblem, Conic approximation to quadratic optimization with linear complementarity constraints, Quadratic programs with hollows, Refined bounds on the convergence of block Lanczos method for extended trust-region subproblem, On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets, Distributionally robust profit opportunities, Interplay of non-convex quadratically constrained problems with adjustable robust optimization, Necessary and sufficient conditions for \(S\)-lemma and~nonconvex quadratic optimization, A survey of hidden convex optimization, Lyapunov stability for piecewise affine systems via cone-copositivity, Exact computable representation of some second-order cone constrained quadratic programming problems, A primal barrier function phase I algorithm for nonsymmetric conic optimization problems, A branch and bound algorithm for nonconvex quadratic optimization with ball and linear constraints, Strong duality and KKT conditions in nonconvex optimization with a single equality constraint and geometric constraint, Toward nonquadratic S-lemma: new theory and application in nonconvex optimization, On the quadratic fractional optimization with a strictly convex quadratic constraint, Minimizing the sum of linear fractional functions over the cone of positive semidefinite matrices: approximation and applications, Exact two steps SOCP/SDP formulation for a modified conic trust region subproblem, A piecewise ellipsoidal reachable set estimation method for continuous bimodal piecewise affine systems, Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs, Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints, Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization, Cardinality constrained portfolio selection problem: a completely positive programming approach, Separation and relaxation for cones of quadratic forms, Strengthened SDP relaxation for an extended trust region subproblem with an application to optimal power flow, Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization, Subspace choices for the Celis-Dennis-Tapia problem, On New Classes of Nonnegative Symmetric Tensors, Kronecker Product Constraints with an Application to the Two-Trust-Region Subproblem, Unbounded convex sets for non-convex mixed-integer quadratic programming, Hidden conic quadratic representation of some nonconvex quadratic optimization problems, Representing quadratically constrained quadratic programs as generalized copositive programs, Second order optimality conditions and reformulations for nonconvex quadratically constrained quadratic programming problems, Quadratic optimization over one first-order cone, Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation, On approximatingD-induced polar sets of geometric and extended geometric cones, On approximating D-induced polar sets of a second-order cone by an ellipsoid, Alternating direction method for bi-quadratic programming, Complexity and nonlinear semidefinite programming reformulation of \(\ell_1\)-constrained nonconvex quadratic optimization, A \({\mathsf{D}}\)-induced duality and its applications, On the indefinite quadratic fractional optimization with two quadratic constraints, Robust portfolio selection based on a multi-stage scenario tree, Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017, Globally solving extended trust region subproblems with two intersecting cuts, Exploiting equalities in polynomial programming, Quadratic optimization over a second-order cone with linear equality constraints, Extensions of the standard quadratic optimization problem: strong duality, optimality, hidden convexity and S-lemma, A low-dimensional SDP relaxation based spatial branch and bound method for nonconvex quadratic programs, An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints, An efficient global optimization algorithm for maximizing the sum of two generalized Rayleigh quotients, Approximation bounds for quadratic maximization and max-cut problems with semidefinite programming relaxation, On cones of nonnegative quartic forms, Duality and solutions for quadratic programming over single non-homogeneous quadratic constraint, Theorems of the alternative for inequality systems of real polynomials, New results on Hermitian matrix rank-one decomposition, A new algorithm for concave quadratic programming, Conic approximation to nonconvex quadratic programming with convex quadratic constraints, Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming, Successive Lagrangian relaxation algorithm for nonconvex quadratic optimization, Improved semidefinite approximation bounds for nonconvex nonhomogeneous quadratic optimization with ellipsoid constraints, Some results for quadratic problems with one or two quadratic constraints, Maximizing perturbation radii for robust convex quadratically constrained quadratic programs, An SOCP relaxation based branch-and-bound method for generalized trust-region subproblem, A data-driven distributionally robust bound on the expected optimal value of uncertain mixed 0-1 linear programming, Exactness of sums of squares relaxations involving \(3\times 3\) matrices and Lorentz cones, On solving quadratically constrained quadratic programming problem with one non-convex constraint, A Two-Variable Approach to the Two-Trust-Region Subproblem, On the global optimality of generalized trust region subproblems, A new conic approach to semisupervised support vector machines, LMI relaxations in robust control, Copositive Programming, The trust region subproblem with non-intersecting linear constraints, Quadratic optimization over a polyhedral cone, Strong duality in minimizing a quadratic form subject to two homogeneous quadratic inequalities over the unit sphere, Simultaneous Diagonalization of Matrices and Its Applications in Quadratically Constrained Quadratic Programming, Solving Generalized CDT Problems via Two-Parameter Eigenvalues, On fractional quadratic optimization problem with two quadratic constraints, An SDP approach for quadratic fractional problems with a two-sided quadratic constraint, Quadratic optimization with two ball constraints, Positivity of Riesz functionals and solutions of quadratic and quartic moment problems, A gentle, geometric introduction to copositive optimization, Recent advances in trust region algorithms, Detecting copositivity of a symmetric matrix by an adaptive ellipsoid-based approximation scheme, S-lemma with equality and its applications, On Convex Hulls of Epigraphs of QCQPs, Finding Minimum Volume Circumscribing Ellipsoids Using Generalized Copositive Programming, Improved Conic Reformulations for $K$-means Clustering, Unnamed Item, A Second-Order Cone Based Approach for Solving the Trust-Region Subproblem and Its Variants, Quaternion matrix decomposition and its theoretical implications, Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods, A penalty decomposition algorithm with greedy improvement for mean‐reverting portfolios with sparsity and volatility constraints, Outcome-space branch-and-bound outer approximation algorithm for a class of non-convex quadratic programming problems, KKT-based primal-dual exactness conditions for the Shor relaxation, Optimization under uncertainty and risk: quadratic and copositive approaches, Distributionally robust expected residual minimization for stochastic variational inequality problems, (Global) optimization: historical notes and recent developments, Approximation hierarchies for copositive cone over symmetric cone and their comparison, Convex hull results on quadratic programs with non-intersecting constraints, Sharp and Fast Bounds for the Celis-Dennis-Tapia Problem, Closing the Gap between Necessary and Sufficient Conditions for Local Nonglobal Minimizer of Trust Region Subproblem, A Block Lanczos Method for the Extended Trust-Region Subproblem, The solution of euclidean norm trust region SQP subproblems via second-order cone programs: an overview and elementary introduction, Minimizing an indefinite quadratic function subject to a single indefinite quadratic constraint, Semidefinite relaxation approximation for multivariate bi‐quadratic optimization with quadratic constraints, Adaptive computable approximation to cones of nonnegative quadratic functions, New Results on Narrowing the Duality Gap of the Extended Celis--Dennis--Tapia Problem, An LMI description for the cone of Lorentz-positive maps, An approach for minimizing a quadratically constrained fractional quadratic problem with application to the communications over wireless channels, Foundations of Set-Semidefinite Optimization, Maximizing the sum of a generalized Rayleigh quotient and another Rayleigh quotient on the unit sphere via semidefinite programming, Robust convex conic optimization in D-induced duality framework, On Conic Relaxations of Generalization of the Extended Trust Region Subproblem, Novel Reformulations and Efficient Algorithms for the Generalized Trust Region Subproblem, Optimal dictionary for least squares representation, Inhomogeneous polynomial optimization over a convex set: An approximation approach, Canonical Dual Solutions to Quadratic Optimization over One Quadratic Constraint, Characterizing Convexity of Images for Quadratic-Linear Mappings with Applications in Nonconvex Quadratic Optimization, A Linear-Time Algorithm for Generalized Trust Region Subproblems
